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 201–300 of 1,152
The ERBB network: at last, cancer therapy meets systems biology
Yarden, Y., & Pines, G. (2012) · Nature reviews. Cancer · doi:10.1038/nrc3309 · Cited by 1,031
Bäckström, L., & Leskovec, J. (2011) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1935826.1935914 · Cited by 989
The Structure of a Social Science Collaboration Network: Disciplinary Cohesion from 1963 to 1999
Moody, J. (2004) · American Sociological Review · doi:10.1177/000312240406900204 · Cited by 738
The log-dynamic brain: how skewed distributions affect network operations
Buzsáki, G., & Mizuseki, K. (2014) · Nature reviews. Neuroscience · doi:10.1038/nrn3687 · Cited by 1,019
The small world inside large metabolic networks
Wagner, A., & Fell, D. A. (2001) · Proceedings of the Royal Society B Biological Sciences · doi:10.1098/rspb.2001.1711 · Cited by 986
A time-varying complex dynamical network model and its controlled synchronization criteria
Lü, J., & Chen, G. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.849233 · Cited by 975
Getoor, L. C., & Diehl, C. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 986
The complex network of global cargo ship movements
Kaluza, P., Kölzsch, A., Gastner, M. T., & Blasius, B. (2010) · Journal of The Royal Society Interface · doi:10.1098/rsif.2009.0495 · Cited by 992
Data Mining: Concepts and Techniques (2nd edition)
Han, J., & Kamber, M. (2006) · Cited by 968
Statistical physics of vaccination
Wang, Z., Bauch, C. T., Bhattacharyya, S., d’Onofrio, A., Manfredi, P., Perc, M., Perra, N., Salathé, M., & Zhao, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.006 · Cited by 973
Pinning a Complex Dynamical Network to Its Equilibrium
Li, X., Wang, X., & Chen, G. (2004) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2004.835655 · Cited by 960
Broido, A. D., & Clauset, A. J. (2019) · CU Scholar (University of Colorado Boulder) · Cited by 957
Analysis of topological characteristics of huge online social networking services
Ahn, Y., Han, S., Kwak, H., Moon, S. B., & Jeong, H. (2007) · International World Wide Web Conference (WWW) · doi:10.1145/1242572.1242685 · Cited by 955
A unified synchronization criterion for impulsive dynamical networks
Lu, J., Ho, D. W. C., & Cao, J. (2010) · Automatica · doi:10.1016/j.automatica.2010.04.005 · Cited by 954
Dynamics of rumor spreading in complex networks
Moreno, Y., Nekovee, M., & Pacheco, A. F. (2004) · Physical Review E · doi:10.1103/physreve.69.066130 · Cited by 949
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lü, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 946
Dynamics of Dyads in Social Networks: Assortative, Relational, and Proximity Mechanisms
Rivera, M. T., Soderstrom, S. B., & Uzzi, B. (2010) · Annual Review of Sociology · doi:10.1146/annurev.soc.34.040507.134743 · Cited by 978
Scale-free topology of e-mail networks
Ebel, H., Mielsch, L.-I., & Bornholdt, S. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.66.035103 · Cited by 945
Network thinking in ecology and evolution
Proulx, S. R., Promislow, D., & PHILLIPS, P. (2005) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2005.04.004 · Cited by 956
Information diffusion through blogspace
Gruhl, D., Liben‐Nowell, D., Guha, R., & Tomkins, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1046456.1046462 · Cited by 941
The Wealth of Networks: How Social Production Transforms Markets and Freedom
Strahilevitz, L., & Benkler, Y. R. (2007) · The Yale Law Journal · doi:10.2307/20455766 · Cited by 932
A random graph model for massive graphs
Aiello, W. A., Chung, F., & Lü, L. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335326 · Cited by 935
Multirelational organization of large-scale social networks in an online world
Szell, M., Lambiotte, R., & Stefan Thurner, A. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1004008107 · Cited by 926
The Sorcerer II Global Ocean Sampling Expedition: Expanding the Universe of Protein Families
Yooseph, S., Sutton, G., Rusch, D. B., Halpern, A. L., Williamson, S. J., Remington, K., Eisen, J. A., Heidelberg, K. B., Manning, G., Li, W., et al. (2007) · PLoS Biology · doi:10.1371/journal.pbio.0050016 · Cited by 925
Effects of missing data in social networks
Kossinets, G. (2006) · Social Networks · doi:10.1016/j.socnet.2005.07.002 · Cited by 926
Leicht, E. A., Holme, P., & Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.73.026120 · Cited by 918
Sumpter, D. J. T. (2010) · doi:10.1515/9781400837106 · Cited by 914
Graph theoretical analysis of magnetoencephalographic functional connectivity in Alzheimer's disease
Stam, C. J., de Haan, W., Daffertshofer, A., Jones, B. F., Manshanden, I., van Walsum, A. M. V. C., Montez, T., Verbunt, J. P. A., de Munck, J. C., van Dijk, B. W., et al. (2008) · Brain · doi:10.1093/brain/awn262 · Cited by 922
A tool for filtering information in complex systems
Tumminello, M., Aste, T., Matteo, T. D., & Mantegna, R. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500298102 · Cited by 903
Epidemic Dynamics on an Adaptive Network
Groß, T., D’Lima, C. J. D., & Blasius, B. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.208701 · Cited by 900
Extracting the multiscale backbone of complex weighted networks
Serrano, M. Á., Boguñá, M., & Vespignani, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808904106 · Cited by 910
Structure and dynamics of molecular networks: A novel paradigm of drug discovery
Csermely, P., Korcsmáros, T., Kiss, H., London, G., & Nussinov, R. (2013) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2013.01.016 · Cited by 911
Modularity from fluctuations in random graphs and complex networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2004) · Physical Review E · doi:10.1103/physreve.70.025101 · Cited by 894
The average distances in random graphs with given expected degrees
Chung, F., & Lü, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 891
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367591 · Cited by 872
Leskovec, J., & Sosič, R. (2016) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2898361 · Cited by 885
An Experimental Study of Search in Global Social Networks
Dodds, P. S., Muhamad, R., & Watts, D. J. (2003) · Science · doi:10.1126/science.1081058 · Cited by 883
Random Graphs and Complex Networks
van der Hofstad, R. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 880
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.63.066123 · Cited by 868
Quantifying Long-Term Scientific Impact
Wang, D., Song, C., & Barabási, A.-L. (2013) · Science · doi:10.1126/science.1237825 · Cited by 753
Epidemic spreading in real networks: an eigenvalue viewpoint
Wang, Y., Chakrabarti, D., Wang, C., & Faloutsos, C. (2004) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.2003.1238052 · Cited by 876
Broido, A. D., & Clauset, A. (2019) · Nature Communications · doi:10.1038/s41467-019-08746-5 · Cited by 875
Social Influence Bias: A Randomized Experiment
Muchnik, L., Aral, S., & Taylor, S. J. (2013) · Science · doi:10.1126/science.1240466 · Cited by 892
Structural Properties of the Caenorhabditis elegans Neuronal Network
Varshney, L. R., Chen, B. L., Paniagua, E., Hall, D. H., & Chklovskii, D. B. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001066 · Cited by 867
Invariant properties in coevolutionary networks of plant–animal interactions
Jordano, P., Bascompte, J., & Olesen, J. M. (2002) · Ecology Letters · doi:10.1046/j.1461-0248.2003.00403.x · Cited by 867
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 843
Adaptive coevolutionary networks: a review
Gross, T., & Blasius, B. (2007) · Journal of The Royal Society Interface · doi:10.1098/rsif.2007.1229 · Cited by 843
Network models and financial stability
Nier, E., Yang, J., Yorulmazer, T., & Alentorn, A. (2007) · Journal of Economic Dynamics and Control · doi:10.1016/j.jedc.2007.01.014 · Cited by 858
A Weighted and Directed Interareal Connectivity Matrix for Macaque Cerebral Cortex
Markov, N. T., Ercsey-Ravasz, M. M., Ribeiro Gomes, A. R., Lamy, C., Magrou, L., Vezoli, J., Misery, P., Falchier, A., Quilodran, R., Gariel, M. A., et al. (2014) · Cerebral Cortex · doi:10.1093/cercor/bhs270 · Cited by 857
Disentangling Interactions in the Microbiome: A Network Perspective
Layeghifard, M., Hwang, D. M., & Guttman, D. S. (2016) · Trends in Microbiology · doi:10.1016/j.tim.2016.11.008 · Cited by 863
Kronecker Graphs: An Approach to Modeling NetworksPreprint
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., & Ghahramani, Z. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4905 · Cited by 840
Showing your ID: intrinsic disorder as an ID for recognition, regulation and cell signaling
Uversky, V. N., Oldfield, C. J., & Dunker, A. K. (2005) · Journal of Molecular Recognition · doi:10.1002/jmr.747 · Cited by 847
Heterogeneity in Oscillator Networks: Are Smaller Worlds Easier to Synchronize?
Nishikawa, T., Motter, A. E., Lai, Y., & Hoppensteadt, F. C. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.014101 · Cited by 846
Social network analysis of animal behaviour: a promising tool for the study of sociality
Wey, T. W., Blumstein, D. T., Shen, W., & Jordán, F. (2008) · Animal Behaviour · doi:10.1016/j.anbehav.2007.06.020 · Cited by 881
The emergent properties of a dolphin social network
Lusseau, D. (2003) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rsbl.2003.0057 · Cited by 844
Biological network comparison using graphlet degree distribution
Pržulj, N. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl301 · Cited by 820
Geographic routing in social networks
Liben‐Nowell, D., Novak, J., Kumar, R., Raghavan, P., & Tomkins, A. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0503018102 · Cited by 843
The Network of Global Corporate Control
Vitali, S., Glattfelder, J. B., & Battiston, S. (2011) · PLoS ONE · doi:10.1371/journal.pone.0025995 · Cited by 827
The Anatomy of the Facebook Social Graph
Ugander, J., Karrer, B., Backstrom, L., & Marlow, C. (2011) · arXiv · doi:10.48550/arxiv.1111.4503 · Cited by 819
The Architecture of Complexity
Barabási, A.-Ĺ. (2007) · IEEE Control Systems · doi:10.1109/mcs.2007.384127 · Cited by 826
Scale-Free Networks Are Ultrasmall
Reuven Cohen, C., & Havlin, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.058701 · Cited by 818
Chains of affection: the structure of adolescent romantic and sexual networks
Bearman, P. S., Moody, J., & Stovel, K. (2004) · American Journal of Sociology · doi:10.1086/386272 · Cited by 817
The Power Grid as a complex network: A survey
Pagani, G. A., & Aiello, M. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.01.023 · Cited by 816
Dissecting the Social: On the Principles of Analytical Sociology
Hedstrom, P. (2005) · doi:10.1017/cbo9780511488801 · Cited by 816
Durrett, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546594 · Cited by 848
The degree sequence of a scale‐free random graph process
Bollobás, B., Riordan, O. M., Spencer, J., & Tusnády, G. (2001) · Random Structures and Algorithms · doi:10.1002/rsa.1009 · Cited by 811
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas-Boas, P. R., Antiqueira, L., Viana, M. P., & Rocha, L. E. C. (2011) · Advances In Physics · doi:10.1080/00018732.2011.572452 · Cited by 839
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders
Simonovsky, M., & Komodakis, N. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01418-6_41 · Cited by 885
Betweenness centrality in large complex networks
Barthélemy, M. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00111-4 · Cited by 804
The efficiency of multi-target drugs: the network approach might help drug design
CSERMELY, P., AGOSTON, V, & PONGOR, S. (2005) · Trends in Pharmacological Sciences · doi:10.1016/j.tips.2005.02.007 · Cited by 803
Complexity and fragility in ecological networks
Solé, R. V., & Montoya, J. M. (2001) · Proceedings of the Royal Society B Biological Sciences · doi:10.1098/rspb.2001.1767 · Cited by 794
Epidemic thresholds in real networks
Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., & Faloutsos, C. (2008) · ACM Transactions on Information and System Security · doi:10.1145/1284680.1284681 · Cited by 799
Expertise networks in online communities
Zhang, J., Ackerman, M. S., & Adamic, L. A. (2007) · International World Wide Web Conference (WWW) · doi:10.1145/1242572.1242603 · Cited by 797
Converging Technologies for Improving Human Performance
Roco, M. C., & Bainbridge, W. S. (2003) · Springer eBooks · doi:10.1007/978-94-017-0359-8 · Cited by 809
Using graph theory to analyze biological networks
Pavlopoulos, G. A., Secrier, M., Moschopoulos, C. N., Soldatos, T. G., Κοσσίδα, Σ., Aerts, J. A., Schneider, R., & Bagos, P. G. (2011) · BioData Mining · doi:10.1186/1756-0381-4-10 · Cited by 821
Ripeanu, M., Foster, I. T., & Iamnitchi, A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0209028 · Cited by 794
Lim, J., Hao, T., Shaw, C., Patel, A. J., Szabó, G., Rual, J.-F., Fisk, C. J., Li, N., Smolyar, A., Hill, D. E., et al. (2006) · Cell · doi:10.1016/j.cell.2006.03.032 · Cited by 789
Horizontal visibility graphs: Exact results for random time series
Luque, B., Lacasa, L., Ballesteros, F., & Luque, J. (2009) · Physical Review E · doi:10.1103/physreve.80.046103 · Cited by 789
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.048701 · Cited by 788
An Analysis of Anonymity in the Bitcoin System
Reid, F., & Harrigan, M. (2012) · Springer eBooks · doi:10.1007/978-1-4614-4139-7_10 · Cited by 786
Towards identity anonymization on graphs
Liu, K., & Terzi, E. (2008) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1376616.1376629 · Cited by 785
SPECTRAL CLUSTERING AND THE HIGH-DIMENSIONAL STOCHASTIC BLOCKMODEL
Rohe, K., Chatterjee, S., & Yu, B. (2010) · Cited by 782
Supply network disruption and resilience: A network structural perspective
Kim, Y., Chen, Y., & Linderman, K. (2014) · Journal of Operations Management · doi:10.1016/j.jom.2014.10.006 · Cited by 817
Data Mining and Analysis: Fundamental Concepts and Algorithms
Zaki, M. J., & Meira, W. (2014) · Cited by 780
Evolutionary games on multilayer networks: a colloquium
Wang, Z., Wang, L., Szolnoki, A., & Perc, M. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60270-7 · Cited by 811
Social diversity and promotion of cooperation in the spatial prisoner’s dilemma game
Perc, M., & Szolnoki, A. (2008) · Physical Review E · doi:10.1103/physreve.77.011904 · Cited by 773
Cascade Control and Defense in Complex Networks
Motter, A. E. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.098701 · Cited by 776
Complex Network from Pseudoperiodic Time Series: Topology versus Dynamics
Zhang, J., & SMALL, M. P. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.238701 · Cited by 776
Cell Fates as High-Dimensional Attractor States of a Complex Gene Regulatory Network
Huang, S., Eichler, G., Bar-Yam, Y., & Ingber, D. E. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.128701 · Cited by 775
Intermittent search strategies
Bénichou, O., Loverdo, C., Moreau, M., & Voituriez, R. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.81 · Cited by 754
(2005) · Cited by 772
Coexpression Analysis of Human Genes Across Many Microarray Data Sets
Lee, H. K., Hsu, A. K., Sajdak, J., Qin, J., & Pavlidis, P. (2004) · Genome Research · doi:10.1101/gr.1910904 · Cited by 770
Matei, R., Iamnitchi, A., & Foster, P. (2002) · IEEE Internet Computing · doi:10.1109/4236.978369 · Cited by 767
Roulette-wheel selection via stochastic acceptance
Lipowski, A., & Lipowska, D. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.12.004 · Cited by 766
A new method for constructing networks from binary data
van Borkulo, C. D., Borsboom, D., Epskamp, S., Blanken, T. F., Boschloo, L., Schoevers, R. A., & Waldorp, L. (2014) · Scientific Reports · doi:10.1038/srep05918 · Cited by 813
Structure and evolution of transcriptional regulatory networks
Babu, M. M., Luscombe, N. M., Aravind, L., Gerstein, M., & Teichmann, S. A. (2004) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2004.05.004 · Cited by 780
A model of Internet topology using k -shell decomposition
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., & Shir, E. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701175104 · Cited by 763
Infection dynamics on scale-free networks
May, R. M., & Lloyd, A. L. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.066112 · Cited by 762
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
