Large deviations and exact asymptotics for constrained exponential random graphs
From MaRDI portal
Publication:2517286
Abstract: We present a technique for approximating generic normalization constants subject to constraints. The method is then applied to derive the exact asymptotics for the conditional normalization constant of constrained exponential random graphs.
Recommendations
- On the asymptotics of constrained exponential random graphs
- Ground states for exponential random graphs
- Asymptotic structure of constrained exponential random graph models
- Estimating and understanding exponential random graph models
- On the phase transition curve in a directed exponential random graph model
Cited in
(11)- Ensemble equivalence for dense graphs
- 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
- Asymptotic structure of constrained exponential random graph models
- Ground states for exponential random graphs
- A detailed investigation into near degenerate exponential random graphs
- On the asymptotics of constrained exponential random graphs
- On the lower tail variational problem for random graphs
- The asymptotics of large constrained graphs
- Asymptotics of subexponential max plus networks: the stochastic event graph case
This page was built for publication: Large deviations and exact asymptotics for constrained exponential random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2517286)