Connectivity of soft random geometric graphs

DOI10.1214/15-AAP1110zbMath1339.05369arXiv1311.3897OpenAlexW3099777322WikidataQ56533596 ScholiaQ56533596MaRDI QIDQ292916

Mathew D. Penrose

Publication date: 9 June 2016

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

stochastic geometryconnectivityrandom graphcontinuum percolationisolated pointsrandom connection model

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Connectivity (05C40)

Related Items

Connectivity of soft random geometric graphs over annuli, Transience Versus Recurrence for Scale-Free Spatial Networks, Recurrence versus transience for weight-dependent random connection models, Random walk on the random connection model, Higher-order spectral clustering for geometric graphs, The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects, Sunflower hard disk graphs, On the distances within cliques in a soft random geometric graph, Random geometric graph: some recent developments and perspectives, A probabilistic view of latent space graphs and phase transitions, Unnamed Item, Phase transition in noisy high-dimensional random geometric graphs, Phase transition in a stochastic geometry model with applications to statistical mechanics, Minimum spanning trees of random geometric graphs with location dependent weights, The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation, Hyperbolic graph generator, Inhomogeneous random graphs, isolated vertices, and Poisson approximation, Isolation and connectivity in random geometric graphs with self-similar intensity measures, Limit theory for isolated and extreme points in hyperbolic random geometric graphs, Poisson approximation and connectivity in a scale-free random connection model, Giant component of the soft random geometric graph, The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph, The acquaintance time of (percolated) random geometric graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Full connectivity: corners, edges and faces
• Hamilton cycles in random geometric graphs
• The longest edge of the random minimal spanning tree
• Connectivity threshold of Bluetooth graphs
• On a continuum percolation model
• ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS
• Random Geometric Graphs
• The capacity of wireless networks
• Continuum Percolation
• Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel
• Fundamentals of Wireless Communication