Imagen de Portada

Sampling Simultaneous Edge-Colorings

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Furtado-Tiwari, Ezra, Vigoda, Eric
Formato:	Preprint
Publicado:	2026
Materias:	Discrete Mathematics Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
por: Carlson, Charlie, et al.
Publicado: (2024)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
por: Jain, Vishesh, et al.
Publicado: (2026)

Spectral Independence and Local-to-Global Techniques for Optimal Mixing of Markov Chains
por: Chen, Zongchen, et al.
Publicado: (2023)

Critical window for approximate counting in dense Ising models
por: Galanis, Andreas, et al.
Publicado: (2026)

Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric
por: Carlson, Charlie, et al.
Publicado: (2024)

Spectral Independence via Stability and Applications to Holant-Type Problems
por: Chen, Zongchen, et al.
Publicado: (2021)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
por: Galanis, Andreas, et al.
Publicado: (2023)

Improved Distributed Algorithms for Random Colorings
por: Carlson, Charlie, et al.
Publicado: (2023)

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
por: Galanis, Andreas, et al.
Publicado: (2026)

The Careless Coupon Collector's Problem
por: Cruciani, Emilio, et al.
Publicado: (2026)

Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
por: Austin, Henry, et al.
Publicado: (2026)

Noise sensitivity on affine Weyl groups
por: Tanaka, Ryokichi
Publicado: (2024)

Matchings on Random Regular Hypergraphs
por: Li, Zhongyang
Publicado: (2021)

Theory of Stochastic Drift
por: Kötzing, Timo
Publicado: (2024)

Cutoff for congestion dynamics and related generalized exclusion processes
por: Tanaka, Ryokichi
Publicado: (2025)

Subtractive random forests
por: Broutin, Nicolas, et al.
Publicado: (2022)

Multicoloured Hardcore Model: Fast Mixing and Queueing
por: Olesker-Taylor, Sam
Publicado: (2024)

Probability-graphons: Limits of large dense weighted graphs
por: Abraham, Romain, et al.
Publicado: (2023)

On sampling diluted Spin Glasses using Glauber dynamics
por: Efthymiou, Charilaos, et al.
Publicado: (2024)

Canonical labelling of random regular graphs
por: Isaev, Mikhail, et al.
Publicado: (2026)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
por: Gajjala, Rishikesh
Publicado: (2026)

Random 0/1-polytopes expand rapidly
por: Guo, He, et al.
Publicado: (2026)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
por: Chinyaev, Boris
Publicado: (2025)

A threshold for online balancing of sparse i.i.d. vectors
por: Altschuler, Dylan J., et al.
Publicado: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
por: Gurvits, Leonid, et al.
Publicado: (2023)

Speeding up random walk mixing by starting from a uniform vertex
por: Díaz, Alberto Espuny, et al.
Publicado: (2022)

Limit Laws for Critical Dispersion on Complete Graphs
por: De Ambroggio, Umberto, et al.
Publicado: (2024)

Zero-One Laws for Random Feasibility Problems
por: Altschuler, Dylan J.
Publicado: (2023)

Shotgun assembly of random graphs
por: Johnston, Tom, et al.
Publicado: (2022)

Infinite Schnyder Woods
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
por: Li, Ray, et al.
Publicado: (2025)

Approximate polymorphisms of predicates
por: Alekseev, Yaroslav, et al.
Publicado: (2025)

Record-biased permutations and their permuton limit
por: Bouvel, Mathilde, et al.
Publicado: (2024)

A Proof of Talagrand's Creating Large Sets Conjecture
por: Fang, Xuan, et al.
Publicado: (2025)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
por: Pham, Huy Tuan
Publicado: (2024)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
por: Tiskin, Alexander
Publicado: (2022)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
por: Gamarnik, David, et al.
Publicado: (2023)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Sunflowers in set systems with small VC-dimension
por: Balogh, József, et al.
Publicado: (2024)

Minimum stationary values of sparse random directed graphs
por: Cai, Xing Shi, et al.
Publicado: (2020)