Statistical mechanics of complex networks
Top Cited Papers
- 30 January 2002
- journal article
- research article
- Published by American Physical Society (APS) in Reviews of Modern Physics
- Vol. 74 (1) , 47-97
- https://doi.org/10.1103/revmodphys.74.47
Abstract
Complex networks describe a wide range of systems in nature and society. Frequently cited examples include the cell, a network of chemicals linked by chemical reactions, and the Internet, a network of routers and computers connected by physical links. While traditionally these systems have been modeled as random graphs, it is increasingly recognized that the topology and evolution of real networks are governed by robust organizing principles. This article reviews the recent advances in the field of complex networks, focusing on the statistical mechanics of network topology and dynamics. After reviewing the empirical data that motivated the recent interest in networks, the authors discuss the main models and analytical tools, covering random graphs, small-world and scale-free networks, the emerging theory of evolving networks, and the interplay between topology and the network’s robustness against failures and attacks.Keywords
All Related Versions
This publication has 140 references indexed in Scilit:
- Scientific collaboration networks. II. Shortest paths, weighted networks, and centralityPhysical Review E, 2001
- Scaling properties of scale-free evolving networks: Continuous approachPhysical Review E, 2001
- Typical Solution Time for a Vertex-Covering Algorithm on Finite-Connectivity Random GraphsPhysical Review Letters, 2001
- Deterministic small-world communication networksInformation Processing Letters, 2000
- Diffusion, localization and dispersion relations on “small-world” latticesZeitschrift für Physik B Condensed Matter, 1999
- Erratum: Small-World Networks: Evidence for a Crossover Picture [Phys. Rev. Lett. 82, 3180 (1999)]Physical Review Letters, 1999
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- Component behavior near the critical point of the random graph processRandom Structures & Algorithms, 1990
- Density and uniqueness in percolationCommunications in Mathematical Physics, 1989
- The Evolution of Random GraphsTransactions of the American Mathematical Society, 1984