Decay of correlation for edge colorings when $q>3Ξ”$

February 10, 2025 Β· Declared Dead Β· πŸ› International Colloquium on Automata, Languages and Programming

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zejia Chen, Yulin Wang, Chihao Zhang, Zihan Zhang arXiv ID 2502.06586 Category cs.DS: Data Structures & Algorithms Cross-listed math.PR Citations 3 Venue International Colloquium on Automata, Languages and Programming Last Checked 4 months ago
Abstract
We examine various perspectives on the decay of correlation for the uniform distribution over proper $q$-edge colorings of graphs with maximum degree $Ξ”$. First, we establish the coupling independence property when $q\ge 3Ξ”$ for general graphs. Together with the work of Chen et al. (2024), this result implies a fully polynomial-time approximation scheme (FPTAS) for counting the number of proper $q$-edge colorings. Next, we prove the strong spatial mixing property on trees, provided that $q> (3+o(1))Ξ”$. The strong spatial mixing property is derived from the spectral independence property of a version of the weighted edge coloring distribution, which is established using the matrix trickle-down method developed in Abdolazimi, Liu and Oveis Gharan (FOCS, 2021) and Wang, Zhang and Zhang (STOC, 2024). Finally, we show that the weak spatial mixing property holds on trees with maximum degree $Ξ”$ if and only if $q\ge 2Ξ”-1$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted