Singularities in the entropy of asymptotically large simple graphs

Abstract

We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.

Several new results are added. Future versions will be available at http://www.ma.utexas.edu/users/radin/papers.html

References in corpus (2)

• Phase transitions in a complex network
• Phase transitions in exponential random graphs

Cited by in corpus (15)

• The phases of large networks with edge and triangle constraints
• Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution
• Ensemble nonequivalence in random graphs with modular structure
• On the lower tail variational problem for random graphs
• Asymptotic structure and singularities in constrained directed graphs
• On the asymptotics of constrained exponential random graphs
• Reciprocity in directed networks
• Asymptotics for Sparse Exponential Random Graph Models
• The birth of geometry in exponential random graphs
• Elusive extremal graphs
• A detailed investigation into near degenerate exponential random graphs
• Large deviations and exact asymptotics for constrained exponential random graphs
• Phase Transitions in Edge-Weighted Exponential Random Graphs: Near-Degeneracy and Universality
• Lattice Gas Models with Long Range Interactions
• Ground States for Exponential Random Graphs