On the asymptotics of constrained exponential random graphs
From MaRDI portal
Abstract: The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of edges. What does a typical random graph look like, if drawn from an exponential model subject to such constraints? Will there be a similar phase transition phenomenon (as one varies the parameters) as that which occurs in the unconstrained exponential model? We present some general results for this constrained model and then apply them to get concrete answers in the edge-triangle model with fixed density of edges.
Recommendations
- Asymptotic structure of constrained exponential random graph models
- The asymptotics of large constrained graphs
- Asymptotic quantization of exponential random graphs
- Large deviations and exact asymptotics for constrained exponential random graphs
- Asymptotic structure and singularities in constrained directed graphs
Cites work
- Asymptotic quantization of exponential random graphs
- 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
- Critical phenomena in exponential random graphs
- Emergent structures in large networks
- Estimating and understanding exponential random graph models
- scientific article; zbMATH DE number 3780300 (Why is no real title available?)
- Large networks and graph limits
- Limits of dense graph sequences
- Markov Graphs
- Networks. An introduction.
- On the Minimal Density of Triangles in Graphs
- Phase transition in the random triangle model
- Phase transitions in a complex network
- Phase transitions in exponential random graphs
- Random graphs with a given degree sequence
- Random 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 large deviation principle for the Erdős-Rényi random graph
Cited in
(33)- Exponential random graphs behave like mixtures of stochastic block models
- The sample size required in importance sampling
- Ensemble equivalence for dense graphs
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- Rare event asymptotics for exploration processes for random graphs
- Large deviation for uniform graphs with given degrees
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Asymptotics for sparse exponential random graph models
- Asymptotic structure of constrained exponential random graph models
- Large deviations and exact asymptotics for constrained exponential random graphs
- An introduction to large deviations for random graphs
- Emergent structures in large networks
- Ground states for exponential random graphs
- A detailed investigation into near degenerate exponential random graphs
- Vertex order in some large constrained random graphs
- The two-star model: exact solution in the sparse regime and condensation transition
- scientific article; zbMATH DE number 5485245 (Why is no real title available?)
- Exponential Random Graphs as Models of Overlay Networks
- The random triangle model
- Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics
- A Bernstein inequality for exponentially growing graphs
- Phase transitions in the edge/concurrent vertex model
- Asymptotic quantization of exponential random graphs
- On the lower tail variational problem for random graphs
- The asymptotics of large constrained graphs
- scientific article; zbMATH DE number 7639719 (Why is no real title available?)
- The birth of geometry in exponential random graphs
- Asymptotics of subexponential max plus networks: the stochastic event graph case
- Sub-critical exponential random graphs: concentration of measure and some applications
- Typical structure of sparse exponential random graph models
- Limit theorems for exponential random graphs
- Statistics for the triangle density in ERGM and its mean-field approximation
This page was built for publication: On the asymptotics of constrained exponential random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4684845)
