Geometric random intersection graphs with general connection probabilities

DOI10.1017/JPR.2024.18MaRDI QIDQ6442086zbMATH OpenFDO

Authors Maria Deijfen, Riccardo Michielan

Publication date 30 June 2023

Full work available at URL https://doi.org/10.1017/JPR.2024.18

Abstract: Let $mathcalV$ and $mathcalU$ be the point sets of two independent homogeneous Poisson processes on $mathbb{R}^d$. A graph $mathcal{G}_{m}athcalV$ with vertex set $mathcalV$ is constructed by first connecting pairs of points $(v,u)$ with $vinmathcalV$ and $uinmathcalU$ independently with probability $g(v-u)$, where $g$ is a non-increasing radial function, and then connecting two points $v_1,v_{2}inmathcalV$ if and only if they have a joint neighbor $uinmathcalU$. This gives rise to a random intersection graph on $mathbb{R}^d$. Local properties of the graph, including the degree distribution, are investigated and quantified in terms of the intensities of the underlying Poisson processes and the function $g$. Furthermore, the percolation properties of the graph are characterized and shown to differ depending on whether $g$ has bounded or unbounded support.

This page was built for publication: Geometric random intersection graphs with general connection probabilities

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