Approximate Sampling of Graphs with Near-$P$-stable Degree Intervals
P\'eter L. Erd\H{o}s, Tam\'as R\'obert Mezei, Istv\'an Mikl\'os

TL;DR
This paper extends the understanding of Markov chain mixing times for sampling graphs with degree intervals, demonstrating rapid mixing when intervals are centered at P-stable degree sequences, which broadens applicability in network analysis.
Contribution
It generalizes previous results by proving rapid mixing of the degree interval Markov chain for intervals centered at P-stable degree sequences, beyond thin interval cases.
Findings
Proves rapid mixing of the degree interval Markov chain for P-stable degree sequences.
Extends previous results to broader classes of degree intervals.
Enhances methods for uniform sampling of graph realizations in network analysis.
Abstract
The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One approach is using Markov chains. The best available current result about the well-studied switch Markov chain is that it is rapidly mixing on P-stable degree sequences (see DOI:10.1016/j.ejc.2021.103421). The switch Markov chain does not change any degree sequence. However, there are cases where degree intervals are specified rather than a single degree sequence. (A natural scenario where this problem arises is in hypothesis testing on social networks that are only partially observed.) Rechner, Strowick, and M\"uller-Hannemann introduced in 2018 the notion of degree interval Markov chain which uses three (separately well-studied) local operations (switch, hinge-flip and toggle), and employing on degree…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Machine Learning and Algorithms · Tensor decomposition and applications
