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
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
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Subgraph centrality in complex networks
Estrada, E., & Rodríguez-Velázquez, J. A. (2005) · Physical Review E · doi:10.1103/physreve.71.056103 · Cited by 1,260
For the Grid and Through the Grid: The Role of Power Line Communications in the Smart Grid
Galli, S., Scaglione, A., & Wang, Z. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2109670 · Cited by 1,002
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
Synchronization Reveals Topological Scales in Complex Networks
Arenas, A., Díaz-Guilera, A., & Pérez-Vicente, C. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.114102 · Cited by 848
Kronecker Graphs: An Approach to Modeling Networks
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., & Ghahramani, Z. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4905 · Cited by 697
Network synchronization, diffusion, and the paradox of heterogeneity
Motter, A. E., Zhou, C., & Kurths, J. (2005) · Physical Review E · doi:10.1103/physreve.71.016116 · Cited by 546
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.65.066122 · Cited by 540
Spectra of random graphs with given expected degrees
Chung, F., Lu, L., & Vu, V. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0937490100 · Cited by 492
Toward link predictability of complex networks
Lü, L., Pan, L., Zhou, T., Zhang, Y.-C., & Stanley, H. E. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1424644112 · Cited by 412
DOULION: counting triangles in massive graphs with a coin
Tsourakakis, C. E., Kang, U., Miller, G. L., & Faloutsos, C. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557111 · Cited by 328
Enhancing complex-network synchronization
Motter, A. E., Zhou, C. S., & Kurths, J. (2005) · Europhysics Letters (EPL) · doi:10.1209/epl/i2004-10365-4 · Cited by 317
Localization and centrality in networks
Martin, T., Zhang, X., & Newman, M. E. J. (2014) · Physical Review E · doi:10.1103/physreve.90.052808 · Cited by 309
Synchronization and desynchronization of complex dynamical networks: an engineering viewpoint
Li, X., & Chen, G. (2003) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/tcsi.2003.818611 · Cited by 306
Dorogovtsev, S. N., Goltsev, A. V., Mendes, J. F. F., & Samukhin, A. N. (2003) · Physical Review E · doi:10.1103/physreve.68.046109 · Cited by 280
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws
Tsourakakis, C. E. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.72 · Cited by 265
Topological Strata of Weighted Complex Networks
Petri, G., Scolamiero, M., Donato, I., & Vaccarino, F. (2013) · PLoS ONE · doi:10.1371/journal.pone.0066506 · Cited by 214
Network spectra for drug-target identification in complex diseases: new guns against old foes
Rai, A., Shinde, P., & Jalan, S. (2018) · Applied Network Science · doi:10.1007/s41109-018-0107-y · Cited by 12
(2015)
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.