Principles of statistical mechanics of random networks
<|reference_start|>Principles of statistical mechanics of random networks: We develop a statistical mechanics approach for random networks with uncorrelated vertices. We construct equilibrium statistical ensembles of such networks and obtain their partition functions and main characteristics. We find simple dynamical construction procedures that produce equilibrium uncorrelated random graphs with an arbitrary degree distribution. In particular, we show that in equilibrium uncorrelated networks, fat-tailed degree distributions may exist only starting from some critical average number of connections of a vertex, in a phase with a condensate of edges.<|reference_end|>
@article{dorogovtsev2002principles,
    title={Principles of statistical mechanics of random networks},
    author={S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin},
    journal={Nucl.Phys. B666 (2003) 396-416},
    year={2002},
    doi={10.1016/S0550-3213(03)00504-2},
    archivePrefix={arXiv},
    eprint={cond-mat/0204111},
    primaryClass={cond-mat.stat-mech cs.NI hep-lat hep-th math-ph math.MP nlin.AO}
}