# Connecting the Random Connection Model

Source: [Connecting the Random Connection Model](<https://www.sota2.com/research/paper/68fa524b1e209131ce979bb3>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:36.863Z

Authors: Srikanth K. Iyer

Published: 2015-10-19T12:07:11.000Z

## Abstract

Consider the random graph $G({\\mathcal P}\_{n},r)$ whose vertex set ${\\mathcal P}\_{n}$ is a Poisson point process of intensity $n$ on $(- \\frac{1}{2}, \\frac{1}{2}\]^d$, $d \\geq 2$. Any two vertices $X\_i,X\_j \\in {\\mathcal P}\_{n}$ are connected by an edge with probability $g\\left( \\frac{d(X\_i,X\_j)}{r} \\right)$, independently of all other edges, and independent of the other points of ${\\mathcal P}\_{n}$. $d$ is the toroidal metric, $r \> 0$ and $g:\[0,\\infty) \\to \[0,1\]$ is non-increasing and $\\alpha = \\int\_{\\mathbb{R}^d} g(\|x\|) dx \< \\infty$. Under suitable conditions on $g$, almost surely, the critical parameter $d\_n$ for which $G({\\mathcal P}\_{n}, \\cdot)$ does not have any isolated nodes satisfies $\\lim\_{n \\to \\infty} \\frac{\\alpha n d\_n^d}{\\log n} = 1$. Let $\\beta = \\inf\\{x \> 0: x g\\left( \\frac{\\alpha}{x \\theta} \\right) \> 1 \\}$, and $\\theta$ be the volume of the unit ball in $\\mathbb{R}^d$. Then for all $\\gamma \> \\beta$, $G\\left({\\mathcal P}\_{n}, \\left( \\frac{\\gamma \\log n}{\\alpha n} \\right)^{\\frac{1}{d}}\\right)$ is connected with probability approaching one as $n \\to \\infty$. The bound can be seen to be tight for the usual random geometric graph obtained by setting $g = 1\_{\[0,1\]}$. We also prove some useful results on the asymptotic behaviour of the length of the edges and the degree distribution in the {\\it connectivity regime}.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1510.05440>)

[PDF](<https://arxiv.org/pdf/1510.05440.pdf>)
