On the distances within cliques in a soft random geometric graph
DOI10.1007/S10955-024-03254-3arXiv2308.07168OpenAlexW4392545001MaRDI QIDQ6131244FDOQ6131244
Authors: Ercan Sönmez, Clara Stegehuis 
Publication date: 4 April 2024
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.07168
Extreme value theory; extremal stochastic processes (60G70) Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Continuum models (systems of particles, etc.) arising in equilibrium statistical mechanics (82B21)
Cites Work
- Random Geometric Graphs
- Central limit theorems for \(U\)-statistics of Poisson point processes
- Continuum Percolation
- Limit theory for the Gilbert graph
- Connectivity of soft random geometric graphs over annuli
- Connectivity of soft random geometric graphs
- On a continuum percolation model
- The diameter of a long-range percolation graph
- Inhomogeneous random graphs, isolated vertices, and Poisson approximation
- High-dimensional random geometric graphs and their clique number
- Large cliques in a power-law random graph
- Number of cliques in random scale-free network ensembles
- Cliques in geometric inhomogeneous random graphs
- Cliques in hyperbolic random graphs
- Functional Poisson approximation in Kantorovich-Rubinstein distance with applications to \(U\)-statistics and stochastic geometry
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- Geometric inhomogeneous random graphs
This page was built for publication: On the distances within cliques in a soft random geometric graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131244)
