Statistical mechanics of networks.

@article{Park2004StatisticalMO,
  title={Statistical mechanics of networks.},
  author={Juyong Park and Mark E. J. Newman},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2004},
  volume={70 6 Pt 2},
  pages={
          066117
        }
}
  • Juyong Park, M. Newman
  • Published 2004
  • Mathematics, Physics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the same role in the study of networks as is played by the Boltzmann distribution in classical statistical mechanics; they offer the best prediction of network properties subject to the constraints imposed by a given set of observations. We give exact solutions… Expand
Two statistical mechanics aspects of complex networks
By adopting an ensemble interpretation of non-growing rewiring networks, network theory can be reduced to a counting problem of possible network states and an identification of their associatedExpand
The Grand Canonical ensemble of weighted networks
TLDR
This work forms a mapping between weighted networks and lattice gases, making the conceptual step forward of interpreting weighted links as particles with a generalized coordinate, which leads to the definition of the grand canonical ensemble of weighted complex networks. Expand
The statistical physics of real-world networks
TLDR
This Review describes advances in the statistical physics of complex networks and provides a reference for the state of the art in theoretical network modelling and applications to real-world systems for pattern detection and network reconstruction. Expand
A statistical mechanics approach for scale-free networks and finite-scale networks.
We present a statistical mechanics approach for the description of complex networks. We first define an energy and an entropy, associated with a degree distribution, which have a geometricalExpand
How random are complex networks
TLDR
This work considers six real networks and finds that many important local and global structural properties of these networks are closely reproduced by $dk$-random graphs whose degree distributions, degree correlations, and clustering are as in the corresponding real network. Expand
Statistical Ensembles for Economic Networks
Economic networks share with other social networks the fundamental property of sparsity. It is well known that the maximum entropy techniques usually employed to estimate or simulate weightedExpand
Reducing degeneracy in maximum entropy models of networks.
TLDR
This work shows that degeneracy appears when the corresponding density of states function is not log-concave, which is typically the consequence of nonlinear relationships between the constraining observables, and proposes a solution to the degeneracy problem for a large class of systems via transformations that render the density ofStates function log- Concave. Expand
Sampling motif-constrained ensembles of networks
TLDR
Applying the Wang-Landau method to social networks, the relation between transitivity and homophily is investigated, and the correlation between different types of motifs is quantified, finding that single motifs can explain up to 60% of the variation of motif profiles. Expand
Unified model for network dynamics exhibiting nonextensive statistics.
TLDR
A dynamical network model which unifies a number of network families which are individually known to exhibit q-exponential degree distributions is introduced which generalizes network dynamics to rewiring and growth modes which depend on internal topology as well as on a metric imposed by the space they are embedded in. Expand
Quantifying randomness in real networks
TLDR
This work considers six real networks and finds that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 105 REFERENCES
Correlated random networks.
TLDR
More general interactions H(c) are studied which lead to correlations, for example, between the connectivities of adjacent vertices which are argued to be a crucial signature of evolutionary design in biological networks. Expand
Class of correlated random networks with hidden variables.
TLDR
The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure and an extension is presented, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system. Expand
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. Expand
Principles of statistical mechanics of random networks
TLDR
It is shown 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. Expand
Statistical mechanics of scale-free networks at a critical point: complexity without irreversibility?
  • C. Biely, S. Thurner
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
The utility approach establishes a link between classical statistical physics and a wide variety of applications in socioeconomic statistical systems and provides evidence that "complex" networks may arise without irreversibility. Expand
Evolution of networks
TLDR
The recent rapid progress in the statistical physics of evolving networks is reviewed, and how growing networks self-organize into scale-free structures is discussed, and the role of the mechanism of preferential linking is investigated. Expand
Uncorrelated random networks.
  • Z. Burda, A. Krzywicki
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
TLDR
It is found that in the absence of dynamical internode correlations the degree distribution is cut at a degree value scaling like N(gamma), with gamma=min[1/2,1/(beta-1)], where N is the total number of nodes. Expand
Statistical mechanics of topological phase transitions in networks.
TLDR
A phenomenological theory for topological transitions in restructuring networks is provided and by abruptly decreasing the temperature, nonequilibrium processes (e.g., nucleation and growth of particular topological phases) can be interpreted by the present approach. Expand
On a general class of models for interaction
This paper develops a class of probability models for configurations of interacting points in a domain. The distributions depend on a function which may be viewed as giving the potential energy ofExpand
Solution for the properties of a clustered network.
  • Juyong Park, M. Newman
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
We study Strauss's model of a network with clustering and present an analytic mean-field solution which is exact in the limit of large network size. Previous computer simulations have revealed aExpand
...
1
2
3
4
5
...