Fluctuation-dissipation relations for complex networks
arXiv:cond-mat/0509042 · doi:10.1103/PhysRevE.73.016108
Abstract
In the paper, we study fluctuations over several ensembles of maximum-entropy random networks. We derive several fluctuation-dissipation relations characterizing susceptibilities of different networks to changes in external fields. In the case of networks with a given degree sequence, we argue that the scale-free topologies of real-world networks may arise as a result of self-organization of real systems into sparse structures with low susceptibility to random external perturbations. We also show that the ensembles of networks with noninteracting links (both uncorrelated and with two-point correlations) are equivalent to random networks with hidden variables.
9 pages, 2 figures
References in corpus (19)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Evolution of networks
- Resilience of the Internet to random breakdowns
- Breakdown of the Internet under intentional attack
- Generation of uncorrelated random scale-free networks
- The statistical mechanics of networks
- Class of correlated random networks with hidden variables
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Cut-offs and finite size effects in scale-free networks
- A General Formalism for Inhomogeneous Random Graphs
- The origin of degree correlations in the Internet and other networks
- Statistical ensemble of scale-free random graphs
- Correlated random networks
- Uncorrelated Random Networks
- Principles of statistical mechanics of random networks
- Statistical mechanics of topological phase transitions in networks
- Nonextensive information entropy for stochastic networks
Cited by in corpus (10)
- The Physics of Financial Networks
- Maximum likelihood: extracting unbiased information from complex networks
- Entropy of stochastic blockmodel ensembles
- Unbiased sampling of network ensembles
- Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints
- Statistical mechanics of the international trade network
- Exponential random graph models for networks with community structure
- Thermodynamic forces, flows, and Onsager coefficients in complex networks
- Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
- A novel configuration model for random graphs with given degree sequence