Limit theorems for exponential random graphs

We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together with a complete characterization of the phase diagram of the model. We borrow tools from statistical mechanics to obtain limit theorems for the edge density. First, we determine the asymptotic distribution of this quantity, as the graph size tends to infinity, in the various phases. Then we study the fluctuations of the edge density around its average value off the critical curve and formulate conjectures about the behavior at criticality based on the analysis of a mean-field approximation of the model. Some of our results can be extended with no substantial changes to more general classes of exponential random graphs.

Authors

Institutions

Publication Details

Journal
The Annals of Applied Probability
Published
2024-09-27
DOI
https://doi.org/10.1214/24-aap2084
Citations
5
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
3.56
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Limit theorems for exponential random graphs

Francesca Collet, Elena Magnanini, Alessandra Bianchi
5 citations
The Annals of Applied Probability
Stochastic processes and statistical mechanics
3.56
article

Limit theorems for exponential random graphs

Francesca Collet, Elena Magnanini, Alessandra Bianchi
article en
5 citations

Abstract

We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together with a complete characterization of the phase diagram of the model. We borrow tools from statistical mechanics to obtain limit theorems for the edge density. First, we determine the asymptotic distribution of this quantity, as the graph size tends to infinity, in the various phases. Then we study the fluctuations of the edge density around its average value off the critical curve and formulate conjectures about the behavior at criticality based on the analysis of a mean-field approximation of the model. Some of our results can be extended with no substantial changes to more general classes of exponential random graphs.

The Annals of Applied ProbabilityVol. 34(5)
University of Verona (IT), University of Padua (IT), Civita (IT)
Affordable and clean energy
Openalex Percentile: Top 9%
Stochastic processes and statistical mechanics
3.56
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Limit theorems for exponential random graphs — Francesca Collet, Elena Magnanini, et al. · The Annals of Applied Probability (2024) | TGRS Research Map | TGRS