English

Decay of correlation for edge colorings when $q>3\Delta$

Data Structures and Algorithms 2025-06-03 v2 Probability

Abstract

We examine various perspectives on the decay of correlation for the uniform distribution over proper qq-edge colorings of graphs with maximum degree Δ\Delta. First, we establish the coupling independence property when q3Δq\ge 3\Delta 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 qq-edge colorings. Next, we prove the strong spatial mixing property on trees, provided that q>(3+o(1))Δq> (3+o(1))\Delta. 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 Δ\Delta if and only if q2Δ1q\ge 2\Delta-1.

Keywords

Cite

@article{arxiv.2502.06586,
  title  = {Decay of correlation for edge colorings when $q>3\Delta$},
  author = {Zejia Chen and Yulin Wang and Chihao Zhang and Zihan Zhang},
  journal= {arXiv preprint arXiv:2502.06586},
  year   = {2025}
}

Comments

Accepted by ICALP 2025