The connectivity of a graph on uniform points on [0,\,1]\(^{d}\). (Q1871346)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The connectivity of a graph on uniform points on [0,\,1]\(^{d}\). |
scientific article |
Statements
The connectivity of a graph on uniform points on [0,\,1]\(^{d}\). (English)
0 references
7 May 2003
0 references
The authors compute the asymptotic behavior of the smallest value for which a class of uniformly distributed random graphs is connected. The connectivity of the random graph turns out to be equivalent, asymptotically, to its lack of isolated vertices. Hence, in dimension more than 2, the random graph of Appel and Russo behaves like random graph models of Erdős and Renyi.
0 references
geometric probability
0 references
