Statistical mechanics of complex networks
From MaRDI portal
Publication:3077100
DOI10.1103/RevModPhys.74.47zbMath1205.82086arXivcond-mat/0106096OpenAlexW2124637492WikidataQ21563680 ScholiaQ21563680MaRDI QIDQ3077100
Réka Albert, Albert-Lásló Barabási
Publication date: 21 February 2011
Published in: Reviews of Modern Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0106096
Lua error: not enough memory.
Cites Work
- Deterministic small-world communication networks
- Characteristic vectors of bordered matrices with infinite dimensions
- Characteristic vectors of bordered matrices with infinite dimensions. II
- On the distribution of the roots of certain symmetric matrices
- Mean-field critical behaviour for percolation in high dimensions
- Threshold phenomena in random structures
- Density and uniqueness in percolation
- Degree sequences of random graphs
- Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
- Renormalization group analysis of the small-world network model
- Information transfer and phase transitions in a model of internet traffic
- Spreading and shortest paths in systems with sparse long-range connections
- Emergence of Scaling in Random Networks
- Percolation Processes: Lower Bounds for the Critical Probability
- Some general results concerning the critical exponents of percolation processes
- The Evolution of Random Graphs
- Component behavior near the critical point of the random graph process
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
- On the Behavior of a Random Graph Near a Critical Point
- Collective dynamics of ‘small-world’ networks
- Exploring complex networks
- Models of the small world.
- Dynamics of directed graphs: The world-wide Web
- The diameter of sparse random graphs
- Communication and optimal hierarchical networks
