Random geometric graphs with general connection functions

Abstract

In the original (1961) Gilbert model of random geometric graphs, nodes are placed according to a Poisson point process, and links formed between those within a fixed range. Motivated by wireless ad-hoc networks "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H(r) that gives the probability that two nodes at distance r are linked (directly connect). In many applications (not only wireless networks), it is desirable that the graph is connected, that is every node is linked to every other node in a multihop fashion. Here, the connection probability of a dense network in a convex domain in two or three dimensions is expressed in terms of contributions from boundary components, for a very general class of connection functions. It turns out that only a few quantities such as moments of the connection function appear. Good agreement is found with special cases from previous studies and with numerical simulations.

16 pages; improved figures and minor edits

References in corpus (7)

• Complex networks in climate dynamics - Comparing linear and nonlinear network construction methods
• Phase transition in the economically modeled growth of a cellular nervous system
• Connectivity of Soft Random Geometric Graphs Over Annuli
• Continuum percolation with steps in an annulus
• Connectivity of confined 3D Networks with Anisotropically Radiating Nodes
• Network connectivity in non-convex domains with reflections
• k-connectivity for confined random networks

Cited by in corpus (32)

• Clustering implies geometry in networks
• Statistical properties of the quantum internet
• Topological data analysis of continuum percolation with disks
• Small worlds and clustering in spatial networks
• Spectral statistics of random geometric graphs
• Topological versus spectral properties of random geometric graphs
• Entropy of Spatial Network Ensembles
• Connectivity in One-Dimensional Soft Random Geometric Graphs
• Random spherical graphs
• Spatial networks with wireless applications
• Dynamic Hidden-Variable Network Models
• Symmetric motifs in random geometric graphs
• Transitions in spatial networks
• Directed Random Geometric Graphs
• Random-Graph Models and Characterization of Granular Networks
• Geometric evolution of complex networks
• Isolation probabilities in dynamic soft random geometric graphs
• Multilayer Random Sequential Adsorption
• Isolation and connectivity in random geometric graphs with self-similar intensity measures
• A Random-Line-Graph Approach to Overlapping Line Segments
• Location, location, location: Border effects in interference limited ad hoc networks
• Isotropic random geometric networks in two dimensions with a penetrable cavity
• The Distribution of the Number of Isolated Nodes in the 1-Dimensional Soft Random Geometric Graph
• Temporal connectivity in finite networks with non-uniform measures
• Fault Tolerance of Random Graphs with respect to Connectivity: Mean-field Approximation for Semi-dense Random Graphs
• Large algebraic connectivity fluctuations in spatial network ensembles imply a predictive advantage from node location information
• A Cosine Rule-Based Discrete Sectional Curvature for Graphs
• A Geometric Chung Lu model and the Drosophila Medulla connectome
• Connectivity of Cooperative Ad hoc Networks
• Generic Multimodal Spatially Graph Network for Spatially Embedded Network Representation Learning
• Connectivity of Ad Hoc Wireless Networks with Node Faults
• Entropy of Random Geometric Graphs in High and Low Dimensions