• Corpus ID: 251903399

Metastable Mixing of Markov Chains: Efficiently Sampling Low Temperature Exponential Random Graphs

@inproceedings{Bresler2022MetastableMO,
  title={Metastable Mixing of Markov Chains: Efficiently Sampling Low Temperature Exponential Random Graphs},
  author={Guy Bresler and Dheeraj M. Nagaraj and Eshaan Nichani},
  year={2022}
}
In this paper we consider the problem of sampling from the low-temperature exponential random graph model (ERGM). The usual approach is via Markov chain Monte Carlo, but strong lower bounds have been established for the ERGM showing that any local Markov chain suffers from an exponentially large mixing time due to metastable states. We instead consider metastable mixing , a notion of approximate mixing within a collection of metastable states. In the case of the ERGM, we show that Glauber… 

References

SHOWING 1-10 OF 32 REFERENCES

Mixing Time of Exponential Random Graphs

In the high temperature regime, where sampling with MCMC is possible, it is shown that any finite collection of edges are asymptotically independent; thus, the model does not possess the desired reciprocity property, and is not appreciably different from the Erdos-Renyi random graph.

Low-temperature Ising dynamics with random initializations

Glauber dynamics on spin systems are well known to suffer exponential slowdowns at low temperatures due to the emergence of multiple metastable phases, separated by narrow bottlenecks that are hard

Fast initial conditions for Glauber dynamics

In the study of Markov chain mixing times, analysis has centered on the performance from a worst-case starting state. Here, in the context of Glauber dynamics for the one-dimensional Ising model, we

Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs

We provide a general bound on the Wasserstein distance between two arbitrary distributions of sequences of Bernoulli random variables. The bound is in terms of a mixing quantity for the Glauber

Exponential random graphs behave like mixtures of stochastic block models

This work generalizes some of the results in a paper by Chatterjee and Diaconis from the dense regime to the sparse regime and strengthens their bounds from the cut-metrics to the one-metric.

Ensemble Markov chain Monte Carlo with teleporting walkers

An ensemble Markov chain Monte Carlo approach to sampling from a probability density with known likelihood is introduced and how interaction can be applied selectively to a subset of state variables in order to maintain advantage on very high-dimensional problems is explained.

Statistics of the two star ERGM

In this paper, we explore the two star Exponential Random Graph Model, which is a two parameter exponential family on the space of simple labeled graphs. We introduce auxiliary variables to express

Sub-critical Exponential random graphs: concentration of measure and some applications

The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough

Random cluster dynamics for the Ising model is rapidly mixing

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the

Asymptotics for sparse exponential random graph models

We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain exact estimates for the mean and variance of the