Reproduce “Sampling Matchings in Near-linear Time” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Tianshun Miao, Yitong Yin

The authors analyze single-edge Glauber dynamics for sampling graph matchings with probability proportional to λ to the size of the matching. They prove that, for every fixed λ > 0, any simple graph with m edges mixes from any starting matching in Oλ(m[log² n + log(1/ε)]) updates. This is a worst-start bound, not an empirical runtime, and its constants may depend on λ.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.