The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Emergence of Scaling in Random Networks
Open accessAbstract
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Other topologically constrained networks such as transportation networks and internet routers face similar issues.6”
From Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery (2016) · cites this paper as [6]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Like most social networks, the in-degree distribution in the #Ferguson network follows roughly a powerlaw, with a small number of nodes receiving a disproportionately high number of retweets and mentions, and most receiving none at all (Barabási & Albert, 1999).”
From #Ferguson is everywhere: initiators in emerging counterpublic networks (2016) · cites this paper as Barabási & Albert, 1999
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“A network with the power-law distribution of degrees has the property of scale-freeness, showing that only few linguistic units have the strong general syntactic capacity to combine with other linguistic units (words), while most other linguistic units have weaker combining ability (Barabási and Albert, 1999).”
From Syntactic Networks of Interlanguage Across L2 Modalities and Proficiency Levels (2021) · cites this paper as Barabási and Albert, 1999
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The distribution of degrees of vertices in a complex network and a random network generally follows the power-law distribution and Poisson distribution, respectively (Barabási and Albert, 1999; Newman, 2003, 2010).”
From Syntactic Networks of Interlanguage Across L2 Modalities and Proficiency Levels (2021) · cites this paper as Barabási and Albert, 1999
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“complex network theory has demonstrated that many (non-quantum) systems exhibit similarities in their complex features 14 -18 , in the organization of their structure and dynamics 19 -24 , the controllability of their constituents 25 , and their resilience to structural and dynamical perturbations 26 -31 .”
From Complex networks from classical to quantum (2019) · cites this paper as [15]
The cited source says what the claim attributes to it.
In the citing paper
“Several models, based on mechanisms like preferential attachment 15 , fi tness 94 , or constrained random wiring 54 , to mention some of them, were developed to reproduce degree distributions commonly observed in empirical systems.”
From Complex networks from classical to quantum (2019) · cites this paper as [15]
The cited source says what the claim attributes to it.
In the citing paper
“Concurrent with the formulation of small-world networks, another feature found to be common in many realworld networks is the existence of a small number of highly connected nodes (called “hubs”).6”
From Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery (2016) · cites this paper as [6]
The cited source says what the claim attributes to it.
In the citing paper
“For instance, when new nodes are connected preferentially to a highly connected “rich club,” the degree distribution matches that of other real-world networks, a scenario known as “the rich get richer.”6”
From Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery (2016) · cites this paper as [6]
The cited source says what the claim attributes to it.
In the citing paper
“This network model could be generated using a simple process of sequentially adding nodes to a graph and preferentially attaching them to nodes that already had many connections (e.g., everyone wants to be friends with the popular person).The resulting degree distribution follows a power law.”
From Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery (2016) · cites this paper as [6]
The cited source says what the claim attributes to it.
In the citing paper
“A network with the power-law distribution of degrees has the property of scale-freeness, showing that only few linguistic units have the strong general syntactic capacity to combine with other linguistic units (words), while most other linguistic units have weaker combining ability (Barabási and Albert, 1999).”
From Syntactic Networks of Interlanguage Across L2 Modalities and Proficiency Levels (2021) · cites this paper as Barabási and Albert, 1999
The cited source says what the claim attributes to it.
In the citing paper
“The distribution of degrees of vertices in a complex network and a random network generally follows the power-law distribution and Poisson distribution, respectively (Barabási and Albert, 1999; Newman, 2003, 2010).”
From Syntactic Networks of Interlanguage Across L2 Modalities and Proficiency Levels (2021) · cites this paper as Barabási and Albert, 1999
The cited source says what the claim attributes to it.
In the citing paper
“Traditionally complex network theory explains the evolution of scale-free phenomenon by Bgrowth^and Bpreferential attachment^ (Xie and Levinson 2009;Barabasi and Albert 1999).”
From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Barabasi and Albert 1999
In the citing paper
“A power law connectivity degree distribution is the defining feature of a scale-free network46,47”
From Descending networks transform command signals into population motor control (2024) · cites this paper as [46]
In the citing paper
“It has been found that despite the diversity of complex networks, ranging from the Internet to the protein interaction networks in the cell, most networks obey universal properties: they are small world [8], they are scale free [9], and they have a nontrivial community structure [7].”
From Interdisciplinary and physics challenges of network theory (2015) · cites this paper as [9]
In the citing paper
“Therefore, as long as δ < d − 2, the generalized degree increases dynamically due to an effective “linear preferential attachment24”, according to which the generalized degree of a δ-face increases at each time by one, with a probability increasing linearly with the current value of its generalized degree.”
From Complex Quantum Network Manifolds in Dimension d > 2 are Scale-Free (2015) · cites this paper as [24]
In the citing paper
“As our societies are increasingly instantiated in digital form, once-mathematical abstractions of social processes—networks are one prominent example—become very real parts of daily life”
From Stewardship of global collective behavior (2021) · cites this paper as [23]
In the citing paper
“Here, a better fit is achieved with a scale-free network32; however, neither model simultaneously fits both distributions.”
From A mesoscale connectome of the mouse brain (2014) · cites this paper as [32]
In the citing paper
“suggesting relatively heavier tails and higher inequality, indicating a greater tendency for the emergence of super-hubs-nodes with degrees larger than expected in the standard preferential attachment model (Barabási and Albert 1999).”
From "Rich-Get-Richer"? Platform Attention and Earnings Inequality using Patreon Earnings Data (2025) · cites this paper as Barabási and Albert 1999
In the citing paper
“The preferential attachment model (Barabási and Albert 1999) is based on two mechanisms: growth, where a new node is added at each time step, and preferential attachment, where each new node connects to m existing nodes with a probability proportional to their degrees.”
From "Rich-Get-Richer"? Platform Attention and Earnings Inequality using Patreon Earnings Data (2025) · cites this paper as Barabási and Albert 1999
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Bollobás, B. (1985) · Cited by 6,196
(2017) · Sage eBooks · doi:10.4135/9781483381411.n575 · Cited by 6,067
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (1999) · Nature · doi:10.1038/43601 · Cited by 4,240
Self-citationMean-field theory for scale-free random networks
Barabási, A.-Ĺ., Albert, R., & Jeong, H. (1999) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,261
Self-citationHow 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
Accessibility of information on the web
Lawrence, S., & Giles, C. L. (1999) · Nature · doi:10.1038/21987 · Cited by 1,371
Arthur, W. B. (1999) · Science · doi:10.1126/science.284.5411.107 · Cited by 1,147
Lawrence, S., & Giles, C. L. (1998) · Science · doi:10.1126/science.280.5360.98 · Cited by 975
Research works printed but not linked: 3
- Rényi A., Publ. Math. Inst. Hung. Acad. Sci. 5, 17 (1960);
- Milgram S., Psychol. Today 2, 60 (1967);
- Barthélémy M., Amaral L. A. N., Phys. Rev. Lett. 82, 15 (1999).
Cited by
Sorted by citations
Items 401–500 of 1,152
Cluster synchronization and isolated desynchronization in complex networks with symmetries
Pecora, L. M., Sorrentino, F., Hagerstrom, A. M., Murphy, T. E., & Roy, R. (2014) · Nature Communications · doi:10.1038/ncomms5079 · Cited by 596
Measuring preferential attachment in evolving networks
Jeong, H., Néda, Z., & Barabási, A.-Ĺ. (2003) · Europhysics Letters (EPL) · doi:10.1209/epl/i2003-00166-9 · Cited by 598
Weighted Evolving Networks: Coupling Topology and Weight Dynamics
Barrat, A., Barthélemy, M., & Vespignani, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.228701 · Cited by 594
The fragility of interdependency
Vespignani, A. (2010) · Nature · doi:10.1038/464984a · Cited by 593
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 594
Assessing the risks of ‘infodemics’ in response to COVID-19 epidemics
Gallotti, R., Valle, F., Castaldo, N., Sacco, P., & De Domenico, M. (2020) · Nature Human Behaviour · doi:10.1038/s41562-020-00994-6 · Cited by 591
Topological Analysis of Urban Street Networks
Jiang, B., & Claramunt, C. (2004) · Environment and Planning B Planning and Design · doi:10.1068/b306 · Cited by 591
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
Borgs, C., Chayes, J., Lovász, L., Sós, V. T., & Vesztergombi, K. (2008) · Advances in Mathematics · doi:10.1016/j.aim.2008.07.008 · Cited by 591
Universal scaling for the dilemma strength in evolutionary games
Wang, Z., Kokubo, S., Jusup, M., & Tanimoto, J. (2015) · Physics of Life Reviews · doi:10.1016/j.plrev.2015.04.033 · Cited by 589
Halting viruses in scale-free networks
Dezső, Z., & Barabási, A.-Ĺ. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.65.055103 · Cited by 585
Synchronization in general complex dynamical networks with coupling delays
Li, C., & Chen, G. (2004) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.05.058 · Cited by 584
Dynamics of rumor propagation on small-world networks
Zanette, D. H. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.65.041908 · Cited by 582
A Comparative Analysis of Community Detection Algorithms on Artificial Networks
Yang, Z., Algesheimer, R., & Tessone, C. J. (2016) · Scientific Reports · doi:10.1038/srep30750 · Cited by 835
The power and politics of blogs
Farrell, H. J., & Drezner, D. W. (2007) · Public Choice · doi:10.1007/s11127-007-9198-1 · Cited by 567
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Link prediction based on local random walk
Liu, W., & Lü, L. (2010) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/89/58007 · Cited by 580
A survey of random processes with reinforcement
Pemantle, R. (2007) · Probability Surveys · doi:10.1214/07-ps094 · Cited by 574
Exact controllability of complex networks
Yuan, Z., Zhao, C., Di, Z., Wang, W.-X., & Lai, Y. (2013) · Nature Communications · doi:10.1038/ncomms3447 · Cited by 572
Pinning adaptive synchronization of a general complex dynamical network
Zhou, J., Lu, J.-A., & Lü, J. (2008) · Automatica · doi:10.1016/j.automatica.2007.08.016 · Cited by 573
Identifying and ranking influential spreaders in complex networks by neighborhood coreness
Bae, J., & Kim, S. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.10.047 · Cited by 572
A history of graph entropy measures
Dehmer, M., & Mowshowitz, A. (2010) · Information Sciences · doi:10.1016/j.ins.2010.08.041 · Cited by 568
A Survey of Link Prediction in Social Networks
Hasan, M. A., & Zaki, M. J. (2011) · Springer eBooks · doi:10.1007/978-1-4419-8462-3_9 · Cited by 570
Vázquez, A. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.67.056104 · Cited by 571
Consensus reaching in social network group decision making: Research paradigms and challenges
Dong, Y., Zha, Q., Zhang, H., Kou, G., Fujita, H., Chiclana, F., & Herrera‐Viedma, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.06.036 · Cited by 570
The organization of physiological brain networks
Stam, C. J., & van Straaten, E. C. W. (2012) · Clinical Neurophysiology · doi:10.1016/j.clinph.2012.01.011 · Cited by 591
Harvesting ambient geospatial information from social media feeds
Stefanidis, A., Crooks, A. T., & Radzikowski, J. (2011) · GeoJournal · doi:10.1007/s10708-011-9438-2 · Cited by 568
Microbial ecology of expanding oxygen minimum zones
Wright, J. J., Konwar, K. M., & Hallam, S. J. (2012) · Nature Reviews Microbiology · doi:10.1038/nrmicro2778 · Cited by 579
Nonequilibrium statistical mechanics of the zero-range process and related models
Evans, M. R., & Hanney, T. (2005) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/19/r01 · Cited by 567
COMPLEX NETWORKS: TOPOLOGY, DYNAMICS AND SYNCHRONIZATION
Wang, X. F. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127402004802 · Cited by 565
Toward a Network Perspective of the Study of Resilience in Social-Ecological Systems
Janssen, M. A., Bodin, Ö., Anderies, J. M., Elmqvist, T., Ernstson, H., McAllister, R. R. J., Olsson, P., & Ryan, P. (2006) · Ecology and Society · doi:10.5751/es-01462-110115 · Cited by 566
Clique Percolation in Random Networks
Derényi, I., Palla, G., & Vicsek, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160202 · Cited by 563
Barabási, A.-Ĺ. (2013) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2012.0375 · Cited by 563
Subnets of scale-free networks are not scale-free: Sampling properties of networks
Stumpf, M. P. H., Wiuf, C., & May, R. M. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0501179102 · Cited by 562
Epidemic spreading in correlated complex networks
Boguñá, M., & Pastor‐Satorras, R. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.66.047104 · Cited by 561
Dynamical Organization of Cooperation in Complex Topologies
Gómez‐Gardeñes, J., Campillo, M., Florı́a, L. M., & Moreno, Y. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.108103 · Cited by 542
Modeling cellular machinery through biological network comparison
Sharan, R., & Ideker, T. (2006) · Nature Biotechnology · doi:10.1038/nbt1196 · Cited by 557
Liu, Z., Wu, C., Miao, H., & Wu, H. (2015) · Database · doi:10.1093/database/bav095 · Cited by 555
Bird, C., Gourley, A., Dévanbu, P., Gertz, M., & Swaminathan, A. (2006) · International Conference on Mining Software Repositories (MSR) · doi:10.1145/1137983.1138016 · Cited by 558
Dynamical patterns of epidemic outbreaks in complex heterogeneous networks
Barthélemy, M., Barrat, A., Pastor‐Satorras, R., & Vespignani, A. (2005) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2005.01.011 · Cited by 555
Getting connected: analysis and principles of biological networksPreprint
Zhu, X., Gerstein, M., & Snyder, M. P. (2007) · Genes & Development · doi:10.1101/gad.1528707 · Cited by 564
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D. D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 560
Navigability of interconnected networks under random failures
Domenico, M. D., Solé‐Ribalta, A., Gómez, S., & Arenas, À. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1318469111 · Cited by 545
The structure of the protein universe and genome evolution
Koonin, E. V., Wolf, Y. I., & Karev, G. P. (2002) · Nature · doi:10.1038/nature01256 · Cited by 560
Absence of Epidemic Threshold in Scale-Free Networks with Degree Correlations
Boguñá, M., Pastor‐Satorras, R., & Vespignani, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.028701 · Cited by 553
Millan, M. J. (2006) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2005.11.006 · Cited by 569
Discovery of meaningful associations in genomic data using partial correlation coefficients
de la Fuente, A., Bing, N., Hoeschele, I., & Mendes, P. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth445 · Cited by 552
The Matthew effect in empirical data
Perc, M. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.0378 · Cited by 586
Coupled disease–behavior dynamics on complex networks: A review
Wang, Z., Andrews, M. A., Wu, Z.-X., Wang, L., & Bauch, C. T. (2015) · Physics of Life Reviews · doi:10.1016/j.plrev.2015.07.006 · Cited by 546
Stam, C. J. (2003) · Neuroscience Letters · doi:10.1016/j.neulet.2003.10.063 · Cited by 550
SLAW: A New Mobility Model for Human Walks
Lee, K., Hong, S., Kim, S. J., Rhee, I., & Chong, S. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5061995 · Cited by 552
Social network analysis: A methodological introduction
Butts, C. T. (2008) · Asian Journal Of Social Psychology · doi:10.1111/j.1467-839x.2007.00241.x · Cited by 589
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. M. (2007) · Random Structures and Algorithms · doi:10.1002/rsa.20168 · Cited by 548
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 539
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
Kashtan, N., Itzkovitz, S., Milo, R., & Alon, U. S. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth163 · Cited by 537
Strategic networks and entrepreneurial ventures
Stuart, T. E., & Sorenson, O. (2007) · Strategic Entrepreneurship Journal · doi:10.1002/sej.18 · Cited by 543
Social selection and peer influence in an online social network
Lewis, K., Gonzalez, M., & Kaufman, J. A. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1109739109 · Cited by 561
Agent-based modeling in marketing: Guidelines for rigor
Rand, W. M., & Rust, R. T. (2011) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2011.04.002 · Cited by 541
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.65.066122 · Cited by 540
Colloquium : Criticality and dynamical scaling in living systems
Muñoz, M. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.031001 · Cited by 556
Spectral clustering and the high-dimensional stochastic blockmodel
Rohe, K., Chatterjee, S., & Yu, B. (2011) · The Annals of Statistics · doi:10.1214/11-aos887 · Cited by 537
Integrative approaches for finding modular structure in biological networks
Mitra, K., Carvunis, A.-R., Ramesh, S. K., & Ideker, T. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3552 · Cited by 535
Evolutionary dynamics on any population structure
Allen, B., Lippner, G., Chen, Y.-T., Fotouhi, B., Momeni, N., Yau, S.-T., & Nowak, M. A. (2017) · Nature · doi:10.1038/nature21723 · Cited by 534
Agent-based simulation of innovation diffusion: a review
Kiesling, E., Günther, M., Stummer, C., & Wakolbinger, L. M. (2011) · Central European Journal of Operations Research · doi:10.1007/s10100-011-0210-y · Cited by 558
Random walks in peer-to-peer networks
Gkantsidis, C., Mihail, M., & Saberi, A. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354487 · Cited by 522
Thelwall, M. A. (2008) · Journal of Information Science · doi:10.1177/0165551507087238 · Cited by 542
Is the Boston subway a small-world network?
Latora, V., & Massimo Marchiori, B. (2002) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)01089-0 · Cited by 530
Robustness of interdependent networks under targeted attack
Huang, X., Gao, J., Buldyrev, S. V., Havlin, S., & Stanley, E. (2011) · Physical Review E · doi:10.1103/physreve.83.065101 · Cited by 529
Identifying global regulators in transcriptional regulatory networks in bacteria
Martínez‐Antonio, A., & Collado‐Vides, J. (2003) · Current Opinion in Microbiology · doi:10.1016/j.mib.2003.09.002 · Cited by 547
The Granular Origins of Aggregate Fluctuations
Gabaix, X. (2009) · National Bureau of Economic Research · doi:10.3386/w15286 · Cited by 528
Link prediction techniques, applications, and performance: A survey
Kumar, A., Singh, S. S., Singh, K., & Biswas, B. (2020) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124289 · Cited by 549
The Structure of Complex Networks
Estrada, E. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199591756.001.0001 · Cited by 526
Mocanu, D. C., Mocanu, E., Stone, P., Nguyen, P. H., Gibescu, M., & Liotta, A. (2018) · Nature Communications · doi:10.1038/s41467-018-04316-3 · Cited by 524
TEMPORAL DYNAMICS IN A POLLINATION NETWORK
Olesen, J. M., Bascompte, J., Elberling, H., & Jordano, P. (2008) · Ecology · doi:10.1890/07-0451.1 · Cited by 524
The application of graph theoretical analysis to complex networks in the brain
Reijneveld, J. C., Ponten, S. C., Berendse, H. W., & Stam, C. J. (2007) · Clinical Neurophysiology · doi:10.1016/j.clinph.2007.08.010 · Cited by 520
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Li, L., Alderson, D., Doyle, J. C., & Willinger, W. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129111 · Cited by 570
The Yeast Protein Interaction Network Evolves Rapidly and Contains Few Redundant Duplicate Genes
Wagner, A. (2001) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a003913 · Cited by 520
An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks
Zhang, D., Li, G., Zheng, K., Ming, X.-C., & Pan, Z. (2014) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2013.2250910 · Cited by 521
Physical approach to complex systems
Kwapień, J., & Drożdż, S. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.01.007 · Cited by 532
On distinguishing between Internet power law topology generators
Bu, T., & Towsley, D. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2002.1019309 · Cited by 520
Observability of complex systems
Liu, Y., Slotine, J.-J. E., & Barabási, A.-Ĺ. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1215508110 · Cited by 526
Power Laws in Economics and Finance
Gabaix, X. (2008) · National Bureau of Economic Research · doi:10.3386/w14299 · Cited by 512
Wang, J., Mo, H., Wang, F., & Jin, F. (2010) · Journal of Transport Geography · doi:10.1016/j.jtrangeo.2010.08.012 · Cited by 521
Social network analysis: An overview
Tabassum, S., Pereira, F. S. F., Fernandes, S., & Gama, J. (2018) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1256 · Cited by 581
Error and attack tolerance of complex networks
Crucitti, P., Latora, V., Massimo Marchiori, B., & Rapisarda, A. (2004) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.04.031 · Cited by 512
Community Discovery in Dynamic Networks
Rossetti, G., & Cazabet, R. (2018) · ACM Computing Surveys · doi:10.1145/3172867 · Cited by 532
Network analyses in systems pharmacology
Berger, S., & Iyengar, R. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp465 · Cited by 518
Bonneau, R., Reiss, D. J., Shannon, P., Facciotti, M., Hood, L., Baliga, N. S., & Thorsson, V. (2006) · Genome Biology · doi:10.1186/gb-2006-7-5-r36 · Cited by 510
Structure of growing social networks
Jin, E., Girvan, M., & Newman, M. E. J. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.046132 · Cited by 508
Arasu, A., Cho, J. J., García-Molina, H., Paepcke, A., & Raghavan, S. (2001) · ACM Transactions on Internet Technology · doi:10.1145/383034.383035 · Cited by 504
Spectra of random graphs with given expected degrees
Chung, F., Lü, L., & Vu, V. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0937490100 · Cited by 505
Topological analysis and interactive visualization of biological networks and protein structures
Doncheva, N. T., Assenov, Y., Domingues, F. S., & Albrecht, M. (2012) · Nature Protocols · doi:10.1038/nprot.2012.004 · Cited by 511
Predicting the Behavior of Techno-Social Systems
Vespignani, A. (2009) · Science · doi:10.1126/science.1171990 · Cited by 500
Network Analysis of Protein Structures Identifies Functional Residues
Amitai, G., Shemesh, A., Sitbon, E., Shklar, M., Netanely, D., Venger, I., & Pietrokovski, S. (2004) · Journal of Molecular Biology · doi:10.1016/j.jmb.2004.10.055 · Cited by 506
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 519
Barabási, A.-L. (2012) · Nature Physics · doi:10.1038/nphys2188 · Cited by 502
Self-citationSpectra of “real-world” graphs: Beyond the semicircle law
Farkas, I. J., Derényi, I., Barabási, A.-Ĺ., & Vicsek, T. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.026704 · Cited by 502
Amaral, L. A. N., & Ottino, J. M. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00110-5 · Cited by 511
A decade and a half of protein intrinsic disorder: Biology still waits for physics
Uversky, V. N. (2013) · Protein Science · doi:10.1002/pro.2261 · Cited by 512
A Time-Dependent SIR Model for COVID-19 With Undetectable Infected Persons
Chen, Y.-C., Lu, P.-E., Chang, C.-S., & Liu, T.-H. (2020) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.3024723 · Cited by 536
Properties of highly clustered networks
Newman, M. E. J. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.68.026121 · Cited by 498
Metadata
- Authors
- Barabási, A.-L., & Albert, R.
- Affiliations
- Department of Physics, University of Notre Dame, Notre Dame, IN 46556, USA.
- Venue
- Science
- Published
- 1999-10-15
- Volume
- 286
- Issue
- 5439
- Pages
- 509-512
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2008620264
- Cited by
- 36,135
- References
- 19
- Citations by year
- 2026: 1122 · 2025: 1428 · 2024: 1382 · 2023: 1410 · 2022: 1628 · 2021: 1838 · 2020: 1757 · 2019: 1878 · 2018: 1959 · 2017: 1885 · 2016: 1886 · 2015: 1997 · 2014: 2037 · 2013: 1914 · 2012: 1848
- FWCI
- 104.59
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
- Keywords
- scale-free networks, power-law degree distribution, random networks, preferential attachment, network expansion, self-organization, complex network topology, vertex connectivity
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
