相关论文: A local limit theorem with speed of convergence fo…
We prove a local limit theorem for the Euclidian algorithms ; standard, centred and odd, with any cost function of moderate growth.
This study provides new results about the probabilistic behaviour of a class of Euclidean algorithms: the asymptotic distribution of a whole class of cost-parameters associated to these algorithms is normal. For the cost corresponding to…
The present paper establishes upper and lower bounds on the speed of approximation in a wide range of natural Diophantine approximation problems. The upper and lower bounds coincide in many cases, giving rise to optimal results in…
We investigate the average minimum cost of a bipartite matching between two samples of n independent random points uniformly distributed on a unit cube in d $\ge$ 3 dimensions, where the matching cost between two points is given by any…
It is a classical observation that lacunary function systems exhibit many properties which are typical for systems of independent random variables. However, it had already been observed by Erd\H{o}s and Fortet in the 1950s that probability…
Limit laws for ergodic averages with a power singularity over circle rotations were first proved by Sinai and Ulcigrai, as well as Dolgopyat and Fayad. In this paper, we prove limit laws with an estimate for the rate of convergence for the…
In this paper, we propose a novel solution for the distributed unconstrained optimization problem where the total cost is the summation of time-varying local cost functions of a group networked agents. The objective is to track the optimal…
We consider the random Euclidean assignment problem on the line between two sets of $N$ random points, independently generated with the same probability density function $\varrho$. The cost of the matching is supposed to be dependent on a…
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.…
The distributional analysis of Euclidean algorithms was carried out by Baladi and Vall\'{e}e. They showed the asymptotic normality of the number of division steps and associated costs in the Euclidean algorithm as a random variable on the…
We study the distributed optimization problem over a graphon with a continuum of nodes, which is regarded as the limit of the distributed networked optimization as the number of nodes goes to infinity. Each node has a private local cost…
The main results of this paper are to prove bounds for ergodic averages for nilflows on general higher step nilmanifolds. Under Diophantine condition on the frequency of a toral projection of the flow, we prove that almost all orbits become…
We prove a new lower bound for the exponent of growth of the best two-dimensional Diophantine approximations with respect to Euclidean norm.
Using the circle method in combination with lattice point counting arguments, we show that for almost all homogeneous diophantine equations of additive type and degree $k$ in more than $4k$ variables, the Local-Global principle holds true.…
We propose a fault-tolerant quantum computation scheme that is broadly applicable to quantum low-density parity-check (qLDPC) codes. The scheme achieves constant qubit overhead and a time overhead of $O(d^{a+o(1)})$ for any $[[n,k,d]]$…
We propose a distributed solution for a constrained convex optimization problem over a network of clustered agents each consisted of a set of subagents. The communication range of the clustered agents is such that they can form a connected…
We present a rather general method for proving local limit theorems, with a good rate of convergence, for sums of dependent random variables. The method is applicable when a Stein coupling can be exhibited. Our approach involves both…
In this paper we study numerical approximations of the evolution problem for the nonlocal $p$-Laplacian with homogeneous Neumann boundary conditions. First, we derive a bound on the distance between two continuous-in-time trajectories…
This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. We establish the…
We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses the LLL-algorithm for lattice basis reduction. We present a version of the…