Sub-critical exponential random graphs: concentration of measure and some applications
DOI10.1090/TRAN/8690MaRDI QIDQ6567137FDOQ6567137
Authors: Shirshendu Ganguly, Kyeongsik Nam 
Publication date: 4 July 2024
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Asymptotic properties of parametric estimators (62F12) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Discrete-time Markov processes on general state spaces (60J05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)
Cites Work
- Title not available (Why is that?)
- Large networks and graph limits
- An Exponential Family of Probability Distributions for Directed Graphs
- Markov Graphs
- The concentration of measure phenomenon
- Estimating and understanding exponential random graph models
- Consistency under sampling of exponential random graph models
- Neural networks and physical systems with emergent collective computational abilities.
- Title not available (Why is that?)
- Normal fluctuations and the FKG inequalities
- Entropy, large deviations, and statistical mechanics.
- Dobrushin uniqueness theorem and logarithmic Sobolev inequalities
- Title not available (Why is that?)
- The equivalence of the logarithmic Sobolev inequality and the Dobrushin- Shlosman mixing condition
- The logarithmic Sobolev inequality for discrete spin systems on a lattice
- Approach to equilibrium of Glauber dynamics in the one phase region. I: The attractive case
- Approach to equilibrium of Glauber dynamics in the one phase region. II: The general case
- Glauber dynamics on trees and hyperbolic graphs
- Asymptotics for sparse exponential random graph models
- Nonlinear large deviations
- Phase transitions in exponential random graphs
- On the asymptotics of constrained exponential random graphs
- The large deviation principle for the Erdős-Rényi random graph
- Applications of Stein's method for concentration inequalities
- Mixing time of exponential random graphs
- An introduction to large deviations for random graphs
- Stein's method for concentration inequalities
- Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields
- Concentration inequalities for functions of Gibbs fields with application to diffraction and random Gibbs measures
- Title not available (Why is that?)
- A proof of the generalized second limittheorem in the theory of probability.
- Regression from dependent observations
- A general central limit theorem for FKG systems
- Estimation in spin glasses: a first step
- Logarithmic Sobolev inequalities in discrete product spaces
- Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs
- Logarithmic Sobolev inequalities for finite spin systems and applications
- Inference in Ising models
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Exponential random graphs behave like mixtures of stochastic block models
- Stein's method for positively associated random variables with applications to the Ising and voter models, bond percolation, and contact process
- Joint estimation of parameters in Ising model
- Mixing time of vertex-weighted exponential random graphs
Cited In (1)
This page was built for publication: Sub-critical exponential random graphs: concentration of measure and some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567137)
