Connectivity of soft random geometric graphs
type: Item
instance of: scholarly article
title: Connectivity of soft random geometric graphs
zbMATH Open document ID: 1339.05369
DOI: 10.1214/15-AAP1110
author: Mathew D. Penrose
published in: The Annals of Applied Probability
publication date: 2016-06-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1311.3897
full work available at URL: https://projecteuclid.org/euclid.aoap/1458651826
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60D05
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 60K35
zbMATH DE Number: 6590329
zbMATH Keywords: random graph
zbMATH Keywords: stochastic geometry
zbMATH Keywords: random connection model
zbMATH Keywords: connectivity
zbMATH Keywords: isolated points
zbMATH Keywords: continuum percolation
Wikidata QID: Q56533596
MaRDI profile type: Publication
arXiv ID: 1311.3897
cites work: Hamilton cycles in random geometric graphs
cites work: Random graphs.
cites work: Connectivity threshold of Bluetooth graphs
cites work: Full connectivity: corners, edges and faces
cites work: Q3267900
cites work: Q4227226
cites work: The capacity of wireless networks
cites work: Continuum Percolation
cites work: Random Geometric Graphs
cites work: On a continuum percolation model
cites work: The longest edge of the random minimal spanning tree
cites work: Q4265786
cites work: Fundamentals of Wireless Communication
cites work: Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel
cites work: ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS
OpenAlex ID: W3099777322
description: scientific article