On the Distances Within Cliques in a Soft Random Geometric Graph
Open Access
- 7 March 2024
- journal article
- research article
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 191 (3) , 1-19
Abstract
We study the distances of vertices within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We obtain the scaling of the maximal distance between any two points within a clique of size k. Moreover, we show that asymptotically in all cliques with large distances, there is only one remote point and all other points are nearby. Furthermore, we prove that a re-scaled version of the maximal k-clique distance converges in distribution to a Fréchet distribution. Thereby, we describe the order of magnitude according to which the largest distance between two points in a clique decreases with the clique size.Keywords
All Related Versions
Funding Information
- NWO (VENI 202.001, M2 0.397)
This publication has 25 references indexed in Scilit:
- Counting Cliques and Cycles in Scale-Free Inhomogeneous Random GraphsJournal of Statistical Physics, 2019
- Geometric inhomogeneous random graphsTheoretical Computer Science, 2019
- Inhomogeneous random graphs, isolated vertices, and Poisson approximationJournal of Applied Probability, 2018
- Limit theory for the Gilbert graphAdvances in Applied Mathematics, 2017
- Cliques in Hyperbolic Random GraphsAlgorithmica, 2017
- Connectivity of Soft Random Geometric Graphs over AnnuliJournal of Statistical Physics, 2015
- Large Cliques in a Power-Law Random GraphJournal of Applied Probability, 2010
- Number of cliques in random scale-free network ensemblesPhysica D: Nonlinear Phenomena, 2006
- The diameter of a long‐range percolation graphRandom Structures & Algorithms, 2002
- Continuum Percolation1996