On metastable configurations of small-world networks
Disordered Systems and Neural Networks
2009-11-11 v1
Abstract
We calculate the number of metastable configurations of Ising small-world networks which are constructed upon superimposing sparse Poisson random graphs onto a one-dimensional chain. Our solution is based on replicated transfer-matrix techniques. We examine the denegeracy of the ground state and we find a jump in the entropy of metastable configurations exactly at the crossover between the small-world and the Poisson random graph structures. We also examine the difference in entropy between metastable and all possible configurations, for both ferromagnetic and bond-disordered long-range couplings.
Cite
@article{arxiv.cond-mat/0510455,
title = {On metastable configurations of small-world networks},
author = {R. Heylen and N. S. Skantzos and J. Busquets Blanco and D. Bolle},
journal= {arXiv preprint arXiv:cond-mat/0510455},
year = {2009}
}
Comments
9 pages, 4 eps figures