Related papers: A Central Limit Theorem for the Poisson-Voronoi Ap…
Consider a stationary Poisson process $\eta$ in the $d$-dimensional Euclidean or hyperbolic space and construct a random graph with vertex set $\eta$ as follows. First, each point $x\in\eta$ is connected by an edge to its nearest neighbour,…
In this note we give a proof for the result stated as Theorem 4 in Poisson Approximation in a Poisson Limit Theorem Inspired by Coupon Collecting.
Quantitative limit theorems for non-linear functionals on the Wiener space are considered. Given the possibly infinite sequence of kernels of the chaos decomposition of such a functional, an estimate for different probability distances…
The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…
We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate…
In this paper, we give sufficient conditions to establish central limit theorems for boundary estimates of Poisson point processes. The considered estimates are obtained by smoothing some bias corrected extreme values of the point process.…
We prove a Poisson limit theorem in the total variation distance of functionals of a general Poisson point process using the Malliavin-Stein method. Our estimates only involve first and second order difference operators and are closely…
In \cite{BNT}, a framework to prove almost sure central limit theorems for sequences $(G_n)$ belonging to the Wiener space was developed, with a particular emphasis of the case where $G_n$ takes the form of a multiple Wiener-It\^o integral…
We examine a generalization of the binomial distribution associated with a strictly increasing sequence of numbers and we prove its Poisson-like limit. Such generalizations might be found in quantum optics with imperfect detection. We…
We prove a variant of the Lavrentiev's approximation theorem that allows us to approximate a continuous function on a compact set K in C without interior points and with connected complement, with polynomial functions that are nonvanishing…
Random union sets $Z$ associated with stationary Poisson processes of $k$-cylinders in $\mathbb{R}^d$ are considered. Under general conditions on the typical cylinder base a concentration inequality for the volume of $Z$ restricted to a…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…
The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…
Ordinary differential equations obtained as limits of Markov processes appear in many settings. They may arise by scaling large systems, or by averaging rapidly fluctuating systems, or in systems involving multiple time-scales, by a…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
We study the approximation of holomorphic functions of several complex variables by the ring $\mathcal{P}^S(\mathbb{C}^n)$ of polynomials whose exponents are restricted to a convex cone $\mathbb{R}_+S$ for some compact convex $S\in…
The paper is concerned with the equilibrium distributions of continuous-time density dependent Markov processes on the integers. These distributions are known typically to be approximately normal, and the approximation error, as measured in…
We present new, exceptionally efficient proofs of Poisson--Dirichlet limit theorems for the scaled sizes of irreducible components of random elements in the classic combinatorial contexts of arbitrary assemblies, multisets, and selections,…
Hambly, Keevash, O'Connell and Stark have proven a central limit theorem for the characteristic polynomial of a permutation matrix with respect to the uniform measure on the symmetric group. We generalize this result in several ways. We…