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 801–900 of 1,152
Analysis of biological networks
Ortutay, C., & Ortutay, Z. (2017) · Wiley eBooks · doi:10.1002/9781119165057.ch10 · Cited by 329
A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
Solé, R. V., Pastor‐Satorras, R., Smith, E., & Kepler, T. B. (2002) · Advances in Complex Systems · doi:10.1142/s021952590200047x · Cited by 324
Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia
Capocci, A., Servedio, V. D. P., Colaiori, F., Buriol, L. S., Donato, D., Leonardi, S., & Caldarelli, G. (2006) · Physical Review E · doi:10.1103/physreve.74.036116 · Cited by 330
Structural systems biology: modelling protein interactions
Aloy, P., & Russell, R. B. (2006) · Nature Reviews Molecular Cell Biology · doi:10.1038/nrm1859 · Cited by 334
Siew, C. S. Q., Wulff, D. U., Beckage, N., & Kenett, Y. N. (2019) · Complexity · doi:10.1155/2019/2108423 · Cited by 351
van den Heuvel, M. P., Bullmore, E. T., & Sporns, O. (2016) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2016.03.001 · Cited by 328
Network biology concepts in complex disease comorbidities
Hu, J. X., Thomas, C. E., & Brunak, S. (2016) · Nature Reviews Genetics · doi:10.1038/nrg.2016.87 · Cited by 328
Local Probabilistic Models for Link Prediction
Wang, C., Satuluri, V., & Parthasarathy, S. (2007) · Proceedings · doi:10.1109/icdm.2007.108 · Cited by 330
Complex Systems Research in Educational Psychology: Aligning Theory and Method
Hilpert, J. C., & Marchand, G. C. (2018) · Educational Psychologist · doi:10.1080/00461520.2018.1469411 · Cited by 344
Zhao, K., Zuo, Z., & Blackhurst, J. V. (2019) · Journal of Operations Management · doi:10.1002/joom.1009 · Cited by 344
Average path length in random networks
Fronczak, A., Fronczak, P., & Hołyst, J. A. (2004) · Physical Review E · doi:10.1103/physreve.70.056110 · Cited by 327
Universal robustness characteristic of weighted networks against cascading failure
Wang, W.-X., & Chen, G. (2008) · Physical Review E · doi:10.1103/physreve.77.026101 · Cited by 327
Comprehensive curation and analysis of global interaction networks in Saccharomyces cerevisiae
Reguly, T., Breitkreutz, A., Boucher, L., Breitkreutz, B.-J., Hon, G. C., Myers, C. L., Parsons, A., Friesen, H., Oughtred, R., Tong, A., et al. (2006) · Journal of Biology · doi:10.1186/jbiol36 · Cited by 326
Genomic analysis of essentiality within protein networks
Yu, H., Greenbaum, D. S., Lu, H. X., Zhu, X., & Gerstein, M. (2004) · Trends in Genetics · doi:10.1016/j.tig.2004.04.008 · Cited by 325
Betweenness centrality correlation in social networks
Goh, K.-I., Oh, E., Kahng, B., & Kim, D. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.67.017101 · Cited by 325
On multiple description streaming with content delivery networks
Apostolopoulos, J., Wong, T., Tan, W.-T., & Wee, S. J. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2002.1019427 · Cited by 325
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 324
Helbing, D. (2012) · Understanding complex systems · doi:10.1007/978-3-642-24004-1_2 · Cited by 337
Duplication Models for Biological Networks
Chung, F., Lü, L., Dewey, T. G., & Galas, D. J. (2003) · Journal of Computational Biology · doi:10.1089/106652703322539024 · Cited by 316
Horvath, S. (2011) · Springer eBooks · doi:10.1007/978-1-4419-8819-5 · Cited by 320
Identifying a set of influential spreaders in complex networks
Zhang, J., Chen, D., Dong, Q., & Zhao, Z.-D. (2016) · Scientific Reports · doi:10.1038/srep27823 · Cited by 339
The financial accelerator in an evolving credit network
Gatti, D. D., Gallegati, M., Greenwald, B. C. N., Russo, A., & Stiglitz, J. E. (2010) · Journal of Economic Dynamics and Control · doi:10.1016/j.jedc.2010.06.019 · Cited by 317
Bollobás, B., Borgs, C., Chayes, J., & Riordan, O. M. (2003) · doi:10.5555/644108.644133 · Cited by 322
Control Centrality and Hierarchical Structure in Complex Networks
Liu, Y., Slotine, J.-J. E., & Barabási, A.-Ĺ. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044459 · Cited by 319
Core–Periphery Structure in the Overnight Money Market: Evidence from the e-MID Trading Platform
Fricke, D., & Lux, T. (2014) · Computational Economics · doi:10.1007/s10614-014-9427-x · Cited by 304
Kleinberg, J. M., & Lawrence, S. (2001) · Science · doi:10.1126/science.1067014 · Cited by 322
Opinion Dynamics and the Evolution of Social Power in Influence Networks
Jia, P., Mirtabatabaei, A., Friedkin, N. E., & Bullo, F. (2015) · SIAM Review · doi:10.1137/130913250 · Cited by 327
Eigenvector centrality of nodes in multiplex networks
Solá, L., Romance, M., Criado, R., Flores, J., del Amo, A. G., & Boccaletti, S. (2013) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4818544 · Cited by 327
Using network science to evaluate exercise-associated brain changes in older adults.
Burdette (2010) · Frontiers in Aging Neuroscience · doi:10.3389/fnagi.2010.00023 · Cited by 320
Network structure and the biology of populations
May, R. M. (2006) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2006.03.013 · Cited by 322
Blum, A. L., Hopcroft, J. E., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 334
Modeling and Predicting Popularity Dynamics via Reinforced Poisson Processes
Shen, H., Wang, D., Song, C., & Barabási, A.-Ĺ. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8739 · Cited by 319
Plant Trait Networks: Improved Resolution of the Dimensionality of Adaptation
He, N., Li, Y., Liu, C., Xu, L., Li, M., Zhang, J., He, J., Tang, Z., Han, X., Ye, Q., et al. (2020) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2020.06.003 · Cited by 329
Explosive Percolation Is Continuous
Riordan, O. M., & Warnke, L. (2011) · Science · doi:10.1126/science.1206241 · Cited by 317
Predictive effects of structural variation on citation counts
Chen, C. (2011) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21694 · Cited by 317
Chen, B., Li, J., Wu, X., Han, M., Zeng, L., Li, Z., & Chen, G. Q. (2017) · Applied Energy · doi:10.1016/j.apenergy.2017.10.113 · Cited by 318
A network analysis of the Chinese stock market
Huang, W.-Q., Xin-tian, Z., & Yao, S. (2009) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2009.03.028 · Cited by 316
Zhao, K., Kumar, A., Harrison, T. P., & Yen, J. (2011) · IEEE Systems Journal · doi:10.1109/jsyst.2010.2100192 · Cited by 316
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 315
Forup, M. L., Henson, K. S. E., Craze, P. G., & Memmott, J. (2007) · Journal of Applied Ecology · doi:10.1111/j.1365-2664.2007.01390.x · Cited by 315
Semantic memory: A review of methods, models, and current challenges
Kumar, A. A. (2020) · Psychonomic Bulletin & Review · doi:10.3758/s13423-020-01792-x · Cited by 350
When is hub gene selection better than standard meta-analysis?
Langfelder, P., Mischel, P. S., & Horvath, S. (2013) · PLoS ONE · doi:10.1371/journal.pone.0061505 · Cited by 313
Hendler, J., Shadbolt, N., Hall, W., Berners‐Lee, T., & Weitzner, D. J. (2008) · Communications of the ACM · doi:10.1145/1364782.1364798 · Cited by 312
Network Properties Revealed through Matrix Functions
Estrada, E., & Higham, D. J. (2010) · SIAM Review · doi:10.1137/090761070 · Cited by 311
Pinning synchronization of delayed dynamical networks via periodically intermittent control
Xia, W., & Cao, J. (2009) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3071933 · Cited by 313
Onset of synchronization in large networks of coupled oscillators
Restrepo, J. G., Ott, E., & Hunt, B. R. (2005) · Physical Review E · doi:10.1103/physreve.71.036151 · Cited by 312
Cho, J. J., & García-Molina, H. (2002) · International World Wide Web Conference (WWW) · doi:10.1145/511446.511464 · Cited by 312
Epskamp, S., Maris, G., Waldorp, L., & Borsboom, D. (2018) · Wiley eBooks · doi:10.1002/9781118489772.ch30 · Cited by 316
Size-dependent degree distribution of a scale-free growing network
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.63.062101 · Cited by 311
The Average Distance in a Random Graph with Given Expected Degrees
Chung, F., & Lü, L. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129081 · Cited by 311
Attack vulnerability of scale-free networks due to cascading breakdown
Zhao, L., Park, K., & Lai, Y. (2004) · Physical Review E · doi:10.1103/physreve.70.035101 · Cited by 311
A New Measure of Centrality for Brain Networks
Joyce, K. E., Laurienti, P. J., Burdette, J. H., & Hayasaka, S. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012200 · Cited by 318
Markose, S. M., Giansante, S., & Shaghaghi, A. R. (2012) · Journal of Economic Behavior & Organization · doi:10.1016/j.jebo.2012.05.016 · Cited by 304
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 310
Human Disease-Drug Network Based on Genomic Expression Profiles
Hu, G., & Agarwal, P. (2009) · PLoS ONE · doi:10.1371/journal.pone.0006536 · Cited by 309
Spontaneous recovery in dynamical networks
Majdandzic, A., Boris Podobnik, A., Buldyrev, S. V., Kenett, D. Y., Havlin, S., & Stanley, E. (2013) · Nature Physics · doi:10.1038/nphys2819 · Cited by 310
The Effects of the Social Structure of Digital Networks on Viral Marketing Performance
Bampo, M., Ewing, M. T., Mather, D. R., Stewart, D., & Wallace, M. G. (2008) · Information Systems Research · doi:10.1287/isre.1070.0152 · Cited by 310
Inter-similarity between coupled networks
Parshani, R., Rozenblat, C., Ietri, D., Ducruet, C., & Havlin, S. (2010) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/92/68002 · Cited by 309
The topology of collective leadership
Contractor, N., DeChurch, L. A., Carson, J. B., Carter, D. R., & Keegan, B. (2012) · The Leadership Quarterly · doi:10.1016/j.leaqua.2012.10.010 · Cited by 334
Generating Simple Random Graphs with Prescribed Degree Distribution
Britton, T., Deijfen, M., & Martin‐Löf, A. (2006) · Journal of Statistical Physics · doi:10.1007/s10955-006-9168-x · Cited by 309
Stability and Topology of Scale-Free Networks under Attack and Defense Strategies
Gallos, L. K., Reuven Cohen, C., Argyrakis, P., Armin Bunde, A., & Havlin, S. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.188701 · Cited by 309
An analysis of social network-based Sybil defenses
Viswanath, B., Post, A., Gummadi, K. P., & Mislove, A. E. (2010) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1851182.1851226 · Cited by 308
Bae, J., & Insead, M. G. (2004) · Academy of Management Journal · doi:10.2307/20159626 · Cited by 357
Optimizing complex networks for resilience against cascading failure
Ash, J., & Newth, D. (2007) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.12.058 · Cited by 311
Star Performers in Twenty‐First Century Organizations
Aguinis, H., & O’Boyle, E. H. (2013) · Personnel Psychology · doi:10.1111/peps.12054 · Cited by 308
Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem
Balasundaram, B., Butenko, S. I., & Hicks, I. V. (2011) · Operations Research · doi:10.1287/opre.1100.0851 · Cited by 308
Evolvability and hierarchy in rewired bacterial gene networks
Isalan, M., Lemerle, C., Michalodimitrakis, K., Horn, C., Beltrao, P., Raineri, E., Garriga-Canut, M., & Serrano, L. (2008) · Nature · doi:10.1038/nature06847 · Cited by 307
Sampling biases in IP topology measurements
Lakhina, A., Byers, J. W., Crovella, M. E., & Xie, P. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1208685 · Cited by 307
Serration and noise behaviors in materials
Zhang, Y., Liu, J., Chen, S. Y., Xie, X., Liaw, P. K., Dahmen, K. A., Qiao, J. W., & Wang, Y. L. (2017) · Progress in Materials Science · doi:10.1016/j.pmatsci.2017.06.004 · Cited by 307
Giant strongly connected component of directed networks
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.025101 · Cited by 306
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
Brain networks under attack: robustness properties and the impact of lesions
Aerts, H., Fias, W., Caeyenberghs, K., & Marinazzo, D. (2016) · Brain · doi:10.1093/brain/aww194 · Cited by 310
Adversarial Attack and Defense on Graph Data: A Survey
Sun, L., Dou, Y., Yang, C., Zhang, K., Wang, J., Yu, P. S., He, L., & Li, B. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3201243 · Cited by 373
Coevolution spreading in complex networks
Wang, W., Liu, Q.-H., Liang, J., Hu, Y., & Zhou, T. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.07.001 · Cited by 309
Public transport networks: empirical analysis and modeling
von Ferber, C., Holovatch, T., Holovatch, Y. V., & Palchykov, V. (2009) · The European Physical Journal B · doi:10.1140/epjb/e2009-00090-x · Cited by 305
What Can Graph Theory Tell Us About Word Learning and Lexical Retrieval?
Vitevitch, M. S. (2008) · Journal of Speech Language and Hearing Research · doi:10.1044/1092-4388(2008/030 · Cited by 305
The Rise and Fall of Small Worlds: Exploring the Dynamics of Social Structure
Gulati, R., Sytch, M., & Tatarynowicz, A. (2010) · Organization Science · doi:10.1287/orsc.1100.0592 · Cited by 305
Topology of the conceptual network of language
Motter, A. E., de Moura, A. P. S., Lai, Y., & Dasgupta, P. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.65.065102 · Cited by 304
Generative models of the human connectome
Betzel, R. F., Avena-Koenigsberger, A., Goñi, J., He, Y., de Reus, M. A., Griffa, A., Vértes, P. E., Mišic, B., Thiran, J.-P., Hagmann, P., et al. (2016) · NeuroImage · doi:10.1016/j.neuroimage.2015.09.041 · Cited by 303
Critical effect of dependency groups on the function of networks
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1008404108 · Cited by 295
The Why, How, and When of Representations for Complex Systems
Torres, L., Blevins, A. S., Bassett, D. S., & Eliassi‐Rad, T. (2021) · SIAM Review · doi:10.1137/20m1355896 · Cited by 340
Modeling the evolution of weighted networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2004) · Physical Review E · doi:10.1103/physreve.70.066149 · Cited by 302
Complex network analysis of time series
Gao, Z., SMALL, M. P., & Kurths, J. (2016) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/116/50001 · Cited by 302
Isayev, O., Fourches, D., Muratov, E. N., Oses, C., Rasch, K., Tropsha, A., & Curtarolo, S. (2015) · Chemistry of Materials · doi:10.1021/cm503507h · Cited by 300
Gay, B., & Dousset, B. (2005) · Research Policy · doi:10.1016/j.respol.2005.07.001 · Cited by 300
Synchronization between two coupled complex networks
Li, C., Sun, W., & Kurths, J. (2007) · Physical Review E · doi:10.1103/physreve.76.046204 · Cited by 300
Characterizing the human mobility pattern in a large street network
Jiang, B., Yin, J., & Zhao, S. (2009) · Physical Review E · doi:10.1103/physreve.80.021136 · Cited by 297
Guye, M., Bettus, G., Bartoloméi, F., & Cozzone, P. J. (2010) · Magnetic Resonance Materials in Physics Biology and Medicine · doi:10.1007/s10334-010-0205-z · Cited by 314
The simultaneous evolution of author and paper networks
Börner, K., Maru, J. T., & Goldstone, R. L. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307625100 · Cited by 299
Resilience of public transport networks against attacks
Berche, B., von Ferber, C., Holovatch, T., & Holovatch, Y. V. (2009) · The European Physical Journal B · doi:10.1140/epjb/e2009-00291-3 · Cited by 299
Open access, readership, citations: a randomized controlled trial of scientific journal publishing
Davis, P. M. (2011) · The FASEB Journal · doi:10.1096/fj.11-183988 · Cited by 317
A topological pattern of urban street networks: Universality and peculiarity
Jiang, B. (2007) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2007.05.064 · Cited by 298
Berners‐Lee, T., Hall, W., Hendler, J., Shadbolt, N., & Weitzner, D. J. (2006) · Science · doi:10.1126/science.1126902 · Cited by 298
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Blitzstein, J. K., & Diaconis, P. W. (2011) · Internet Mathematics · doi:10.1080/15427951.2010.557277 · Cited by 298
Towards effective payoffs in the prisoner’s dilemma game on scale-free networks
Szolnoki, A., Perc, M., & Danku, Z. (2007) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2007.11.021 · Cited by 297
Science, Technology & Innovation Studies
Schulz-Schaeffer, I., Werle, R., & Weyer, J. (2007) · Cited by 298
Dynamics of Networks if Everyone Strives for Structural Holes
Buskens, V., & van de Rijt, A. (2008) · American Journal of Sociology · doi:10.1086/590674 · Cited by 301
Ellis, N. C. (2008) · Modern Language Journal · doi:10.1111/j.1540-4781.2008.00716.x · Cited by 315
Open challenges for data stream mining research
Krempl, G., Žliobaitė, I., Brzeziński, D., Hüllermeier, E., Last, M., Lemaire, V., Noack, T., Shaker, A., Sievi, S., Spiliopoulou, M., et al. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2674026.2674028 · Cited by 295
Shen, B., Wang, Z., & Liu, X. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2090669 · Cited by 297
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
