Singularities in the entropy of asymptotically large simple graphs
From MaRDI portal
Publication:2342078
DOI10.1007/s10955-014-1151-3zbMath1320.05064arXiv1302.3531OpenAlexW3099147638MaRDI QIDQ2342078
Publication date: 8 May 2015
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3531
Related Items (23)
Complex networks: structure and functionality ⋮ Reciprocity in directed networks ⋮ A detailed investigation into near degenerate exponential random graphs ⋮ Vertex Order in Some Large Constrained Random Graphs ⋮ Asymptotic structure of constrained exponential random graph models ⋮ Multipodal structure and phase transitions in large constrained graphs ⋮ Moderate deviations in cycle count ⋮ The phases of large networks with edge and triangle constraints ⋮ Typical large graphs with given edge and triangle densities ⋮ Existence of a symmetric bipodal phase in the edge-triangle model ⋮ Ensemble nonequivalence in random graphs with modular structure ⋮ Phase transitions in finite random networks ⋮ Lattice gas models with long range interactions ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph ⋮ Asymptotic structure and singularities in constrained directed graphs ⋮ Ensemble equivalence for dense graphs ⋮ Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality ⋮ Sparse maximum-entropy random graphs with a given power-law degree distribution ⋮ On the asymptotics of constrained exponential random graphs ⋮ An introduction to large deviations for random graphs ⋮ Ground states for exponential random graphs ⋮ The birth of geometry in exponential random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Phase transitions in exponential random graphs
- The large deviation principle for the Erdős-Rényi random graph
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Finitely forcible graphons
- Moments of two-variable functions and the uniqueness of graph limits
- Estimating and understanding exponential random graph models
- Phase transitions in a complex network
- Emergent Structures in Large Networks
- On the Minimal Density of Triangles in Graphs
- Asymptotic Structure of Graphs with the Minimum Number of Triangles
- Networks
This page was built for publication: Singularities in the entropy of asymptotically large simple graphs