Rare event probabilities in random geometric graphs

Abstract We study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the d -dimensional unit sphere or correspond to d -dimensional standard Gaussian vectors, and edges are added between two vertices if the inner product between their corresponding points is greater than a threshold t Subscript p t p $t_{p}$ , chosen such that the probability of having an edge is equal to p . We focus on two problems: (a) the probability that the random geometric graph is a complete graph and (b) the probability of observing an atypically large number of edges. We obtain asymptotically exponential decay rates depending on n and d of the probabilities of these rare events through a combination of geometric and probabilistic arguments.

Authors

Institutions

Publication Details

Journal
Advances in Applied Probability
Published
2026-09-14
DOI
https://doi.org/10.1017/apr.2026.10076
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rare event probabilities in random geometric graphs

Bingcao Wu, Prabhanka Deka
Advances in Applied Probability
Stochastic processes and statistical mechanics
article

Rare event probabilities in random geometric graphs

Bingcao Wu, Prabhanka Deka
article en

Abstract

Abstract We study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the d -dimensional unit sphere or correspond to d -dimensional standard Gaussian vectors, and edges are added between two vertices if the inner product between their corresponding points is greater than a threshold t Subscript p t p $t_{p}$ , chosen such that the probability of having an edge is equal to p . We focus on two problems: (a) the probability that the random geometric graph is a complete graph and (b) the probability of observing an atypically large number of edges. We obtain asymptotically exponential decay rates depending on n and d of the probabilities of these rare events through a combination of geometric and probabilistic arguments.

Advances in Applied Probability
Peking University (CN)
Openalex Percentile: Top 87%
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.