Image de couverture de livre

Rumors on evolving graphs through stationary times

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bonasorte, Vicenzo
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Discrete Mathematics Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Cycle-factors of regular graphs via entropy
par: Christoph, Micha, et autres
Publié: (2025)

Faster Mixing of the Jerrum-Sinclair Chain
par: Chen, Xiaoyu, et autres
Publié: (2025)

Sink-free orientations: a local sampler with applications
par: Anand, Konrad, et autres
Publié: (2025)

Constructive l2-Discrepancy Minimization with Additive Deviations
par: Dutta, Kunal
Publié: (2025)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
par: Carlson, Charlie, et autres
Publié: (2024)

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
par: Liu, Jingcheng, et autres
Publié: (2026)

A Tight Bound on Localization of Electrical Flows
par: Gurel-Gurevich, Ori, et autres
Publié: (2026)

Towards an Optimal Contention Resolution Scheme for Matchings
par: Nuti, Pranav, et autres
Publié: (2022)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
par: Jain, Vishesh, et autres
Publié: (2026)

Phase Transitions via Complex Extensions of Markov Chains
par: Liu, Jingcheng, et autres
Publié: (2024)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
par: Feng, Weiming, et autres
Publié: (2025)

Spectral Independence via Stability and Applications to Holant-Type Problems
par: Chen, Zongchen, et autres
Publié: (2021)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
par: Bansal, Nikhil, et autres
Publié: (2025)

Boltzmann Sampling for Powersets without an Oracle
par: Peyen, Jean
Publié: (2026)

Integrating High-Dimensional Functions Deterministically
par: Gamarnik, David, et autres
Publié: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
par: Kunisky, Dmitriy, et autres
Publié: (2023)

The Compilability Thresholds of 2-CNF to OBDD
par: de Colnet, Alexis, et autres
Publié: (2026)

Strong spatial mixing for colorings on trees and its algorithmic applications
par: Chen, Zongchen, et autres
Publié: (2023)

Probabilistic estimates of the diameters of the Rubik's Cube groups
par: Hirata, So
Publié: (2024)

Circle graphs can be recognized in linear time
par: Paul, Christophe, et autres
Publié: (2025)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
par: Berthe, Gaétan, et autres
Publié: (2024)

Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
par: Foucaud, Florent, et autres
Publié: (2025)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
par: Liu, Bowie, et autres
Publié: (2025)

Optimally revealing bits for rejection sampling
par: Langevin, Louis-Roy, et autres
Publié: (2025)

Parameter estimation for Gibbs distributions
par: Harris, David G., et autres
Publié: (2020)

Circular-arc graphs and the Helly property
par: Derbisz, Jan, et autres
Publié: (2024)

The Complexity of Diameter on H-free graphs
par: Oostveen, Jelle J., et autres
Publié: (2024)

Continuous optimization methods for the graph isomorphism problem
par: Klus, Stefan, et autres
Publié: (2023)

Packing $K_r$s in bounded degree graphs
par: McKay, Michael, et autres
Publié: (2022)

Generalizing Roberts' characterization of unit interval graphs
par: Martínez, Virginia Ardévol, et autres
Publié: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
par: Kakimura, Naonori, et autres
Publié: (2024)

Independent set reconfiguration in H-free graphs
par: Bartier, Valentin, et autres
Publié: (2024)

Generation of weighted trees, block trees and block graphs
par: Ekim, Tınaz, et autres
Publié: (2024)

An Algorithm to Recover Shredded Random Matrices
par: Atamanchuk, Caelan, et autres
Publié: (2023)

Max Weight Independent Set in sparse graphs with no long claws
par: Abrishami, Tara, et autres
Publié: (2023)

A polynomial kernel for vertex deletion into bipartite permutation graphs
par: Derbisz, Jan
Publié: (2021)

All ascents exponential from valued constraint graphs of pathwidth three
par: Kaznatcheev, Artem, et autres
Publié: (2026)

Fast approximation algorithms for the 1-median problem on real-world large graphs
par: Ueta, Keisuke, et autres
Publié: (2025)

A column generation algorithm for finding co-3-plexes in chordal graphs
par: Dupont-Bouillard, Alexandre
Publié: (2026)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)