Related papers: Un theoreme de la limite locale pour des algorithm…
Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the…
Given a data set of size $n$ in $d'$-dimensional Euclidean space, the $k$-means problem asks for a set of $k$ points (called centers) so that the sum of the $\ell_2^2$-distances between points of a given data set of size $n$ and the set of…
In this paper, we present the asymptotic theory for integrated functions of increments of Brownian local times in space. Specifically, we determine their first-order limit, along with the asymptotic distribution of the fluctuations. Our key…
In the (continuous) Euclidean $k$-center problem, given $n$ points in $\mathbb{R}^d$ and an integer $k$, the goal is to find $k$ center points in $\mathbb{R}^d$ that minimize the maximum Euclidean distance from any input point to its…
We prove a standard Central Limit Theorem for the (normalized) number of triangles in a class of Exponential Random Graphs derived from a slight modification of the edge-triangle model. Our main theorem covers the whole analyticity region…
Common definitions of the "standard" LOCAL model tend to be sloppy and even self-contradictory on one point: do the nodes update their state using an arbitrary function or a computable function? So far, this distinction has been safe to…
We discuss non-Euclidean deterministic and stochastic algorithms for optimization problems with strongly and uniformly convex objectives. We provide accuracy bounds for the performance of these algorithms and design methods which are…
In this paper we study the convergence in distribution and the local limit theorem for the partial sums of linear random fields with i.i.d. innovations that have infinite second moment and belong to the domain of attraction of a stable law…
Optimization algorithms can see their local convergence rates deteriorate when the Hessian at the optimum is singular. These singularities are inescapable when the optima are non-isolated. Yet, under the right circumstances, several…
We prove the equivalence between the integral central limit theorem and the local central limit theorem for two-body potentials with long-range interactions on the lattice $\mathbb{Z}^d$ for $d\ge 1$. The spin space can be an arbitrary,…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
This paper proves several weak limit theorems for the joint version of extreme order statistics and partial sums of independently and identically distributed random variables. The results are also extended to almost sure limit version.
We establish the (non-lattice) local limit theorem for products of i.i.d. random variables on an arbitrary simply connected nilpotent Lie group $G$, where the variables are allowed to be non-centered. Our result also improves on the known…
In this work, we study the $k$-means cost function. Given a dataset $X \subseteq \mathbb{R}^d$ and an integer $k$, the goal of the Euclidean $k$-means problem is to find a set of $k$ centers $C \subseteq \mathbb{R}^d$ such that $\Phi(C, X)…
Recently a new type of central limit theorem for belief functions was given in Epstein et al. [9]. In this paper, we generalize the central limit theorem in Epstein et al. [9] to accommodate general bounded random variables. These results…
We establish some limit theorems for quasi-arithmetic means of random variables. This class of means contains the arithmetic, geometric and harmonic means. Our feature is that the generators of quasi-arithmetic means are allowed to be…
Some limit theorems are proven for the linear oscillator with random coefficients. The asymptotic behaviour of the moments is studied in detail. The technique presented in this paper can be applied to general linear systems with noise and…
We study a symmetric diffusion $X$ on $\mathbb{R}^d$ in divergence form in a stationary and ergodic environment, with measurable unbounded and degenerate coefficients. We prove a quenched local central limit theorem for $X$, under some…
We give a central limit theorem, which has applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced generalized Polya urns.
We consider the problem of constructing small coresets for $k$-Median in Euclidean spaces. Given a large set of data points $P\subset \mathbb{R}^d$, a coreset is a much smaller set $S\subset \mathbb{R}^d$, so that the $k$-Median costs of…