Connectivity of soft random geometric graphs over annuli

DOI10.1007/S10955-015-1436-1MaRDI QIDQ281201zbMATHOpenAlexWikidataFDO

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

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

network sciencestatistical mechanicscommunication theoryad hoc networksrandom geometric graphs

Mathematics Subject Classification ID

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

Abstract: Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present analytic formulas for the connection probability of these spatially embedded graphs, describing the connectivity behaviour as a dense-network limit is approached. This extends recent work modelling ad hoc networks in non-convex domains.

Recommendations

• Connectivity of soft random geometric graphs
• scientific article; zbMATH DE number 7650120
• Connectivity of random high dimensional geometric graphs
• scientific article; zbMATH DE number 1340281
• Probabilistic properties of highly connected random geometric graphs
• Probabilistic properties of highly connected random geometric graphs
• The connectivity threshold of random geometric graphs with Cantor distributed vertices
• Connectedness of certain random graphs
• Connectivity of finite anisotropic random graphs and directed graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 227027 (Why is no real title available?)
• Connectivity of soft random geometric graphs
• Full connectivity: corners, edges and faces
• Fundamentals of Wireless Communication
• How well can graphs represent wireless interference?
• Networks. An introduction.
• Random Geometric Graphs
• Random Plane Networks
• Swarming on random graphs
• Unit disk graphs

Cited in

(7)

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

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

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