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

The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…

A sharp version of the Central Limit Theorem for linear combinations of iterates of an inner function is proved. The authors previously showed this result assuming a suboptimal condition on the coefficients of the linear combination. Here…

We reduce the local limit theorem for a non-compact semisimple Lie group acting on its symmetric space to establishing that a natural operator associated to the measure is quasicompact. Under strong Diophantine assumptions on the underlying…

We investigate the connection between conditional local limit theorems and the local time of integer-valued stationary processes. We show that a conditional local limit theorem (at 0) implies the convergence of local times to Mittag-Leffler…

In this article, we study the pointwise asymptotic behavior of iterated convolutions on the one dimensional lattice Z. We generalize the so-called local limit theorem in probability theory to complex valued sequences. A sharp rate of…

We prove several fundamental statistical bounds for entropic OT with the squared Euclidean cost between subgaussian probability measures in arbitrary dimension. First, through a new sample complexity result we establish the rate of…

This paper investigates a local central limit theorem for a normalized sequence of random variables belonging to a fixed order Wiener chaos and converging to the standard normal distribution. We prove, without imposing any additional…

We show that for every ergodic and aperiodic probability preserving system, there exists a $\mathbb{Z}$ valued, square integrable function $f$ such that the partial sums process of the time series $\left\{f\circ T^i\right\}_{i=0}^\infty$…

Online algorithms make decisions based on past inputs. In general, the decision may depend on the entire history of inputs. If many computers run the same online algorithm with the same input stream but are started at different times, they…

We show a deterministic constant-time local algorithm for constructing an approximately maximum flow and minimum fractional cut in multisource-multitarget networks with bounded degrees and bounded edge capacities. Locality means that the…

We study local search algorithms for metric instances of facility location problems: the uncapacitated facility location problem (UFL), as well as uncapacitated versions of the $k$-median, $k$-center and $k$-means problems. All these…

In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The…

This paper studies distributed continuous-time optimization for time-varying quadratic cost functions with uncertain parameters. We first propose a centralized adaptive optimization algorithm using partial information of the cost function.…

Let $(X_i,i\geq 1)$ be a sequence of i.i.d. random variables with values in $[0,1]$, and $f$ be a function such that $`E(f(X_1)^2)<+\infty$. We show a functional central limit theorem for the process $t\mapsto \sum_{i=1}^n f(X_i)1_{X_i\leq…

We develop adaptive discretization algorithms for locally optimal experimental design of nonlinear prediction models. With these algorithms, we refine and improve a pertinent state-of-the-art algorithm in various respects. We establish…

We show that any function can be locally approximated by solutions of prescribed linear equations of nonlocal type. In particular, we show that every function is locally $s$-caloric, up to a small error. The case of non-elliptic and…

In view of the importance of quantum non-locality in cryptography, quantum computation and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not. In the light of a theorem by Pitowski, it…

We establish the upper bound on the speed of convergence to the infinitely divisible limit density in the local limit theorem for triangular arrays of random variables $\{X_{k,n},\, k=1,..,a_n, \, n\in \nat\}$.

We consider the problem of optimal transportation with quadratic cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We provide new results on the uniqueness and stability of the associated optimal…

The purpose of the present paper is to establish explicit bounds on moderate deviation probabilities for a rather general class of geometric functionals enjoying the stabilization property, under Poisson input and the assumption of a…