Connectivity of soft random geometric graphs over annuli

DOI10.1007/s10955-015-1436-1zbMath1335.05159arXiv1502.05440OpenAlexW3102232083WikidataQ59476604 ScholiaQ59476604MaRDI QIDQ281201

Carl P. Dettmann, Alexander P. Giles, Orestis Georgiou

Publication date: 10 May 2016

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

statistical mechanicsad hoc networksnetwork sciencecommunication theoryrandom geometric graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Connectivity (05C40) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)

Related Items (5)

Random connection models in the thermodynamic regime: central limit theorems for add-one cost stabilizing functionals ⋮ Isotropic random geometric networks in two dimensions with a penetrable cavity ⋮ On the distances within cliques in a soft random geometric graph ⋮ Phase transition in a stochastic geometry model with applications to statistical mechanics ⋮ The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Connectivity of soft random geometric graphs
• Full connectivity: corners, edges and faces
• Unit disk graphs
• Swarming on random graphs
• How Well Can Graphs Represent Wireless Interference?
• Random Plane Networks
• Random Geometric Graphs
• Fundamentals of Wireless Communication
• Networks

This page was built for publication: Connectivity of soft random geometric graphs over annuli