Poisson approximation and connectivity in a scale-free random connection model

DOI10.1214/21-EJP651zbMath1480.60293arXiv2002.10128OpenAlexW3173468749MaRDI QIDQ2042771

Srikanth K. Iyer, Sanjoy Kr Jhawar

Publication date: 21 July 2021

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

Stein's methodconnectivityPoisson point processscale-free networksPoisson convergenceinhomogeneous random connection model

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (1)

Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees

Cites Work

• Unnamed Item
• Connectivity of soft random geometric graphs
• Scale-free percolation
• Continuum percolation with steps in an annulus
• On the scaling of the chemical distance in long-range percolation models
• Scale-free percolation in continuum space
• Spatial preferential attachment networks: power laws and clustering coefficients
• On a continuum percolation model
• Random Geometric Graphs
• Random graph models of social networks
• The random connection model: Connectivity, edge lengths, and degree distributions
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Continuum percolation with steps in the square or the disc
• Random Networks for Communication

This page was built for publication: Poisson approximation and connectivity in a scale-free random connection model