The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Random geometric graphs
Open accessAbstract
We analyze graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient, which shows that the graphs are distinctly different from standard random graphs, even for infinite dimensionality. Insights relevant for graph bipartitioning are included.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
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
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Bollobás, B. (1985) · Cited by 6,196
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051 · cited 1×
“dk portation [7], movie actor collaborations [8] etc.”
BackgroundRandom Heterogeneous Materials
Torquato, S. (2002) · Interdisciplinary Applied Mathematics · doi:10.1007/978-1-4757-6355-3 · Cited by 2,778
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Clustering and preferential attachment in growing networks
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.025102 · Cited by 2,093
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
An Introduction To Percolation Theory
Hughes, B. D. (1996) · Random Walks and Random Environments · doi:10.1093/oso/9780198537892.003.0002 · Cited by 1,731
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
WHEELER, J. A. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,212
Scaling and percolation in the small-world network model
Newman, M. E. J., & Watts, D. J. (1999) · Physical Review E · doi:10.1103/physreve.60.7332 · Cited by 1,202
Connectivity of Growing Random Networks
Krapivsky, P. L., Redner, S., & Leyvraz, F. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4629 · Cited by 1,197
Where the really hard problems are
Cheeseman, P. C., Kanefsky, B., & Taylor, W. M. (1991) · Cited by 1,004
Collective dynamics of 'small-world' networks
Watts, D. J., & Strogatz, S. H. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.301 · Cited by 988
Growth dynamics of the World-Wide Web
Huberman, B. A., & Adamic, L. A. (1999) · Nature · doi:10.1038/43604 · Cited by 863
Size and form in efficient transportation networks
Banavar, J. R., Maritan, A., & Rinaldo, A. (1999) · Nature · doi:10.1038/20144 · Cited by 854
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
Newman, M. E. J. (2000) · Journal of Statistical Physics · doi:10.1023/a:1026485807148 · Cited by 716
Critical Behavior in the Satisfiability of Random Boolean Expressions
Kirkpatrick, S., & Selman, B. (1994) · Science · doi:10.1126/science.264.5163.1297 · Cited by 589
Are randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
Evolution of networks with aging of sites
Dorogovtsev, S. N., & Mendes, J. F. F. (2000) · Physical Review E · doi:10.1103/physreve.62.1842 · Cited by 438
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.503 · Cited by 345
Recent developments in continuum percolation
Balberg, I. (1987) · Philosophical Magazine B · doi:10.1080/13642818708215336 · Cited by 286
Boettcher, S., & Percus, A. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00007-2 · Cited by 278
Efficient measurement of the percolation threshold for fully penetrable discs
Quintanilla, J., Torquato, S., & Ziff, R. M. (2000) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/33/42/104 · Cited by 232
Universal percolation-threshold limits in the continuum
Balberg, I. (1985) · Physical Review B · doi:10.1103/physrevb.31.4053 · Cited by 200
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.269 · Cited by 188
EPIDEMIC SPREADING IN SCALEFREE NETWORKS
Pastor‐Satorras, R., & Vespignani, A. (2001) · Cited by 169
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., Daniel, et al. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356.507 · Cited by 143
Extremal optimization for graph partitioning
Boettcher, S., & Percus, A. G. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.026114 · Cited by 138
Graph bipartitioning and spin glasses on a random network of fixed finite valence
Wong, K. Y. M., & Sherrington, D. (1987) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/20/12/008 · Cited by 61
Extremal optimization of graph partitioning at the percolation threshold
Boettcher, S. (1999) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/32/28/302 · Cited by 55
Cited by
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
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Modelling disease outbreaks in realistic urban social networks
Eubank, S., Guclu, H., Anil Kumar, V. S., Marathe, M. V., Srinivasan, A., Toroczkai, Z., & Wang, N. (2004) · Nature · doi:10.1038/nature02541 · Cited by 2,090
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Complex network approaches to nonlinear time series analysis
Zou, Y., Donner, R. V., Marwan, N., Donges, J. F., & Kurths, J. (2019) · Physics Reports · doi:10.1016/j.physrep.2018.10.005 · Cited by 634
Metadata
- Authors
- Dall, J., & Christensen, M.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-07-24
- Volume
- 66
- Issue
- 1
- Pages
- 016121-016121
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1979170109
- Cited by
- 480
- References
- 43
- FWCI
- 3.13
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.