On the distances within cliques in a soft random geometric graph

DOI10.1007/s10955-024-03254-3arXiv2308.07168OpenAlexW4392545001MaRDI QIDQ6131244

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

zbMATH Keywords

random graphsextreme value theorycliquesnetwork clusteringsoft random geometric graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Continuum models (systems of particles, etc.) arising in equilibrium statistical mechanics (82B21) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Connectivity of soft random geometric graphs over annuli
• Connectivity of soft random geometric graphs
• High-dimensional random geometric graphs and their clique number
• Cliques in hyperbolic random graphs
• Functional Poisson approximation in Kantorovich-Rubinstein distance with applications to \(U\)-statistics and stochastic geometry
• Number of cliques in random scale-free network ensembles
• Geometric inhomogeneous random graphs
• Counting cliques and cycles in scale-free inhomogeneous random graphs
• Limit theory for the Gilbert graph
• Central limit theorems for \(U\)-statistics of Poisson point processes
• Large Cliques in a Power-Law Random Graph
• The diameter of a long-range percolation graph
• On a continuum percolation model
• Random Geometric Graphs
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• Continuum Percolation
• Cliques in geometric inhomogeneous random graphs

This page was built for publication: On the distances within cliques in a soft random geometric graph