Mixing time of exponential random graphs
From MaRDI portal
Publication:657693
DOI10.1214/10-AAP740zbMath1238.60011arXiv0812.2265WikidataQ105584278 ScholiaQ105584278MaRDI QIDQ657693
Allan Sly, Guy Bresler, Shankar Bhamidi
Publication date: 10 January 2012
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2265
Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)
Related Items
A perfect sampling method for exponential family random graph models, Graphical construction of spatial Gibbs random graphs, Weighted exponential random graph models: scope and large network limits, Exponential random graphs behave like mixtures of stochastic block models, Dimension reduction in vertex-weighted exponential random graphs, A Novel Simulation Method for Binary Discrete Exponential Families, With Application to Social Networks, On replica symmetry of large deviations in random graphs, Consistency under sampling of exponential random graph models, Logarithmic Sobolev inequalities for finite spin systems and applications, Concentration and consistency results for canonical and curved exponential-family models of random graphs, Applications of Stein's method for concentration inequalities, Replica symmetry in upper tails of mean-field hypergraphs, A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015, On the mixing time of geographical threshold graphs, Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs, A note on perfect simulation for Exponential Random Graph Models, VARIETIES OF INTERGOVERNMENTAL ORGANIZATION MEMBERSHIPS AND STRUCTURAL EFFECTS IN THE WORLD TRADE NETWORK, Mixing and concentration by Ricci curvature, Estimating and understanding exponential random graph models, Critical phenomena in exponential random graphs, Efficient MCMC for Gibbs random fields using pre-computation, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Perspectives on exponential random graphs, Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph, Configuring Random Graph Models with Fixed Degree Sequences, Ensemble equivalence for dense graphs, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs, Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics, Consistent structure estimation of exponential-family random graph models with block structure, An introduction to large deviations for random graphs, Mixing time of vertex-weighted exponential random graphs, A note on parallel sampling in Markov graphs, The Kronecker-clique model for higher-order clustering coefficients, Statistics of the two star ERGM
Cites Work
- Unnamed Item
- Unnamed Item
- The large deviation principle for the Erdős-Rényi random graph
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Statistical mechanics of complex networks
- On Counting Independent Sets in Sparse Graphs
- Information Theory and Statistical Mechanics
- Markov Graphs
- The Selection of Prior Distributions by Formal Rules
- The Structure and Function of Complex Networks
- Randomly coloring graphs with lower bounds on girth and maximum degree
- Quasi-random graphs
