Ground states for exponential random graphs
From MaRDI portal
Publication:3134136
Abstract: We propose a perturbative method to estimate the normalization constant in exponential random graph models as the weighting parameters approach infinity. As an application, we give evidence of discontinuity in natural parametrization along the critical directions of the edge-triangle model.
Recommendations
- On the phase transition curve in a directed exponential random graph model
- Estimating and understanding exponential random graph models
- Large deviations and exact asymptotics for constrained exponential random graphs
- Asymptotic quantization of exponential random graphs
- On the asymptotics of constrained exponential random graphs
Cites work
- scientific article; zbMATH DE number 3780300 (Why is no real title available?)
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- Asymptotic Enumeration of Spanning Trees
- Asymptotic quantization of exponential random graphs
- Asymptotic structure and singularities in constrained directed graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Critical phenomena in exponential random graphs
- Ensemble equivalence for dense graphs
- Ensemble nonequivalence in random graphs with modular structure
- Estimating and understanding exponential random graph models
- Graphs with maximal number of adjacent pairs of edges
- Large networks and graph limits
- Limits of dense graph sequences
- Multipodal structure and phase transitions in large constrained graphs
- Nonlinear large deviations
- On replica symmetry of large deviations in random graphs
- On the Minimal Density of Triangles in Graphs
- On the asymptotics of constrained exponential random graphs
- On the variational problem for upper tails in sparse random graphs
- Phase transitions in a complex network
- Phase transitions in exponential random graphs
- Polytopes from subgraph statistics
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- Representations for partially exchangeable arrays of random variables
- Singularities in the entropy of asymptotically large simple graphs
- The asymptotics of large constrained graphs
- The entropy of random-free graphons and properties
- The large deviation principle for the Erdős-Rényi random graph
- The phases of large networks with edge and triangle constraints
Cited in
(4)
This page was built for publication: Ground states for exponential random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134136)