Isolation and connectivity in random geometric graphs with self-similar intensity measures

DOI10.1007/S10955-018-2059-0MaRDI QIDQ1785675zbMATH OpenOpenAlexWikidataFDO

Authors Carl P. Dettmann

Publication date 1 October 2018

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1710.11043, http://europepmc.org/articles/pmc6434978

zbMATH Keywords

connectivitydegree distributionfractalsrandom geometric graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80) Geometric probability and stochastic geometry (60D05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Abstract: Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes is Poisson distributed, and the probability of no isolated nodes is equal to the probability the whole graph is connected. Here we examine these properties for several self-similar node distributions, including smooth and fractal, uniform and nonuniform, and finitely ramified or otherwise. We show that nonuniformity can break the Poisson distribution property, but it strengthens the link between isolation and connectivity. It also stretches out the connectivity transition. Finite ramification is another mechanism for lack of connectivity. The same considerations apply to fractal distributions as smooth, with some technical differences in evaluation of the integrals and analytical arguments.

Recommendations

• The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
• Connectivity of soft random geometric graphs
• The random connection model: Connectivity, edge lengths, and degree distributions
• Nonuniform random geometric graphs with location-dependent radii
• The connectivity threshold of random geometric graphs with Cantor distributed vertices

Cites work

• A class of pairwise-independent joinings
• Asymptotic expansions in the Poisson limit theorem
• Connectivity of communication networks
• Connectivity of soft random geometric graphs
• Continuum Percolation
• Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs
• Equilibrium states of the pressure function for products of matrices
• Extremes on trees
• Finite clusters in high-density continuous percolation: Compression and sphericality
• Fractal geometry. Mathematical foundations and applications
• Full connectivity: corners, edges and faces
• scientific article; zbMATH DE number 3832277 (Why is no real title available?)
• scientific article; zbMATH DE number 5942363 (Why is no real title available?)
• scientific article; zbMATH DE number 3964277 (Why is no real title available?)
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Lectures on analysis on metric spaces
• On a continuum percolation model
• Outbreak of infectious diseases through the weighted random connection model
• Potential theory and analytic properties of self-similar fractal and multifractal distributions
• Random Geometric Graphs
• Random Plane Networks
• Recycling of strange sets: I. Cycle expansions
• Stochastic geometry for wireless networks
• The acquaintance time of (percolated) random geometric graphs
• The longest edge of the random minimal spanning tree
• Topological properties of the one dimensional exponential random geometric graph
• Uniformly Distributed Measures in Euclidean Spaces

Cited in

(3)

• The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
• Symmetric motifs in random geometric graphs
• Topological properties of the one dimensional exponential random geometric graph

This page was built for publication: Isolation and connectivity in random geometric graphs with self-similar intensity measures

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