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 701–800 of 1,152
Identifying influential spreaders in complex networks based on gravity formula
Ma, L.-L., Ma, C., Zhang, H., & Wang, B.-H. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.12.162 · Cited by 370
Detection of topological patterns in complex networks: correlation profile of the internet
Maslov, S., Sneppen, K., & Zaliznyak, A. (2003) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2003.06.002 · Cited by 373
Disease candidate gene identification and prioritization using protein interaction networks
Chen, J., Aronow, B. J., & Jegga, A. G. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-73 · Cited by 374
Power laws and the AS-level internet topology
Siganos, G., Faloutsos, M., Faloutsos, P., & Faloutsos, C. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815300 · Cited by 368
Functional connectivity hubs in the human brain
Tomasi, D., & Volkow, N. D. (2011) · NeuroImage · doi:10.1016/j.neuroimage.2011.05.024 · Cited by 367
A complex network perspective on clinical science
Hofmann, S. G., Curtiss, J., & McNally, R. J. (2016) · Perspectives on Psychological Science · doi:10.1177/1745691616639283 · Cited by 366
D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
Mota, J. F. C., Xavier, J., Aguiar, P. M. Q., & Püschel, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2254478 · Cited by 364
Buzsáki, G. (2019) · doi:10.1093/oso/9780190905385.001.0001 · Cited by 383
Contact network epidemiology: Bond percolation applied to infectious disease prediction and control
Meyers, L. A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01148-7 · Cited by 365
Signal propagation in complex networks
Ji, P., Ye, J., Mu, Y., Lin, W. J., Tian, Y., Hens, C., Perc, M., Tang, Y. S., Sun, J., & Kurths, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.03.005 · Cited by 375
Electronic Publication and the Narrowing of Science and Scholarship
Evans, J. A. (2008) · Science · doi:10.1126/science.1150473 · Cited by 364
Network‐based Approaches in Pharmacology
Boezio, B., Audouze, K., Ducrot, P., & Taboureau, O. (2017) · Molecular Informatics · doi:10.1002/minf.201700048 · Cited by 364
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Eppstein, D., Löffler, M., & Strash, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17517-6_36 · Cited by 363
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., & Faloutsos, C. (2005) · Lecture notes in computer science · doi:10.1007/11564126_17 · Cited by 362
Social Network Analysis and Mining for Business Applications
Bonchi, F., Castillo, C., Gionis, A., & Jaimes, A. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961194 · Cited by 374
Foundations of complexity economics
Arthur, W. B. (2021) · Nature Reviews Physics · doi:10.1038/s42254-020-00273-3 · Cited by 362
Yang, X., Cao, J., & Yang, Z. (2013) · SIAM Journal on Control and Optimization · doi:10.1137/120897341 · Cited by 361
A classification for community discovery methods in complex networks
Coscia, M., Giannotti, F., & Pedreschi, D. (2011) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.10133 · Cited by 366
Coordination in Rapidly Evolving Disaster Response Systems
Comfort, L. K., Ko, K., & Zagorecki, A. T. (2004) · American Behavioral Scientist · doi:10.1177/0002764204268987 · Cited by 383
Graph topology plays a determinant role in the evolution of cooperation
Santos, F. C., Rodrigues, J. F., & Pacheco, J. M. (2005) · Proceedings of the Royal Society B Biological Sciences · doi:10.1098/rspb.2005.3272 · Cited by 361
Blinking model and synchronization in small-world networks with a time-varying coupling
Belykh, I. V., Белых, В. Н., & Hasler, M. (2004) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2004.03.013 · Cited by 359
Simple models of human brain functional networks
Vértes, P. E., Alexander‐Bloch, A. F., Gogtay, N., Giedd, J. N., Rapoport, J. L., & Bullmore, E. T. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1111738109 · Cited by 356
Why rumors spread so quickly in social networks
Doerr, B., Fouz, M., & Friedrich, T. (2012) · Communications of the ACM · doi:10.1145/2184319.2184338 · Cited by 358
Rao, F. V., & Caflisch, A. (2004) · Journal of Molecular Biology · doi:10.1016/j.jmb.2004.06.063 · Cited by 357
Community Detection and Mining in Social Media
Tang, L., & Liu, H. (2010) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00298ed1v01y201009dmk003 · Cited by 357
Using Graph Models to Analyze the Vulnerability of Electric Power Networks
Holmgren, Å. J. (2006) · Risk Analysis · doi:10.1111/j.1539-6924.2006.00791.x · Cited by 357
Topological network alignment uncovers biological function and phylogeny
Kuchaiev, O., Milenković, T., Memišević, V., Hayes, W. B., & Pržulj, N. (2010) · Journal of The Royal Society Interface · doi:10.1098/rsif.2010.0063 · Cited by 350
On compressing social networks
Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., & Raghavan, P. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557049 · Cited by 356
A first-principles approach to understanding the internet's router-level topology
Li, L., Alderson, D., Willinger, W., & Doyle, J. C. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015470 · Cited by 356
Direction-optimizing Breadth-First Search
Beamer, S., Asanović, K., & Patterson, D. A. (2012) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc.2012.50 · Cited by 356
The architecture of the climate network
Tsonis, A. A., & Roebber, P. J. (2004) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2003.10.045 · Cited by 355
Do topological models provide good information about electricity infrastructure vulnerability?
Hines, P., Cotilla‐Sanchez, E., & Blumsack, S. (2010) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3489887 · Cited by 355
Hay, M., Miklau, G., Jensen, D. D., & Srivastava, S. (2010) · Chapman & Hall/CRC data mining and knowledge discovery series · doi:10.1201/9781420091502-c15 · Cited by 353
A survey on the fusion process in opinion dynamics
Dong, Y., Zhan, M., Kou, G., Ding, Z., & Liang, H. (2017) · Information Fusion · doi:10.1016/j.inffus.2017.11.009 · Cited by 357
4chan and /b/: An Analysis of Anonymity and Ephemerality in a Large Online Community
Bernstein, M. S., Monroy‐Hernández, A., Harry, D., André, P., Panovich, K., & Vargas, G. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v5i1.14134 · Cited by 354
The trees and the forest: Characterization of complex brain networks with minimum spanning trees
Stam, C. J., Tewarie, P. K. B., van Dellen, E., van Straaten, E. C. W., Hillebrand, A., & Mieghem, P. V. (2014) · International Journal of Psychophysiology · doi:10.1016/j.ijpsycho.2014.04.001 · Cited by 358
Similarities and Differences in Genome-Wide Expression Data of Six Organisms
Bergmann, S., Ihmels, J., & Barkai, N. (2003) · PLoS Biology · doi:10.1371/journal.pbio.0020009 · Cited by 353
Epidemic Threshold in Structured Scale-Free Networks
Eguı́luz, V. M., & Klemm, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.108701 · Cited by 353
Centrality in networks of urban streets
Crucitti, P., Latora, V., & Porta, S. (2006) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.2150162 · Cited by 371
Toward a theory of network gatekeeping: A framework for exploring information control
Barzilai‐Nahon, K. (2008) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20857 · Cited by 417
Network Discovery and Verification
Beerliová-Trubíniová, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihaľák, M., & Ram, L. S. (2005) · Lecture notes in computer science · doi:10.1007/11604686_12 · Cited by 352
No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN)
Dürr, F., & Nayak, N. (2016) · International Conference on Real-Time Networks and Systems (RTNS) · doi:10.1145/2997465.2997494 · Cited by 352
Approximating Betweenness Centrality
Bader, D. A., Kintali, S., Madduri, K., & Mihail, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-77004-6_10 · Cited by 351
What Do Networks Have to Do with Climate?
Tsonis, A. A., Swanson, K. L., & Roebber, P. J. (2006) · Bulletin of the American Meteorological Society · doi:10.1175/bams-87-5-585 · Cited by 352
Rational association of genes with traits using a genome-scale gene network for Arabidopsis thaliana
Lee, I., Ambaru, B., Thakkar, P., Marcotte, E. M., & Rhee, S. Y. (2010) · Nature Biotechnology · doi:10.1038/nbt.1603 · Cited by 348
Kim, D. A., Hwong, A. R., Stafford, D., Hughes, D. A., O'Malley, A. J., Fowler, J. H., & Christakis, N. A. (2015) · The Lancet · doi:10.1016/s0140-6736(15)60095-2 · Cited by 350
Transport resilience and vulnerability: The role of connectivity
Reggiani, A., Nijkamp, P. J., & Lanzi, D. (2015) · Transportation Research Part A Policy and Practice · doi:10.1016/j.tra.2014.12.012 · Cited by 369
Baronchelli, A., Ferrer‐i‐Cancho, R., Pastor‐Satorras, R., Chater, N., & Christiansen, M. H. (2013) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2013.04.010 · Cited by 360
Network Exchange Patterns in Online Communities
Faraj, S. A., & Johnson, S. L. (2010) · Organization Science · doi:10.1287/orsc.1100.0600 · Cited by 343
Genomic analysis of the hierarchical structure of regulatory networks
Yu, H., & Gerstein, M. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0508637103 · Cited by 342
Patterned Interactions in Complex Systems: Implications for Exploration
Rivkin, J. W., & Siggelkow, N. (2007) · Management Science · doi:10.1287/mnsc.1060.0626 · Cited by 348
Curvature of co-links uncovers hidden thematic layers in the World Wide Web
Eckmann, J., & Moses, E. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.032093399 · Cited by 348
Morgan, R. J., & Soltesz, I. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0801372105 · Cited by 347
Business Intelligence in BLOGS: Understanding Consumer Interactions and Communities1
Chau, M., & Xu, J. (2012) · MIS Quarterly · doi:10.2307/41703504 · Cited by 353
Complex systems: Network thinking
Mitchell, M. (2006) · Artificial Intelligence · doi:10.1016/j.artint.2006.10.002 · Cited by 360
Why nestedness in mutualistic networks?
Burgos, E., Ceva, H., Perazzo, R. P. J., Devoto, M., Medán, D., Zimmermann, M., & Delbue, A. M. (2007) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2007.07.030 · Cited by 353
Spatially Compact Neural Clusters in the Dorsal Striatum Encode Locomotion Relevant Information
Barbera, G., Liang, B., Zhang, L., Gerfen, C. R., Culurciello, E., Chen, R., Li, Y., & Lin, D. (2016) · Neuron · doi:10.1016/j.neuron.2016.08.037 · Cited by 360
Men Set Their Own Cites High: Gender and Self-citation across Fields and over TimePreprint
King, M. M., Bergstrom, C. T., Correll, S. J., Jacquet, J., & West, J. D. (n.d.) · OSF Preprints (OSF Preprints) · Cited by 347
The minimum spanning tree: An unbiased method for brain network analysis
Tewarie, P. K. B., van Dellen, E., Hillebrand, A., & Stam, C. J. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2014.10.015 · Cited by 352
Vázquez, A., Dobrin, R., Sergi, D., Eckmann, J., Oltvai, Z. N., & Barabási, A.-Ĺ. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0406024101 · Cited by 350
Graph Evolution: Densification and Shrinking DiametersPreprint
Leskovec, J., Kleinberg, J. M., & Faloutsos, C. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0603229 · Cited by 346
Information Theory of Complex Networks: On Evolution and Architectural Constraints
Solé, R. V., & Valverde, S. (2004) · Lecture notes in physics · doi:10.1007/978-3-540-44485-5_9 · Cited by 348
Cooper, C., & FRIEZE, A. M. (2003) · Random Structures and Algorithms · doi:10.1002/rsa.10084 · Cited by 345
Effect of sampling on topology predictions of protein-protein interaction networks
Han, J. J., Dupuy, D., Bertin, N., Cusick, M. E., & Vidal, M. (2005) · Nature Biotechnology · doi:10.1038/nbt1116 · Cited by 336
Sensitivity and Nonlinearity of Thermoacoustic Oscillations
Juniper, M. P., & Sujith, R. I. (2017) · Annual Review of Fluid Mechanics · doi:10.1146/annurev-fluid-122316-045125 · Cited by 344
Newman, M. E. J. (2008) · The New Palgrave Dictionary of Economics · doi:10.1057/978-1-349-95121-5_2565-1 · Cited by 344
Networks in Archaeology: Phenomena, Abstraction, Representation
Collar, A., Coward, F., Brughmans, T., & Mills, B. J. (2015) · Journal of Archaeological Method and Theory · doi:10.1007/s10816-014-9235-6 · Cited by 183
Estimating and sampling graphs with multidimensional random walks
Ribeiro, B., & Towsley, D. (2010) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1879141.1879192 · Cited by 343
Returning to the Frontier of Contingency Theory of Organizational and Institutional Designs
de Ven, A. H. V., Ganco, M., & Hinings, C. R. (. (2013) · Academy of Management Annals · doi:10.5465/19416520.2013.774981 · Cited by 309
Xia, C., Wang, J., Perc, M., & Wang, Z. (2023) · Physics of Life Reviews · doi:10.1016/j.plrev.2023.05.002 · Cited by 354
Shibata, N., Kajikawa, Y., Takeda, Y., & Matsushima, K. (2008) · Technovation · doi:10.1016/j.technovation.2008.03.009 · Cited by 343
Universality in the Synchronization of Weighted Random Networks
Zhou, C., Motter, A. E., & Kurths, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.034101 · Cited by 338
Growing scale-free networks with small-world behavior
Klemm, K., & Eguı́luz, V. M. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.65.057102 · Cited by 342
Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
Anis, A., Gadde, A., & Ortega, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2546233 · Cited by 345
TOPOLOGICAL VULNERABILITY OF THE EUROPEAN POWER GRID UNDER ERRORS AND ATTACKS
Rosas-Casals, M., Valverde, S., & Solé, R. V. (2007) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127407018531 · Cited by 341
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 526
Measuring the effectiveness of scientific gatekeeping
Siler, K., Lee, K. P., & Bero, L. A. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1418218112 · Cited by 356
Roles of mixing patterns in cooperation on a scale-free networked game
Rong, Z., Li, X., & Wang, X. (2007) · Physical Review E · doi:10.1103/physreve.76.027101 · Cited by 334
A Small World of Neuronal Synchrony
Yu, S. P., Huang, D., Singer, W., & Nikolić, D. (2008) · Cerebral Cortex · doi:10.1093/cercor/bhn047 · Cited by 327
Statistical Mechanics of Complex Networks
Stefan Thurner, A. (2009) · Wiley eBooks · doi:10.1002/9783527627981.ch2 · Cited by 337
Formation of Regulatory Patterns During Signal Propagation in a Mammalian Cellular Network
Ma’ayan, A., Jenkins, S. L., Neves, S. R., Hasseldine, A., Grace, E. A., Dubin‐Thaler, B. J., Eungdamrong, N. J., Weng, G., Ram, P. T., Rice, J. J., et al. (2005) · Science · doi:10.1126/science.1108876 · Cited by 335
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
Skarding, J., Gabryś, B., & Musiał, K. (2021) · IEEE Access · doi:10.1109/access.2021.3082932 · Cited by 382
Scale-free networks from optimal design
Valverde, S., Ferrer‐i‐Cancho, R., & Solé, R. V. (2002) · Europhysics Letters (EPL) · doi:10.1209/epl/i2002-00248-2 · Cited by 336
Mason, W. A., Conrey, F. R., & Smith, E. R. (2007) · Personality and Social Psychology Review · doi:10.1177/1088868307301032 · Cited by 335
Fast incremental and personalized PageRank
Bahmani, B., Chowdhury, A., & Goel, A. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1929861.1929864 · Cited by 350
Liu, R., Wang, X., Aihara, K., & Chen, L. (2013) · Medicinal Research Reviews · doi:10.1002/med.21293 · Cited by 332
Network Ecology and Adolescent Social Structure
McFarland, D. A., Moody, J. W., Diehl, D. K., Smith, J. A., & Thomas, R. J. (2014) · American Sociological Review · doi:10.1177/0003122414554001 · Cited by 334
Spaide, R. F. (2016) · American Journal of Ophthalmology · doi:10.1016/j.ajo.2016.07.023 · Cited by 334
Social ties and their relevance to churn in mobile telecom networks
Dasgupta, K., Singh, R., Viswanathan, B., Chakraborty, D., Mukherjea, S., Nanavati, A. A., & Joshi, A. (2008) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1353343.1353424 · Cited by 333
Patterns in syntactic dependency networks
Ferrer i Cancho, R., Solé, R. V., & Köhler, R. (2004) · Physical Review E · doi:10.1103/physreve.69.051915 · Cited by 332
Cut-offs and finite size effects in scale-free networks
Boguñá, M., Pastor‐Satorras, R., & Vespignani, A. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00038-8 · Cited by 332
Cache “Less for More” in Information-Centric Networks
Chai, W. K., He, D., Psaras, I., & George Pavlou, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30045-5_3 · Cited by 331
Global Synchronization of Linearly Hybrid Coupled Networks with Time-Varying Delay
Yu, W., Cao, J., & Lü, J. (2008) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/070679090 · Cited by 331
Gao, H., Lam, J., & Chen, G. (2006) · Physics Letters A · doi:10.1016/j.physleta.2006.08.033 · Cited by 331
Detecting communities in large networks
Capocci, A., Servedio, V. D. P., Caldarelli, G., & Colaiori, F. (2005) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.12.050 · Cited by 331
The Landscape of Human Proteins Interacting with Viruses and Other Pathogens
Dyer, M. D., Murali, T. M., & Sobral, B. (2008) · PLoS Pathogens · doi:10.1371/journal.ppat.0040032 · Cited by 326
Measuring the value of electronic word of mouth and its impact in consumer communities
Dwyer, P. (2007) · Journal of Interactive Marketing · doi:10.1002/dir.20078 · Cited by 331
Data based identification and prediction of nonlinear and complex dynamical systems
Wang, W.-X., Lai, Y.-C., & Grebogi, C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.004 · Cited by 328
Camacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., González-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 359
Inter-similarity between coupled networks
Rozenblat, C., Ietri, D., Ducruet, C., & Havlin, S. (2015) · Cited by 331
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
