Mixing times of Markov chains on high-dimensional simplicial complexes via spectral independence

What the research examines

By proving local-to-global spectral independence for high-dimensional expanders, mathematicians prove rapid O(N log N) mixing times for the Glauber dynamics sampling independent sets and spin glasses up to critical tree thresholds.

Why it may matter

Establishes polynomial-time algorithms for sampling high-dimensional physical Gibbs distributions and counting combinatorics.

What to examine carefully

Spectral independence bounds break down beyond the phase-transition threshold where long-range correlation order sets in.

Try a small, reproducible follow-up

Simulate Glauber dynamics for the hardcore gas model on a random regular graph and estimate the mixing time numerically.

Questions to investigate

1. How is the link graph eigenvalue gap lifted to the global simplicial complex Laplacian?
2. What quantitative modified logarithmic Sobolev inequality constant was established?

These are independently proposed educational investigations, not activities that the original research authors claim to have completed.

Publication & researcher information

Multi-author research may involve universities in several countries. Unverified institutions and contact addresses are not inferred from authors' names.

Primary sources