Upper large deviations for power-weighted edge lengths in spatial random networks

DOI10.1017/apr.2023.10arXiv2203.02190OpenAlexW4379388710MaRDI QIDQ6119929

Unnamed Author, Christian Hirsch

Publication date: 20 February 2024

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.02190

zbMATH Keywords

condensationlarge deviations\(\beta\)-skeleton\(k\)-nearest-neighbor graph

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Large deviations (60F10) Graph theory (05C99) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Cites Work

• Concentration bounds for geometric Poisson functionals: logarithmic Sobolev inequalities revisited
• Emergence of condensation in Kingman's model of selection and mutation
• Lower large deviations for geometric functionals
• Probability theory of classical Euclidean optimization problems
• The shape of the emerging condensate in effective models of condensation
• Nonextensive condensation in reinforced branching processes
• Weak laws of large numbers in geometric probability
• Central limit theorems for some graphs in computational geometry.
• Localization in random geometric graphs with too many edges
• Limit theory for the Gilbert graph
• Large deviations for functionals of spatial point processes with applications to random packing and spatial graphs
• A variational formula for the free energy of an interacting many-particle system
• Random Geometric Graphs
• The 2D‐directed spanning forest is almost surely a tree
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• A note about the uniform distribution on the intersection of a simplex and a sphere
• Lectures on the Poisson Process
• Large deviation principles for Euclidean functionals and other nearly additive processes
• Gaussian approximation for rooted edges in a random minimal directed spanning tree
• A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph

This page was built for publication: Upper large deviations for power-weighted edge lengths in spatial random networks