Related papers: Un theoreme de la limite locale pour des algorithm…

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…

Let P be a long range metric perturbation of the Euclidean Laplacian on R^d, d>1. We prove local energy decay for the solutions of the wave, Klein-Gordon and Schroedinger equations associated to P. The problem is decomposed in a low and…

We propose the first \emph{local search} algorithm for Euclidean clustering that attains an $O(1)$-approximation in almost-linear time. Specifically, for Euclidean $k$-Means, our algorithm achieves an $O(c)$-approximation in $\tilde{O}(n^{1…

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)…

We consider asymptotic behavior of Fourier transforms of stationary ergodic sequences with finite second moments. We establish a central limit theorem (CLT) for almost all frequencies and also an annealed CLT. The theorems hold for all…

We prove a non conventional pointwise convergence theorem for a nilsystem, and give an explicit formula for the limit.

Using an averaged generating function for coloured hard-dimers, some random variables of interest are studied. The main result lies in the fact that all their probability distributions obey a central limit theorem.

We provide a functional central limit theorem for a broad class of smooth functions for possibly noncausal multivariate linear processes with time-varying coefficients. Since the limiting processes depend on unknown quantities, we propose a…

We prove limit theorems for sums of randomly chosen random variables conditioned on the summands. We consider several versions of the corner growth setting, including specific cases of dependence amongst the summands and summands with heavy…

In this work, we propose a large-graph limit estimate of the matching coverage for several matching algorithms, on general graphs generated by the configuration model. For a wide class of {\em local} matching algorithms, namely, algorithms…

In this note we outline a new and simple approach to proving central limit theorems for various 'global' graph parameters which have robust 'local' approximations, using the Efron--Stein inequality, which relies on a combinatorial analysis…

We consider a class of jump processes in euclidean space which are associated to a certain non-local symmetric Dirichlet form. We prove a lower bound on the occupation times of sets, and that a support theorem holds for these processes.

We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…

In this paper, employing the weak convergence method, based on a variational representation for expected values of positive functionals of a Brownian motion, we investigate moderate deviation %(CLT for abbreviation) for a class of…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Let $(\tau_n)$ be a sequence of toral automorphisms $\tau_n : x \rightarrow A_n x \hbox{mod}\ZZ^d$ with $A_n \in {\cal A}$, where ${\cal A}$ is a finite set of matrices in $SL(d, \mathbb{Z})$. Under some conditions the method of…

An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…

Euler integrals of deterministic functions have recently been shown to have a wide variety of possible applications, including in signal processing, data aggregation and network sensing. Adding random noise to these scenarios, as is natural…

Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.

We study sums of locally dependent scores associated with general marked (i.e., labeled) Euclidean point processes. We introduce geometric mixing conditions on the underlying point process and a Lipschitz-"localization" condition on the…