English
Related papers

Related papers: Almost Sure Central Limit Theorems in Stochastic G…

200 papers

Consider a Poisson point process within a convex set in a Euclidean space. The Vietoris-Rips complex is the clique complex over the graph connecting all pairs of points with distance at most $\delta$. Summing powers of the volume of all…

Probability · Mathematics 2019-12-03 G. Akinwande , M. Reitzner

Establishing almost sure convergence rates for stochastic approximation and reinforcement learning under Markovian noise is a fundamental theoretical challenge. We make progress towards this challenge for a class of stochastic approximation…

Machine Learning · Computer Science 2026-05-11 Xinyu Liu , Zixuan Xie , Shangtong Zhang

The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…

Probability · Mathematics 2021-02-18 Van Hao Can , Khanh Duy Trinh

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…

Combinatorics · Mathematics 2018-05-09 A. V. Burkin , M. E. Zhukovskii

In this paper, we develop tools to establish almost sure stability of stochastic switched systems whose switching signal is constrained by an automaton. After having provided the necessary generalizations of existing results in the setting…

Optimization and Control · Mathematics 2022-08-26 Matteo Della Rossa , Raphaël M. Jungers

The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…

Statistics Theory · Mathematics 2026-02-23 Mingao Yuan , Md. Niamul Islam Sium

We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…

Probability · Mathematics 2009-11-11 V. Shcherbakov

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

Combinatorics · Mathematics 2025-04-01 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

Probability · Mathematics 2022-09-07 Remco van der Hofstad , Pim van der Hoorn , Neeladri Maitra

Parseval and equal-norm frames play a fundamental role in frame theory and signal processing. In this work, we prove non-asymptotic concentration bounds showing that random equal-norm frames are nearly Parseval with high probability, and…

Functional Analysis · Mathematics 2026-05-06 Samuel Ballas , Ferhat Karabatman , Tom Needham

We give an overview of the recent asymptotic results on the geometry of excursion sets of stationary random fields. Namely, we cover a number of limit theorems of central type for the volume of excursions of stationary (quasi--, positively…

Probability · Mathematics 2013-07-24 Evgeny Spodarev

We investigate an almost sure limit theorem (ASCLT) for sequences of random variables having the form of a ratio of two terms such that the numerator satisfies the ASCLT and the denominator is a positive term which converges almost surely…

Probability · Mathematics 2012-09-04 Peggy Cénac , Khalifa Es-Sebaiy

We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical…

Probability · Mathematics 2019-04-05 Matthew Coulson , Robert E. Gaunt , Gesine Reinert

Central limit theorems for linear statistics of lattice random fields (including spin models) are usually proven under suitable mixing conditions or quasi-associativity. Many interesting examples of spin models do not satisfy mixing…

Probability · Mathematics 2018-03-28 Tulasi Ram Reddy , Sreekar Vadlamani , D. Yogeshwaran

We derive a central limit theorem for the number of vertices of convex polytopes induced by stationary Poisson hyperplane processes in $\mathbb{R}^d$. This result generalizes an earlier one proved by Paroux [Adv. in Appl. Probab. 30 (1998)…

Probability · Mathematics 2007-05-23 Lothar Heinrich , Hendrik Schmidt , Volker Schmidt

We present normal approximation results at the process level for local functionals defined on dynamic Poisson processes in $\mathbb{R}^d$. The dynamics we study here are those of a Markov birth-death process. We prove functional limit…

Probability · Mathematics 2022-10-25 Efe Onaran , Omer Bobrowski , Robert J. Adler

We consider the branching random walks in $d$-dimensional integer lattice with time--space i.i.d. offspring distributions. Then the normalization of the total population is a nonnegative martingale and it almost surely converges to a…

Probability · Mathematics 2011-01-07 Makoto Nakashima

We prove limit theorems for functionals of a Poisson point process using the Malliavin calculus on the Poisson space. The target distribution is conditionally either a Gaussian vector or a Poisson random variable. The convergence is stable…

Probability · Mathematics 2024-06-21 Ronan Herry

We establish an approximate zero-one law for sentences of continuous logic over finite metric spaces of diameter at most $1$. More precisely, we axiomatize a complete metric theory $T_{\mathrm{as}}$ such that, given any sentence $\sigma$ in…

Logic · Mathematics 2022-01-13 Isaac Goldbring , Bradd Hart , Alex Kruckman

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…

Probability · Mathematics 2026-04-09 Mathew D. Penrose , Xiaochuan Yang