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

DOI10.1214/21-EJP651MaRDI QIDQ2042771zbMATH OpenOpenAlexFDO

Authors 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

connectivityinhomogeneous random connection modelPoisson convergencePoisson point processscale-free networksStein's method

Mathematics Subject Classification ID

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

Abstract: We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $mathcal{P}_s$ of intensity $s>0$ on the unit cube $S=left(-frac12,frac12ight{]}^d,$ $dgeq2$ . Each vertex is endowed with an independent random weight distributed as $W$, where $$, $$. Given the vertex set and the weights an edge exists between $x,yinmathcal{P}_s$ with probability $left(1-expleft(-fraceta{W}_x{W}_{y}left(d(x,y)/right{)}^{alpha}ight)ight),$ independent of everything else, where $eta,alpha>0$, $d(cdot,cdot)$ is the toroidal metric on $S$ and $r>0$ is a scaling parameter. We derive conditions on $$ such that under the scaling $$ $xiinmathbbR$, the number of vertices of degree $k$ converges in total variation distance to a Poisson random variable with mean $e^{-xi}$ as $soinfty$, where $c_0$ is an explicitly specified constant that depends on $$ and $eta$ but not on $k$. In particular, for $k=0$ we obtain the regime in which the number of isolated nodes stabilizes, a precursor to establishing a threshold for connectivity. We also derive a sufficient condition for the graph to be connected with high probability for large $s$. The Poisson approximation result is derived using the Stein's method.

Recommendations

• The random connection model: Connectivity, edge lengths, and degree distributions
• High density asymptotics of the Poisson random connection model
• The random connection model in high dimensions
• Connectivity of Poissonian inhomogeneous random multigraphs
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation

Cites work

• Connectivity of soft random geometric graphs
• Continuum percolation with steps in an annulus
• Continuum percolation with steps in the square or the disc
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• On a continuum percolation model
• On the scaling of the chemical distance in long-range percolation models
• Random Geometric Graphs
• Random graph models of social networks
• Random Networks for Communication
• Scale-free percolation
• Scale-free percolation in continuum space
• Spatial preferential attachment networks: power laws and clustering coefficients
• The random connection model: Connectivity, edge lengths, and degree distributions

Cited in

(12)

• The random connection model in high dimensions
• High density asymptotics of the Poisson random connection model
• Recurrence versus transience for weight-dependent random connection models
• Distributions in a class of Poissonized urns with an application to Apollonian networks
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• Absence of Breakdown of the Poisson Hypothesis I. Closed Networks at Low Load
• Limit behaviors of random connected graphs driven by a Poisson process
• scientific article; zbMATH DE number 7560513 (Why is no real title available?)
• Poisson Hypothesis for Open Networks at Low Load
• Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees
• Connectivity of Poissonian inhomogeneous random multigraphs
• Poisson approximation of fixed-degree nodes in weighted random connection models

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

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