Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph
From MaRDI portal
Publication:2227186
edge-triangle modelensemble equivalenceErdös-Rényi random graphgraphs limitsphase transitionrare events simulations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Dynamic and nonequilibrium phase transitions (general) in statistical mechanics (82C26)
Abstract: We study the pressure of the "edge-triangle model", which is equivalent to the cumulant generating function of triangles in the Erd"os-R'enyi random graph. By analyzing finite graphs of increasing volume, as well as the graphon variational problem in the infinite volume limit, we locate a curve in the parameter space where a one-step replica symmetry breaking transition occurs. Sampling a large graph in the broken symmetry phase is well described by a graphon with a structure very close to the one of an equi-bipartite graph.
Recommendations
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
- Counting triangles in power-law uniform random graphs
- On the triangle space of a random graph
- Limit laws for the number of triangles in the generalized random graphs with random node weights
- Random triangles in random graphs
- A local central limit theorem for triangles in a random graph
- On triangle-free random graphs
- On certain perturbations of the Erdös-Renyi random graph
- scientific article; zbMATH DE number 932188
Cites work
- A large deviation principle for the Erdős-Rényi uniform random graph
- Applications of Stein's method for concentration inequalities
- Asymptotic structure and singularities in constrained directed graphs
- Asymptotic structure of graphs with the minimum number of triangles
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Counting graph homomorphisms
- Ensemble equivalence for dense graphs
- Equivalence and nonequivalence of ensembles: thermodynamic, macrostate, and measure levels
- Estimating and understanding exponential random graph models
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Imaginary replica analysis of loopy regular random graphs
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Large networks and graph limits
- Limits of dense graph sequences
- Mixing time of exponential random graphs
- Multipodal structure and phase transitions in large constrained graphs
- Networks. An introduction.
- Nonlinear large deviations
- On replica symmetry of large deviations in random graphs
- On the lower tail variational problem for random graphs
- Phase transitions in a complex network
- Rare event simulation for stochastic dynamics in continuous time
- Sampling rare events across dynamical phase transitions
- Simulating rare events in dynamical processes
- Singularities in the entropy of asymptotically large simple graphs
- The importance sampling technique for understanding rare events in Erdős-Rényi random graphs
- The large deviation principle for the Erdős-Rényi random graph
- Thermodynamics of currents in nonequilibrium diffusive systems: theory and simulation
- Two-Point Step Size Gradient Methods
Cited in
(7)- Random processes with convex coordinates on triangular graphs
- Limit theorems for cloning algorithms
- Limit laws for the number of triangles in the generalized random graphs with random node weights
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
- Limit theorems for exponential random graphs
- The GHP scaling limit of uniform spanning trees of dense graphs
- Statistics for the triangle density in ERGM and its mean-field approximation
This page was built for publication: Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227186)
