Quenched central limit theorems for the Ising model on random graphs
arXiv:1412.5081 · doi:10.1007/s10955-015-1302-1
Abstract
The main goal of the paper is to prove central limit theorems for the magnetization rescaled by for the Ising model on random graphs with vertices. Both random quenched and averaged quenched measures are considered. We work in the uniqueness regime or and , where is the inverse temperature, is the critical inverse temperature and is the external magnetic field. In the random quenched setting our results apply to general tree-like random graphs (as introduced by Dembo, Montanari and further studied by Dommers and the first and third author) and our proof follows that of Ellis in . For the averaged quenched setting, we specialize to two particular random graph models, namely the 2-regular configuration model and the configuration model with degrees 1 and 2. In these cases our proofs are based on explicit computations relying on the solution of the one dimensional Ising models.
arXiv comment37 pages
References in corpus (8)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Critical phenomena in complex networks
- Ising Model on Networks with an Arbitrary Distribution of Connections
- Ferromagnetic ordering in graphs with arbitrary degree distribution
- Ising models on locally tree-like graphs
- Ising models on power-law random graphs
- Mean field dilute ferromagnet I. High temperature and zero temperature behavior