相关论文: Un theoreme de la limite locale pour des algorithm…

A mid-point theorem is proved in an elementary way for the U type shape of functions that arise out of exponential quadratic functions. These results are inspired from epidemic patterns and growth over a time period. Key words: natural…

The Robbins-Monro algorithm is a recursive, simulation-based stochastic procedure to approximate the zeros of a function that can be written as an expectation. It is known that under some technical assumptions, a Gaussian convergence can be…

Given a probability measure on a finitely generated group, the local limit problem consists in finding asymptotics of $p_n(e,e)$, the probability that the random walk at time $n$ is at the origin. We give the classification of all possible…

For input $x$, let $F(x)$ denote the set of outputs that are the "legal" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of…

The study on the partial differential equations (systems) in the graph setting is a hot topic in recent years because of their applications to image processing and data clustering. Our motivation is to develop some existence results for…

We show how a central limit theorem for Poisson model random polygons implies a central limit theorem for uniform model random polygons. To prove this implication, it suffices to show that in the two models, the variables in question have…

We consider a sequence of Markov chains weakly convergent to a diffusion. We suppose that a drift term contains a linearly increasing component. The usual parametrix method fails because of this unbounded drift term. We show how to modify…

We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.

In this paper we prove a quantiative local limit theorem for the distribution of the number of triangles in the Erd\H{o}s-Renyi random graph $G(n,p)$, for a fixed $p\in (0,1)$. This proof is an extension of the previous work of Gilmer and…

We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…

We establish abstract local limit theorems for hitting times and return-times of suitable sequences (A_{l}) of asymptotically rare events in ergodic probability preserving dynamical systems, including versions for tuples of consecutive…

We derive a functional central limit theorem (fclt) for normalised sums of a function of the partial sums of independent and identically distributed random variables. In particular, we show, using a technique presented in Huang and Zhang…

We prove quenched versions of a central limit theorem, a large deviations principle as well as a local central limit theorem for expanding on average cocycles. This is achieved by building an appropriate modification of the spectral method…

In this work, we prove three types of results with the strategy that, together, the author believes these should imply the local version of Hilbert's Fifth problem. In a separate development, we construct a nontrivial topology for rings of…

The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even…

We present a new clustering algorithm called k-means-u* which in many cases is able to significantly improve the clusterings found by k-means++, the current de-facto standard for clustering in Euclidean spaces. First we introduce the…

Let $ V_{n} = X_{1,n} + X_{2,n} + \cdots + X_{n,n}$ where $X_{i,n}$ are Bernoulli random variables which take the value $1$ with probability $b(i;n)$. Let $\lambda_{n} = \sum\limits_{i=1}^{n} b(i;n) $, $\lambda = \lim\limits_{n \to \infty}…

We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The objective is to maximise $\omega$ subject to $Ax \le 1$, $Cx \ge \omega 1$, and $x \ge 0$ for nonnegative matrices $A$ and $C$. The…

We find large lower bounds for a certain family of algorithms, and prove that such bounds are limited only by natural computability arguments.

We study the applicability of distributed, local algorithms to 0/1 max-min LPs where the objective is to maximise ${\min_k \sum_v c_{kv} x_v}$ subject to ${\sum_v a_{iv} x_v \le 1}$ for each $i$ and ${x_v \ge 0}$ for each $v$. Here $c_{kv}…