Sub-tree counts on hyperbolic random geometric graphs
DOI10.1017/apr.2022.1zbMath1503.60030arXiv1802.06105OpenAlexW2788153713WikidataQ115563897 ScholiaQ115563897MaRDI QIDQ5055360
Takashi Owada, Dhandapani Yogeshwaran
Publication date: 13 December 2022
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.06105
hyperbolic spacescentral limit theoremPoisson point processrandom geometric graphsMalliavin-Stein methodsub-tree counts
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Hyperbolic and elliptic geometries (general) and generalizations (51M10)
Related Items (2)
Cites Work
- Unnamed Item
- Stochastic analysis for Poisson point processes. Malliavin calculus, Wiener-Itô chaos expansions and stochastic geometry
- Limit theory for point processes in manifolds
- Coarse geometry and randomness. École d'Été de Probabilités de Saint-Flour XLI -- 2011
- On the largest component of a hyperbolic model of complex networks
- Cliques in hyperbolic random graphs
- Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization
- Bootstrap percolation and the geometry of complex networks
- Probability theory of classical Euclidean optimization problems
- Spectral gap of random hyperbolic graphs and related parameters
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Limit theory for isolated and extreme points in hyperbolic random geometric graphs
- Clustering in a hyperbolic model of complex networks
- The topology of probability distributions on manifolds
- Statistical regularities of self-intersection counts for geodesics on negatively curved surfaces
- Random construction of Riemann surfaces
- Percolation in the hyperbolic plane
- The probability of connectivity in a hyperbolic model of complex networks
- Probability on Trees and Networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- Typical distances in a geometric model for complex networks
- Foundations of Hyperbolic Manifolds
- Random Plane Networks
- Random Geometric Graphs
- Stochastic Geometry for Wireless Networks
- On a geometrization of the Chung–Lu model for complex networks
- Continuum Percolation
- Poisson approximation of the length spectrum of random surfaces
- Stochastic Geometry and Wireless Networks: Volume I Theory
- A Bound for the Diameter of Random Hyperbolic Graphs
- The diameter of KPKVB random graphs
- On the Second Largest Component of Random Hyperbolic Graphs
- Lectures on the Poisson Process
- Random Čech complexes on Riemannian manifolds
- Clustering and the Hyperbolic Geometry of Complex Networks
This page was built for publication: Sub-tree counts on hyperbolic random geometric graphs