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

We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled…

We establish new explicit bounds on the Gaussian approximation of Poisson functionals based on novel estimates of moments of Skorohod integrals. Combining these with the Malliavin-Stein method, we derive bounds in the Wasserstein and…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

Poisson point processes provide a versatile framework for modeling the distributions of random points in space. When the space is partitioned into cells, each associated with a single generating point from the Poisson process, there appears…

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

We prove Poisson approximation results for the bottom part of the length spectrum of a random closed hyperbolic surface of large genus. Here, a random hyperbolic surface is a surface picked at random using the Weil-Petersson volume form on…

We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…

We observe a realization of a stationary generalized weighted Voronoi tessellation of the d-dimensional Euclidean space within a bounded observation window. Given a geometric characteristic of the typical cell, we use the minus-sampling…

Empty region graphs are graphs whose vertices are points in $\mathbb{R}^d$ and where two vertices are connected by an edge whenever some associated region does not contain any other vertices. We investigate the asymptotic behaviour of long…

We define a generalization of the fixed point set, called the bounded fixed set, for a group acting by isometries on a metric space. An analogue of the P. A. Smith theorem is proved for metric spaces of finite asymptotic dimension, which…

We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…

We study the problem of detecting local geometry in random graphs. We introduce a model $\mathcal{G}(n, p, d, k)$, where a hidden community of average size $k$ has edges drawn as a random geometric graph on $\mathbb{S}^{d-1}$, while all…

Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…

Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…

Motivated by open problems in applied and computational algebraic topology, we establish multivariate normal approximation theorems for three random vectors which arise organically in the study of random clique complexes. These are: (1) the…

We establish Central Limit Theorems for the volumes of intersections of $B_{p}^n$ (the unit ball of $\ell_p^n$) with uniform random subspaces of codimension $d$ for fixed $d$ and $n\to \infty$. As a corollary we obtain higher order…

In this paper, we derive new, nearly optimal bounds for the Gaussian approximation to scaled averages of $n$ independent high-dimensional centered random vectors $X_1,\dots,X_n$ over the class of rectangles in the case when the covariance…

We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…