On large deviation properties of Erdős-Rényi random graphs

DOI10.1007/s10955-004-2268-6zbMath1113.82031arXivcond-mat/0311535OpenAlexW2318709160MaRDI QIDQ852126

Alexander K. Hartmann, Andreas Engel, Remi Monasson

Publication date: 27 November 2006

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

Full work available at URL: https://arxiv.org/abs/cond-mat/0311535

zbMATH Keywords

random graphslarge deviationsPotts modelcavity method

Mathematics Subject Classification ID

Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Large deviations (60F10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Properties of atypical graphs from negative complexities ⋮ Statistical Physics and Network Optimization Problems ⋮ A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph ⋮ Large-deviation properties of largest component for random graphs ⋮ Large-deviation properties of SIR model incorporating protective measures ⋮ Efficient large deviation estimation based on importance sampling ⋮ The percolation transition in correlated hypergraphs ⋮ The large deviations of the whitening process in random constraint satisfaction problems ⋮ Reducing a cortical network to a Potts model yields storage capacity estimates ⋮ Large deviations of empirical neighborhood distribution in sparse random graphs ⋮ Large deviation theory of percolation on multiplex networks

Cites Work

• Properties of atypical graphs from negative complexities
• Some large deviation results for sparse random graphs
• On the Fluctuations of the Giant Component
• The degree sequence of a scale-free random graph process
• Statistical mechanics of complex networks
• Large deviations for Small buffers: An insensitivity result
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item