pith. sign in

arxiv: cond-mat/0204111 · v2 · submitted 2002-04-04 · ❄️ cond-mat.stat-mech · cs.NI· hep-lat· hep-th· math-ph· math.MP· nlin.AO

Principles of statistical mechanics of random networks

classification ❄️ cond-mat.stat-mech cs.NIhep-lathep-thmath-phmath.MPnlin.AO
keywords networksequilibriumrandomstatisticaluncorrelateddegreemechanicsapproach
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.