Multipodal structure and phase transitions in large constrained graphs

DOI10.1007/s10955-017-1804-0zbMath1376.82029arXiv1405.0599OpenAlexW2964329906MaRDI QIDQ2410287

Lorenzo Sadun, Charles Radin, Kui Ren, Richard W. Kenyon

Publication date: 17 October 2017

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.0599

zbMATH Keywords

phase transitionlarge deviation theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Large deviations (60F10) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Density (toughness, etc.) (05C42)

Related Items (25)

Exponential random graphs behave like mixtures of stochastic block models ⋮ A detailed investigation into near degenerate exponential random graphs ⋮ The sample size required in importance sampling ⋮ Large deviation for uniform graphs with given degrees ⋮ Asymptotic structure of constrained exponential random graph models ⋮ Replica symmetry in upper tails of mean-field hypergraphs ⋮ On the maximum number of copies of H in graphs with given size and order ⋮ Moderate deviations in cycle count ⋮ Limits of multi-relational graphs ⋮ 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 ⋮ Phase transitions in finite random networks ⋮ Lattice gas models with long range interactions ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ On the Number of 4-Edge Paths in Graphs With Given Edge Density ⋮ Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph ⋮ Asymptotic structure and singularities in constrained directed graphs ⋮ A large deviation principle for the Erdős-Rényi uniform random graph ⋮ Ensemble equivalence for dense graphs ⋮ Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality ⋮ Recovering nonuniform planted partitions via iterated projection ⋮ An introduction to large deviations for random graphs ⋮ On a Conjecture of Nagy on Extremal Densities ⋮ Ground states for exponential random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique density theorem
• Phase transitions in exponential random graphs
• Asymptotic quantization of exponential random graphs
• Random graphs with a given degree sequence
• 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
• Singularities in the entropy of asymptotically large simple graphs
• Moments of two-variable functions and the uniqueness of graph limits
• Estimating and understanding exponential random graph models
• Critical phenomena in exponential random graphs
• Phase transitions in a complex network
• Emergent Structures in Large Networks
• First order phase transition in a model of quasicrystals
• On replica symmetry of large deviations in random graphs
• Graphs with maximal number of adjacent pairs of edges
• Bipodal Structure in Oversaturated Random Graphs
• On the phase transition curve in a directed exponential random graph model
• The asymptotics of large constrained graphs
• Networks

This page was built for publication: Multipodal structure and phase transitions in large constrained graphs