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 · cited 1×
“The interest in complex networks has exploded over the last five years [1, 2] where data on very large networks like the WWW [3, 4, 5], collaborations in the scientific community [6], trans-”
BackgroundStatistical 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
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
Recurrence networks—a novel paradigm for nonlinear time series analysis
Donner, R. V., Zou, Y., Donges, J. F., Marwan, N., & Kurths, J. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/3/033025 · Cited by 619
Underwater optical wireless communications, networking, and localization: A survey
Saeed, N., Celik, A., Al-Naffouri, T. Y., & Alouini, M.-S. (2019) · Ad Hoc Networks · doi:10.1016/j.adhoc.2019.101935 · Cited by 560
Percolation transition in dynamical traffic network with evolving critical bottlenecks
Li, D., Fu, B., Wang, Y., Lu, G., Berezin, Y., Stanley, H. E., & Havlin, S. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1419185112 · Cited by 475
The spatial structure of networks
Gastner, M. T., & Newman, M. E. J. (2006) · The European Physical Journal B - Condensed Matter and Complex Systems · doi:10.1140/epjb/e2006-00046-8 · Cited by 475
The physics of brain network structure, function and control
Lynn, C. W., & Bassett, D. S. (2019) · Nature Reviews Physics · doi:10.1038/s42254-019-0040-8 · Cited by 400
Fundamental structures of dynamic social networks
Sekara, V., Stopczynski, A., & Lehmann, S. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1602803113 · Cited by 313
Generative models of the human connectome
Betzel, R. F., Avena-Koenigsberger, A., Goñi, J., He, Y., de Reus, M. A., Griffa, A., Vértes, P. E., Mišic, B., Thiran, J.-P., Hagmann, P., et al. (2016) · NeuroImage · doi:10.1016/j.neuroimage.2015.09.041 · Cited by 303
Effects of mobility in a population of prisoner’s dilemma players
Meloni, S., Buscarino, A., Fortuna, L., Frasca, M., Gómez-Gardeñes, J., Latora, V., & Moreno, Y. (2009) · Physical Review E · doi:10.1103/physreve.79.067101 · Cited by 259
On time and space in the brain: A relativistic pseudo-diffusion framework
Le Bihan, D. (2020) · Brain Multiphysics · doi:10.1016/j.brain.2020.100016 · Cited by 30
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.