The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Spectra of “real-world” graphs: Beyond the semicircle law
Open accessAbstract
Many natural and social systems develop complex networks that are usually modeled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semicircle law is known to describe the spectral densities of uncorrelated random graphs, much less is known about the spectra of real-world graphs, describing such complex systems as the Internet, metabolic pathways, networks of power stations, scientific collaborations, or movie actors, which are inherently correlated and usually very sparse. An important limitation in addressing the spectra of these systems is that the numerical determination of the spectra for systems with more than a few thousand nodes is prohibitively time and memory consuming. Making use of recent advances in algorithms for spectral characterization, here we develop methods to determine the eigenvalues of networks comparable in size to real systems, obtaining several surprising results on the spectra of adjacency matrices corresponding to models of real-world graphs. We find that when the number of links grows as the number of nodes, the spectral density of uncorrelated random matrices does not converge to the semicircle law. Furthermore, the spectra of real-world graphs have specific features, depending on the details of the corresponding models. In particular, scale-free graphs develop a trianglelike spectral density with a power-law tail, while small-world graphs have a complex spectral density consisting of several sharp peaks. These and further results indicate that the spectra of correlated graphs represent a practical tool for graph classification and can provide useful insight into the relevant structural properties of real networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Bollobás, B. (1985) · Cited by 6,196
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
Self-citationThe structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Self-citationOn power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
Statistical Theory of the Energy Levels of Complex Systems. I
Dyson, F. J. (1962) · Journal of Mathematical Physics · doi:10.1063/1.1703773 · Cited by 2,266
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Self-citationRandom-matrix theories in quantum physics: common concepts
Guhr, T., Müller–Groeling, A., & Weidenmüller, H. A. (1998) · Physics Reports · doi:10.1016/s0370-1573(97)00088-4 · Cited by 2,211
Small Worlds: The Dynamics of Networks between Order and Randomness
Watts, D. J. (1999) · Princeton University Press eBooks · doi:10.1515/9780691188331 · Cited by 2,105
Hierarchical structure in financial markets
Mantegna, R. N. (1999) · The European Physical Journal B · doi:10.1007/s100510050929 · Cited by 2,069
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
Characteristic Vectors of Bordered Matrices With Infinite Dimensions
Wigner, E. P. (1955) · The Annals of Mathematics · doi:10.2307/1970079 · Cited by 1,572
Graham, R., Grötschel, M., & Lovász, L. (1995) · Medical Entomology and Zoology · Cited by 1,526
How popular is your paper? An empirical study of the citation distribution
Redner, S. (1998) · The European Physical Journal B · doi:10.1007/s100510050359 · Cited by 1,509
cacute, C., Vs, M., Doob, M., & Sachs, H. (1980) · Cited by 1,478
On the Distribution of the Roots of Certain Symmetric Matrices
Wigner, E. P. (1958) · The Annals of Mathematics · doi:10.2307/1970008 · Cited by 1,463
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
Self-citationNoise Dressing of Financial Correlation Matrices
Laloux, L., Cizeau, P., Bouchaud, J.-P., & Potters, M. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1467 · Cited by 1,241
Competition and multiscaling in evolving networks
Bianconi, G., & Barabási, A.-L. (2001) · Europhysics Letters (EPL) · doi:10.1209/epl/i2001-00260-6 · Cited by 1,067
Self-citationUniversal and Nonuniversal Properties of Cross Correlations in Financial Time Series
Plerou, V., Gopikrishnan, P., Rosenow, B., Nunes Amaral, L. A., & Stanley, H. E. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1471 · Cited by 1,017
The Web as a Graph: Measurements, Models, and Methods
Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48686-0_1 · Cited by 1,016
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical Review E · doi:10.1103/physreve.63.066123 · Cited by 871
Growth dynamics of the World-Wide Web
Huberman, B. A., & Adamic, L. A. (1999) · Nature · doi:10.1038/43604 · Cited by 863
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
Self-citationComplexity and fragility in ecological networks
Solé, R. V., & Montoya, M. (2001) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2001.1767 · Cited by 799
On the strength of connectedness of a random graph
Erdős, P., & Rényi, A. (1964) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf02066689 · Cited by 785
Characteristic Vectors of Bordered Matrices with Infinite Dimensions II
Wigner, E. P. (1993) · The Collected Works of Eugene Paul Wigner · doi:10.1007/978-3-662-02781-3_36 · Cited by 668
Small World Patterns in Food Webs
MONTOYA, J. M., & SOLÉ, R. V. (2002) · Journal of Theoretical Biology · doi:10.1006/jtbi.2001.2460 · Cited by 623
Wigner, E. P. (1967) · SIAM Review · doi:10.1137/1009001 · Cited by 532
Evolution of networks with aging of sites
Dorogovtsev, S. N., & Mendes, J. F. F. (2000) · Physical Review E · doi:10.1103/physreve.62.1842 · Cited by 438
Mean-Field Solution of the Small-World Network Model
Newman, M. E. J., Moore, C., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.3201 · Cited by 407
On the origin of power laws in Internet topologies
Medina, A., Matta, I., & Byers, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505680.505683 · Cited by 406
Who Is the Best Connected Scientist?A Study of Scientific Coauthorship Networks
Newman, M. E. J. (2004) · Lecture Notes in Physics · doi:10.1007/978-3-540-44485-5_16 · Cited by 379
Characteristics Vectors of Bordered Matrices with Infinite Dimensions II
Wigner, E. P. (1957) · The Annals of Mathematics · doi:10.2307/1969956 · Cited by 321
Degree Distributions of Growing Networks
Krapivsky, P. L., Rodgers, G. J., & Redner, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5401 · Cited by 312
Small-World Networks: Evidence for a Crossover Picture
Barthélémy, M., & Amaral, L. A. N. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.3180 · Cited by 306
Crisanti, A., Paladin, G., & Vulpiani, A. (1993) · Springer Series in Solid-State Sciences · doi:10.1007/978-3-642-84942-8 · Cited by 276
On power-law relationships of the internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.195 · Cited by 266
Scaling properties of scale-free evolving networks: Continuous approach
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.056125 · Cited by 258
Spectra and eigenvectors of scale-free networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review E · doi:10.1103/physreve.64.051903 · Cited by 236
Diameter of the world-wide web
Albert, R., Jeong, H., & Barabási, A.-L. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.182 · Cited by 223
Self-citationBollobás, B., & Thomason, A. (1985) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73612-0 · Cited by 176
Erratum: Small-World Networks: Evidence for a Crossover Picture [Phys. Rev. Lett. 82, 3180 (1999)]
Barthélemy, M., & Amaral, L. A. N. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.5180 · Cited by 79
Relaxation properties of small-world networks
Jespersen, S. N., Sokolov, I. M., & Blumen, A. (2000) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.62.4405 · Cited by 78
Knowing a network by walking on it: emergence of scalingPreprint
Vázquez, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0006132 · Cited by 67
Thick-Restart Lanczos Method for Electronic Structure Calculations
Wu, K. J., Canning, A., Simon, H. D., et al. (1999) · Journal of Computational Physics · doi:10.1006/jcph.1999.6306 · Cited by 51
On the spectrum of a random graph
Juhász, F. (1981) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · Cited by 38
Thick-restart Lanczos method for symmetric eigenvalue problems
Wu, K. J., & Simon, H. D. (1998) · Lecture notes in computer science · doi:10.1007/bfb0018526 · Cited by 16
Growing network with heritable connectivity of nodesPreprint
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0011077 · Cited by 13
Cited by
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Self-citationThe Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
Metadata
- Authors
- Farkas, I. J., Derényi, I., Barabási, A.-L., & Vicsek, T.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-07-20
- Volume
- 64
- Issue
- 2
- Pages
- 026704-026704
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2075984423
- Cited by
- 499
- References
- 59
- FWCI
- 11.37
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.