Cover Image

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Carlson, Charlie, Chen, Xiaoyu, Feng, Weiming, Vigoda, Eric
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Data Structures and Algorithms Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
by: Efthymiou, Charilaos, et al.
Published: (2023)

Faster Mixing of the Jerrum-Sinclair Chain
by: Chen, Xiaoyu, et al.
Published: (2025)

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

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
by: Feng, Weiming, et al.
Published: (2025)

Towards an Optimal Contention Resolution Scheme for Matchings
by: Nuti, Pranav, et al.
Published: (2022)

Boltzmann Sampling for Powersets without an Oracle
by: Peyen, Jean
Published: (2026)

Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)

Deterministic counting from coupling independence
by: Chen, Xiaoyu, et al.
Published: (2024)

Efficient Rejection Sampling in the Entropy-Optimal Range
by: Draper, Thomas L., et al.
Published: (2025)

Phase Transitions via Complex Extensions of Markov Chains
by: Liu, Jingcheng, et al.
Published: (2024)

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
by: Liu, Jingcheng, et al.
Published: (2026)

A Tight Bound on Localization of Electrical Flows
by: Gurel-Gurevich, Ori, et al.
Published: (2026)

Sink-free orientations: a local sampler with applications
by: Anand, Konrad, et al.
Published: (2025)

Constructive l2-Discrepancy Minimization with Additive Deviations
by: Dutta, Kunal
Published: (2025)

Rumors on evolving graphs through stationary times
by: Bonasorte, Vicenzo
Published: (2025)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
by: Dudeja, Aditi, et al.
Published: (2024)

Sampling Simultaneous Edge-Colorings
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)

Optimally revealing bits for rejection sampling
by: Langevin, Louis-Roy, et al.
Published: (2025)

Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
by: Chen, Xiaoyu, et al.
Published: (2024)

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
by: Mömke, Tobias, et al.
Published: (2024)

Integrating High-Dimensional Functions Deterministically
by: Gamarnik, David, et al.
Published: (2024)

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025)

Approximate Realizations for Outerplanaric Degree Sequences
by: Bar-Noy, Amotz, et al.
Published: (2024)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
by: Gamarnik, David, et al.
Published: (2026)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)

Max Weight Independent Set in sparse graphs with no long claws
by: Abrishami, Tara, et al.
Published: (2023)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
by: Nanta, Jiratchaphat, et al.
Published: (2025)

Online Graph Coloring for $k$-Colorable Graphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2025)

Optimal Generation of Strictly Increasing Binary Trees and Beyond
by: Bodini, Olivier, et al.
Published: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)

Parameter estimation for Gibbs distributions
by: Harris, David G., et al.
Published: (2020)

Explicit Min-wise Hash Families with Optimal Size
by: Chen, Xue, et al.
Published: (2025)

Edge Clique Partition and Cover Beyond Independence
by: Fomin, Fedor V., et al.
Published: (2025)