The monomer-dimer spectral independence conjecture

Let G=(V,E)G=(V,E) be a graph, let λ>0\lambda>0, and let μ\mu be the Gibbs distribution of the monomer-dimer model on GG with fugacity λ\lambda. The quantity λmax(Ψμ)\lambda_{\max}(\Psi_\mu) denotes the largest eigenvalue of its influence matrix. The monomer-dimer spectral independence conjecture. For any graph G=(V,E)G=(V,E) and any λ>0\lambda>0, the Gibbs distribution μ\mu of the monomer-dimer model on GG with fugacity λ\lambda has λmax(Ψμ)=Oλ(1)\lambda_{\max}(\Psi_\mu)=O_{\lambda}(1). The conjecture is motivated by the bounded spectral independence observed on regular trees despite their unbounded total influence; it is false for multigraphs with parallel edges, so the simple-graph refinement below is the unresolved form.

Sources & referencesView supporting material

Primary source

Xiaoyu Chen, Xiongxin Yang, Yitong Yin and Xinyuan Zhang, “Spectral Independence Beyond Total Influence on Trees and Related Graphs”, arXiv:2404.04668 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.