2002
DOI: 10.1103/physreve.66.016121
|View full text |Cite
|
Sign up to set email alerts
|

Random geometric graphs

Abstract: 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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

21
468
2
8

Year Published

2005
2005
2021
2021

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 454 publications
(499 citation statements)
references
References 37 publications
21
468
2
8
Order By: Relevance
“…Moreover, they pointed out that the mobility led the system to only two stable states (i.e., all cooperators or all defectors). In contrast, when v = 0 the graph corresponds to a random geometric graph [48], so the stabilization of a population containing a mixture of the two strategies is expected.…”
Section: The Key Role Of Mobilitymentioning
confidence: 99%
“…Moreover, they pointed out that the mobility led the system to only two stable states (i.e., all cooperators or all defectors). In contrast, when v = 0 the graph corresponds to a random geometric graph [48], so the stabilization of a population containing a mixture of the two strategies is expected.…”
Section: The Key Role Of Mobilitymentioning
confidence: 99%
“…22,23 While time series networks can reflect the dynamical properties of time series obtained from a complex system in a smorgasbord of different ways, pyunicorn focusses on two complementary approaches: (i) Recurrence networks, 24,25 an approach closely related to recurrence quantification analysis of recurrence plots, are random geometric graphs 26,119 representing proximity relationships (links) of state vectors (nodes) in phase space (Sec. IV A).…”
Section: Network-based Time Series Analysismentioning
confidence: 99%
“…A standard RGG can be constructed by distributing N points uniformly at random in some topological space, e.g., the two dimensional unit square, and connecting all pairs of nodes that are separated by a Euclidian distance less than a fixed threshold, R. There is an extensive literature on random geometric graphs, particularly in the context of continuum percolation (Dall and Christensen, 2002;Penrose, 2003;Barthélemy, 2011). The degree distribution of a RGG is Poisson with mean equal to N πR 2 (Dall and Christensen, 2002).…”
Section: Previous Workmentioning
confidence: 99%
“…The degree distribution of a RGG is Poisson with mean equal to N πR 2 (Dall and Christensen, 2002). The clustering coefficient of a RGG tends to 1 − 3 √ 3 4π ∼ 0.5865 for all 2-dimensional RGGs in the Euclidean space (Dall and Christensen, 2002), and their assortativity tends to the same value (Antonioni and Tomassini, 2012;Barnett et al, 2007).…”
Section: Previous Workmentioning
confidence: 99%