The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
The Structure and Function of Complex Networks
Open accessAbstract
Abstract. Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
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
“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 Newman, 2003
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 Newman, 2003
Experimental — accuracy not yet measuredThe 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 [54]
The cited source says what the claim attributes to it.
In the citing paper
“Other risks from rewiring include 'phase transitions', where a gradual change in individual connections or network structure triggers a sudden and dramatic shift in the behaviour of the entire network (Newman, 2003, see also Section 3.4).”
From Multi-Agent Risks from Advanced AI (2025) · cites this paper as Newman, 2003
The cited source says what the claim attributes to it.
In the citing paper
“SNA makes it possible to understand and highlight interactions and knowledge flows between actors (Chaudhury et al. 2017;Isaac 2012;Newman 2003).”
From Scenarios for an agroecological transition of smallholder family farmers: a case study in Guadeloupe (2022) · cites this paper as Newman 2003
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The 90–9–1 rule classifies user participation into three categories; specifically, Lurkers, Contributors, and Superusers, where 90% of actors do not participate, 9% seldom contribute, and 1% contribute significantly to the content (15, 17, 18, 22, 23).”
From Trouble with the curve: the 90-9-1 rule to measure volitional participation inequalities among Royal Canadian Mounted Police cadets during training (2024) · cites this paper as [22]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The relationships between participant motivation, use, engagement, and actor status have identified participation inequalities mirroring the 80–20 Pareto principle and participation patterns such as the 90–9–1 rule (18, 21, 22).”
From Trouble with the curve: the 90-9-1 rule to measure volitional participation inequalities among Royal Canadian Mounted Police cadets during training (2024) · cites this paper as [22]
Experimental — accuracy not yet measuredIn the citing paper
“Node degree is central to network topology and a major factor in numerous other properties (Gillis and Pavlidis, 2011b;Newman, 2003).”
From Guidance for RNA-seq co-expression network construction and analysis: safety in numbers (2015) · cites this paper as Newman, 2003
In the citing paper
“In many (but not all) complex networks the degree distribution is also a power law with γ close to 28910.”
From Network Cosmology (2012) · cites this paper as [9]
In the citing paper
“Strong clustering is another structural property often observed in complex networks: average clustering in random graphs of similar size and average degree is lower by orders of magnitude8910.”
From Network Cosmology (2012) · cites this paper as [9]
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
The Matthew Effect in Science: The reward and communication systems of science are considered.
Merton, R. K. (1968) · Science · doi:10.1126/science.159.3810.56 · Cited by 6,720
The structure of the nervous system of the nematode Caenorhabditis elegans
White, J. G., Southgate, E., Thomson, J. N., & Brenner, S. (1986) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1986.0056 · Cited by 5,589
A General Model for the Origin of Allometric Scaling Laws in Biology
West, G. B., Brown, J. H., & Enquist, B. J. (1997) · Science · doi:10.1126/science.276.5309.122 · Cited by 5,016
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
The Geometry of Biological Time
Winfree, A. T. (1980) · doi:10.1007/978-3-662-22492-2 · Cited by 3,613
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
A principle of natural self-organization: Part A: Emergence of the hypercycle
Eigen, M., & Schuster, P. (1977) · Naturwissenschaften · doi:10.1007/bf00450633 · Cited by 1,752
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Metabolic network structure determines key aspects of functionality and regulation
Stelling, J., Klamt, S., Bettenbrock, K., Schuster, S., & Gilles, E. D. (2002) · Nature · doi:10.1038/nature01166 · Cited by 802
The effects of local spatial structure on epidemiological invasions
Keeling, M. J. (1999) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.1999.0716 · Cited by 798
Social Structure from Multiple Networks. II. Role Structures
Boorman, S. A., & White, H. C. (1976) · American Journal of Sociology · doi:10.1086/226228 · Cited by 788
How Viruses Spread Among Computers and People
Lloyd, A. L., & May, R. M. (2001) · Science · doi:10.1126/science.1061076 · Cited by 661
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 · cited 2×
“Dorogovtsev, Mendes, and Samukhin [126] have also shown that (3.”
Topology of technology graphs: Small world patterns in electronic circuits
Cancho, R. F. I., Janssen, C., & Solé, R. V. (2001) · Physical Review E · doi:10.1103/physreve.64.046119 · Cited by 265
Gafiychuk, V. V., Lubashevsky, I., & Stosyk, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.nlin/0004033 · Cited by 3
From Neel to NPC: Colouring Small WorldsPreprint
Svenson, P. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0107015 · Cited by 2
Research works printed but not linked: 404
- 10.1103/PhysRevE.63.030901 · DOI
- 10.1007/3-540-48155-9_27 · DOI
- Adamic L. A., Social Networks
- 10.1126/science.287.5461.2115a · DOI
- Adamic L. A., 2003, Handbook of Graphs and Networks
- 10.1103/PhysRevE.64.046135 · DOI
- Ahuja R. K., 1993, Network Flows: Theory, Algorithms, and Applications
- W. Aiello, F. Chung, and L. Lu, A random graph model for massive graphs, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Association of Computing Machinery, New York, 2000, pp. 171–180. · DOI
- 10.1007/978-1-4615-0005-6_4 · DOI
- R. Alberich, J. Miro-Julia, and F. Rossello, Marvel Universe Looks Almost Like a Real Social Network, Preprint 0202174 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1103/PhysRevLett.84.5660 · DOI
- 10.1103/PhysRevLett.85.5234 · DOI
- 10.1103/RevModPhys.74.47 · DOI · Paper page
- 10.1038/43601 · DOI
- M. Aldana, Dynamics of Boolean Networks with Scale-Free Topology, Preprint 0209571 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1002/1098-2418(200009)17:2<79::AID-RSA1>3.0.CO;2-W · DOI
- 10.1016/S0378-4371(02)00740-9 · DOI
- 10.1103/PhysRevLett.88.098101 · DOI
- 10.1073/pnas.200327197 · DOI · Paper page
- 10.3201/eid0902.020188 · DOI
- 10.1016/S0378-8733(98)00012-4 · DOI
- 10.1093/oso/9780198545996.001.0001 · DOI · Paper page
- Andersson H., 1999, Math. Sci., 24, 128
- A. Arenas, A. Cabrales, A. Díaz-Guilera, R. Guimerà, and F. Vega-Redondo, Search and congestion in complex networks, in Proceedings of the 18th Sitges Conference on Statistical Mechanics, R. Pastor-Satorras and J. Rubi, eds. Lecture Notes in Phys., Springer-Verlag, Berlin, 2003. · DOI
- Bailey N. T. J., 1975, The Mathematical Theory of Infectious Diseases and Its Applications
- 10.2307/1943071 · DOI
- 10.1214/aoap/1034625252 · DOI
- 10.1038/20144 · DOI
- 10.1080/0022250X.1996.9990179 · DOI
- Barabási A.-L., 2002, Linked: The New Science of Networks
- 10.1016/S0378-4371(99)00291-5 · DOI
- 10.1016/S0378-4371(00)00018-2 · DOI
- 10.1126/science.287.5461.2115a · DOI
- 10.1016/S0378-4371(02)00736-7 · DOI · Paper page
- 10.1103/PhysRevLett.89.054101 · DOI
- 10.1002/rsa.1018 · DOI
- A. Barrat, Comment on “Small-World Networks: Evidence for Crossover Picture”, Preprint 9903323 (1999); available from http://arxiv.org/abs/cond-mat/.
- 10.1007/s100510050067 · DOI
- 10.1103/PhysRevLett.82.3180 · DOI
- 10.1103/PhysRevLett.82.3180 · DOI
- 10.1016/S0378-8733(00)00023-X · DOI
- M. Bauer and D. Bernard, A Simple Asymmetric Evolving Random Network, Preprint 0203232 (2002); available from http://arxiv.org/abs/cond-mat/.
- P. S. Bearman, J. Moody, and K. Stovel, Chains of Affection: The Structure of Adolescent Romantic and Sexual Networks, preprint, Department of Sociology, Columbia University, New York, 2002.
- Bekessy A., 1972, Stud. Sci. Math. Hungar., 7, 343
- 10.1016/0097-3165(78)90059-6 · DOI
- 10.1103/PhysRevLett.89.228701 · DOI
- J. Berg, M. Lässig, and A. Wagner, Evolution Dynamics of Protein Networks, Preprint 0207711 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.2307/3773626 · DOI
- G. Bianconi, Mean Field Solution of the Ising Model on a Barabási–Albert Network, Preprint 0204455 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1103/PhysRevLett.86.5632 · DOI · Paper page
- 10.1209/epl/i2001-00260-6 · DOI · Paper page
- 10.1103/PhysRevLett.90.078701 · DOI
- 10.1103/PhysRevE.64.036106 · DOI
- P. Blanchard, C.H. Chang, and T. Krüger, Epidemic Thresholds on Scale-Free Graphs: The Interplay between Exponent and Preferential Choice, Preprint 0207319 (2002); available from http://arxiv.org/abs/cond-mat/. · DOI
- 10.1103/PhysRevE.66.047104 · DOI
- M. Boguñá, R. Pastor-Satorras, and A. Vespignani, Absence of Epidemic Threshold in Scale-Free Networks with Connectivity Correlations, Preprint 0208163 (2002); available from http://arxiv.org/abs/cond-mat/. · DOI
- M. Boguñá, R. Pastor-Satorras, and A. Vespignani, Epidemic spreading in complex networks with degree correlations, in Proceedings of the 18th Sitges Conference on Statistical Mechanics, R. Pastor-Satorras and J. Rubi, eds. Lecture Notes in Phys., Springer-Verlag, Berlin, 2003. · DOI
- 10.1016/S0195-6698(80)80030-8 · DOI
- 10.1090/S0002-9947-1981-0621971-7 · DOI
- 10.1007/978-1-4612-0619-4 · DOI
- B. Bollobás and O. Riordan, The Diameter of a Scale-Free Random Graph, preprint, Department of Mathematical Sciences, University of Memphis, 2002. · DOI
- 10.1002/rsa.1009 · DOI
- 10.2307/270732 · DOI
- 10.1086/228631 · DOI
- Bordens M., 2000, The Web of Knowledge: A Festschrift in Honor of Eugene Garfield
- 10.1103/PhysRevE.64.035104 · DOI
- Bornholdt S., 2003, Handbook of Graphs and Networks
- 10.1016/0022-2496(75)90028-0 · DOI
- 10.1017/S0305004100032680 · DOI
- 10.1016/S1389-1286(00)00083-9 · DOI · Paper page
- 10.1117/12.434393 · DOI
- 10.1103/PhysRevE.64.046118 · DOI
- 10.1103/PhysRevLett.89.258702 · DOI · Paper page
- G. Caldarelli, R. Pastor-Satorras, and A. Vespignani, Cycles Structure and Local Ordering in Complex Networks, Preprint 0212026 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1103/PhysRevE.64.041902 · DOI
- 10.1103/PhysRevLett.85.5468 · DOI
- 10.1103/PhysRevLett.88.228102 · DOI
- A. Capocci, G. Caldarelli, and P. De Los Rios, Quantitative Description and Modeling of Real Networks, Preprint 0206336 (2002); available from http://arxiv.org/abs/cond-mat/. · DOI
- C. Castellano, D. Vilone, and A. Vespignani, Incomplete Ordering of the Voter Model on Small-World Networks, Preprint 0210465 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.2105/AJPH.82.2.284 · DOI
- Q. Chen, H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger, The origin of power laws in Internet topologies revisited, in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society, Los Alamitos, CA, 2002.
- 10.1073/pnas.252631999 · DOI
- 10.1007/PL00012580 · DOI
- Chung F., J. Comput. Biology
- 10.1007/978-3-642-83784-5 · DOI
- R. Cohen, D. ben-Avraham, and S. Havlin, Efficient Immunization of Populations and Computers, Preprint 0207387 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1103/PhysRevLett.85.4626 · DOI
- 10.1103/PhysRevLett.86.3682 · DOI
- 10.1103/PhysRevLett.90.058701 · DOI
- 10.1038/17501 · DOI
- 10.1016/S0167-2789(00)00198-6 · DOI
- 10.1016/S0167-2789(01)00286-X · DOI
- Corman S. R., 2002, Human Communication Res., 28, 157
- S. Coulumb and M. Bauer, Asymmetric Evolving Random Networks, Preprint 0212371 (2002); available from http://arxiv.org/abs/cond-mat/.
- Crane D., 1972, Invisible Colleges: Diffusion of Knowledge in Scientific Communities
- 10.1103/PhysRevLett.88.128701 · DOI
- Davis A., 1941, Deep South
- 10.1086/231170 · DOI · Paper page
- G. F. Davis, M. Yoo, and W. E. Baker, The Small World of the Corporate Elite, preprint, University of Michigan Business School, Ann Arbor, MI, 2001.
- 10.1016/S0378-4371(02)00549-6 · DOI
- 10.1007/BF03025416 · DOI
- 10.1080/01621459.1974.10480137 · DOI · Paper page
- 10.1209/epl/i2000-00308-1 · DOI
- P. S. Dodds, R. Muhamad, and D. J. Watts, An Experiment Study of Social Search and the Small World Problem, preprint, Department of Sociology, Columbia University, New York, 2002.
- Dodds P. S., 2001, Phys. Rev. E, 63
- 10.1103/PhysRevE.66.016104 · DOI
- 10.1103/PhysRevE.65.066122 · DOI · Paper page
- 10.1103/PhysRevE.62.1842 · DOI
- 10.1209/epl/i2000-00227-1 · DOI
- 10.1209/epl/i2000-00400-0 · DOI
- 10.1103/PhysRevLett.87.219801 · DOI
- 10.1103/PhysRevE.63.025101 · DOI
- 10.1098/rspb.2001.1824 · DOI
- 10.1080/00018730110112519 · DOI
- Dorogovtsev S. N., 2003, Handbook of Graphs and Networks, 318
- 10.1103/PhysRevLett.85.4633 · DOI
- 10.1103/PhysRevE.64.066110 · DOI
- 10.1103/PhysRevE.64.025101 · DOI
- S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Metric Structure of Random Networks, Preprint 0210085 (2002); available from http://arxiv.org/abs/cond-mat/.
- S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Principles of Statistical Mechanics of Random Networks, Preprint 0204111 (2002); available from http://arxiv.org/abs/cond-mat/.
- S. N. Dorogovtsev and A. N. Samukhin, Mesoscopics and Fluctuations in Networks, Preprint 0211518 (2002); available from http://arxiv.org/abs/cond-mat/. · DOI
- 10.1103/PhysRevLett.88.238701 · DOI
- 10.1090/dimacs/035 · DOI
- 10.1073/pnas.192407699 · DOI
- 10.1046/j.1461-0248.2002.00354.x · DOI
- Durrett R. T., 2003, Rigorous Results for the Callaway–Hopcroft–Kleinberg–Newman–Strogatz Model
- 10.1103/PhysRevE.66.056118 · DOI
- 10.1103/PhysRevE.66.035103 · DOI
- 10.1073/pnas.032093399 · DOI
- Egghe L., 1990, Introduction to Informetrics
- 10.1103/PhysRevLett.89.108701 · DOI
- 10.1007/978-3-642-67247-7 · DOI · Paper page
- 10.5486/PMD.1959.6.3-4.12 · DOI · Paper page
- Erdős P., 1960, Magyar Tud. Akad. Mat. Kutató Int. Közl., 5, 17
- 10.1007/BF02066689 · DOI
- 10.1016/S0378-4371(02)00628-3 · DOI
- 10.1016/S0378-4371(01)00408-3 · DOI
- K. A. Eriksen, I. Simonsen, S. Maslov, and K. Sneppen, Modularity and Extreme Edges of the Internet, Preprint 0212001 (2002); available from http://arxiv.org/abs/cond-mat/. · DOI
- Everitt B., 1974, Cluster Analysis
- 10.1145/316194.316229 · DOI
- Fararo T. J., 1964, A Study of a Biased Friendship Network
- 10.1103/PhysRevE.64.026704 · DOI
- 10.1016/S0378-4371(02)01181-0 · DOI
- 10.1016/S0378-4371(02)01731-4 · DOI
- 10.1038/81025 · DOI
- 10.1097/00007435-200011000-00008 · DOI
- R. Ferrer i Cancho and R. V. Solé, Optimization in Complex Networks, Preprint 0111222 (2001); available from http://arxiv.org/abs/cond-mat/.
- 10.1098/rspb.2001.1800 · DOI
- 10.1109/2.989932 · DOI
- 10.1063/1.1414882 · DOI
- 10.1080/01621459.1986.10478342 · DOI
- 10.2307/3033543 · DOI
- Freeman L. C., 1996, Connections, 19, 39
- 10.1037/h0046123 · DOI
- A. Fronczak, P. Fronczak, and J. A. Holyst, Exact Solution for Average Path Length in Random Graphs, Preprint 0212230 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1016/S0378-4371(02)01336-5 · DOI
- Galaskiewicz J., 1985, Social Organization of an Urban Grants Economy
- 10.1016/0049-089X(78)90006-6 · DOI
- Garfield E., 1979, Current Contents, 43, 5
- 10.1007/s001480100100 · DOI
- 10.1073/pnas.122653799 · DOI · Paper page
- 10.1142/S0219525901000140 · DOI
- 10.1103/PhysRevE.64.051903 · DOI
- 10.1073/pnas.202301299 · DOI
- 10.1145/138859.138867 · DOI
- 10.2307/1940492 · DOI
- 10.1103/PhysRevE.67.026123 · DOI
- 10.1016/0025-5564(82)90036-0 · DOI
- 10.1016/S0010-4655(02)00205-9 · DOI
- 10.1080/15326348608807041 · DOI
- Grossman J. W., 1995, Congr. Numer., 108, 129
- Guare J., 1990, Six Degrees of Separation: A Play
- 10.1038/ng873 · DOI
- R. Guimerà, L. Danon, A. Díaz-Guilera, F. Giralt, and A. Arenas, Self-Similar Community Structure in Organisations, Preprint 0211498 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1097/00002030-198912000-00005 · DOI
- 10.1017/S0305004100032692 · DOI
- F. Harary, Graph Theory, Perseus, Cambridge, MA, 1995.
- 10.1511/2000.1.9 · DOI
- 10.1511/2000.2.104 · DOI
- 10.1103/PhysRevE.65.066110 · DOI
- 10.1137/S0036144500371907 · DOI
- Higham D. J., 2002, Greedy Pathlengths and Small World Graphs
- 10.1080/01621459.1981.10477598 · DOI
- 10.1103/PhysRevE.66.036119 · DOI
- P. Holme, C. R. Edling, and F. Liljeros, Structure and Time-Evolution of the Internet Community pussokram.com, Preprint 0210514 (2002); available from http://arxiv.org/abs/cond-mat/.
- P. Holme, M. Huss, and H. Jeong, Subnetwork Hierarchies of Biochemical Pathways, Preprint 0206292 (2002); available from http://arxiv.org/abs/cond-mat/.
- 10.1103/PhysRevE.65.026107 · DOI
- 10.1103/PhysRevE.65.066109 · DOI
- 10.1103/PhysRevE.65.056109 · DOI
- 10.1103/PhysRevE.65.026139 · DOI
- 10.1103/PhysRevE.66.018101 · DOI
- 10.7551/mitpress/4150.001.0001 · DOI
- 10.2307/3546201 · DOI
- A. Iamnitchi, M. Ripeanu, and I. Foster, Locating data in (small-world?) peer-to-peer scientific collaborations, in Proceedings of the First International Workshop on Peer-to-Peer Systems, P. Druschel, F. Kaashoek, and A. Rowstron, eds. Lecture Notes in Comput. Sci. 2429, Springer-Verlag, Berlin, 2002, pp. 232–241. · DOI
- 10.1073/pnas.061034498 · DOI · Paper page
- 10.7551/mitpress/5263.001.0001 · DOI
- 10.1145/331499.331504 · DOI
- 10.1103/PhysRevLett.81.5684 · DOI
- 10.1073/pnas.98.2.543 · DOI
- Janson S., 1999, Random Graphs
200 of 404 shown
Cited by
Sorted by citations
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Self-citationModularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Self-citationFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Metadata
- Authors
- Newman, M. E. J.
- Affiliations
- Santa Fe Institute (US)
- Corresponding author
- Newman, M. E. J.
- ORCID
- Newman, M. E. J.
- Venue
- SIAM Review
- Published
- 2003-01-01
- Volume
- 45
- Issue
- 2
- Pages
- 167-256
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2148606196
- Cited by
- 18,719
- References
- 20
- Citations by year
- 2026: 493 · 2025: 574 · 2024: 588 · 2023: 573 · 2022: 723 · 2021: 789 · 2020: 813 · 2019: 925 · 2018: 958 · 2017: 1004 · 2016: 1006 · 2015: 1053 · 2014: 1089 · 2013: 1134 · 2012: 1018
- FWCI
- 251.48
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- SIAM Review (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. National Science Foundation (DMS-0109086, DMS-0234188)
- James S. McDonnell Foundation and the Santa Fe Institute
- 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 › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Keywords
- complex networks, small-world effect, degree distribution, clustering, network correlation, random graph models, network growth models, preferential attachment, dynamical processes on networks, social networks, biological networks, internet
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
