The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
type: Item
instance of: scholarly article
title: The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
zbMATH Open document ID: 1039.05054
DOI: 10.1016/S0167-7152(02)00233-X
author: Martin J. B. Appel
author: Ralph P. Russo
published in: Statistics \& Probability Letters
publication date: 2003-05-07T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 1907011
zbMATH Keywords: geometric probability
MaRDI profile type: Publication
cites work: The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]d
cites work: The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d
cites work: Q4198785
cites work: The limit distribution of the largest nearest-neighbour link in the unit d-cube
cites work: A log log law for maximal uniform spacings
cites work: Q3680834
cites work: The longest edge of the random minimal spanning tree
cites work: Q4265786
cites work: A strong law for the longest edge of the minimal spanning tree
cites work: Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions
full work available at URL: s0167-7152(02)00233-x
OpenAlex ID: W1996807175
description: scientific article; zbMATH DE number 1907011