Connectivity of soft random geometric graphs over annuli

DOI10.1007/S10955-015-1436-1zbMATH Open1335.05159arXiv1502.05440OpenAlexW3102232083WikidataQ59476604 ScholiaQ59476604MaRDI QIDQ281201FDOQ281201

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)

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.

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

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

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)

Cites Work

• Random Geometric Graphs
• Title not available (Why is that?)
• Networks. An introduction.
• Title not available (Why is that?)
• Unit disk graphs
• Random Plane Networks
• Swarming on random graphs
• Connectivity of soft random geometric graphs
• How well can graphs represent wireless interference?
• Full connectivity: corners, edges and faces
• Fundamentals of Wireless Communication

Cited In (7)

• The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
• 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
• Phase transition in a stochastic geometry model with applications to statistical mechanics
• Isotropic random geometric networks in two dimensions with a penetrable cavity
• On the distances within cliques in a soft random geometric graph

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)