The connectivity threshold of random geometric graphs with Cantor distributed vertices

DOI10.1016/J.SPL.2012.07.015MaRDI QIDQ2231014zbMATH OpenOpenAlexFDO

Authors Antar Bandyopadhyay, Farkhondeh Sajadi

Publication date 29 September 2021

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.0667

zbMATH Keywords

Cantor distributionconnectivity thresholdrandom geometric graphsingular distributions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Strong limit theorems (60F15) (L^p)-limit theorems (60F25) Extreme value theory; extremal stochastic processes (60G70)

Abstract: For connectivity of emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. emph{Cantor} distributed points on $[0,1]$. We show that for this random geometric graph, the connectivity threshold $R_n$, converges almost surely to a constant $1-2phi$ where $0<phi<1/2$, which for the standard Cantor distribution is 1/3. We also show that $|R_n-(1-2phi){|}_{1}sim2,C(phi),n^{-1/d_{phi}}$ where $C(phi)>0$ is a constant and $d_{phi}:=-log2/logphi$ is the emph{Hausdorff dimension} of the generalized Cantor set with parameter $phi$.

Recommendations

• Connectivity of soft random geometric graphs
• scientific article; zbMATH DE number 1340281
• The random connection model: Connectivity, edge lengths, and degree distributions
• One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
• Connectivity of random k-nearest-neighbour graphs

Cites work

• A Strong Law for the Largest Nearest-Neighbour Link between Random Points
• Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution
• scientific article; zbMATH DE number 2171466 (Why is no real title available?)
• Moments of order statistics of the Cantor distribution
• Random Geometric Graphs
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).

Cited in

(5)

• Connectivity threshold for random chordal graphs
• Isolation and connectivity in random geometric graphs with self-similar intensity measures
• Connectivity of soft random geometric graphs over annuli
• The bin-covering technique for thresholding random geometric graph properties
• The connectivity threshold for the min‐degree random graph process

This page was built for publication: The connectivity threshold of random geometric graphs with Cantor distributed vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231014)