Related papers: Metastable convergence theorems

In this paper we prove pointwise and distributional Fourier transform inversion theorems for functions on the real line that are locally of bounded variation, while in a neighbourhood of infinity are Lebesgue integrable or have polynomial…

We generalize a theorem of Bellow and Calder\'on concerning the a.e. convergence of the convolution powers $\ds \mu^nf(x)=\sum_{k}\mu^n(k)f(T^k x)$ where $T$ is a measure preserving transformation of a probability space and $\mu$ is a…

Apart from few exceptions, the mathematical runtime analysis of evolutionary algorithms is mostly concerned with expected runtimes. In this work, we argue that stochastic domination is a notion that should be used more frequently in this…

Let $\big(M_k, Q_k\big)_{k\in\mathbb{N}}$ be independent copies of an $\mathbb{R}^2$-valued random vector. It is known that if $Y_n:=Q_1+M_1Q_2+...+M_1\cdot...\cdot M_{n-1}Q_n$ converges a.s. to a random variable $Y$, then the law of $Y$…

We reformulate and generalize the uniqueness and existence proofs of time-dependent density-functional theory. The central idea is to restate the fundamental one-to-one correspondence between densities and potentials as a global fixed point…

A landmark theorem in the metric theory of continued fractions begins this way: Select a non-negative real function $f$ defined on the positive integers and a real number $x$, and form the partial sums $s_n$ of $f$ evaluated at the partial…

We derive theorems which outline explicit mechanisms by which anomalous scaling for the probability density function of the sum of many correlated random variables asymptotically prevails. The results characterize general anomalous scaling…

We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…

Eagleson's Theorem asserts that, given a probability-preserving map, ifrenormalized Birkhoff sums of a function converge in distribution, thenthey also converge with respect to any probability measure which isabsolutely continuous with…

We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…

Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of random variables. These results are intimately related to…

This paper develops a characterisation of when solutions of forced second order linear differential equations converge to the zero solution of the asymptotically stable and unforced second order equation, or when the solution is bounded,…

If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…

We consider a large class of piecewise expanding maps T of [0,1] with a neutral fixed point, and their associated Markov chain Y_i whose transition kernel is the Perron-Frobenius operator of T with respect to the absolutely continuous…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

We give a quantitative analysis of a theorem due to Fenghui Wang and Huanhuan Cui concerning the convergence of a multi-parametric version of the proximal point algorithm. Wang and Cui's result ensures the convergence of the algorithm to a…

We provide quantitative information in the form of a rate of metastability in the sense of T. Tao and (under a metric regularity assumption) a rate of convergence for an algorithm approximating zeros of differences of maximally monotone…

We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes a large class of martingales: As a corollary of our main…

Kossovsky recently conjectured that the distribution of leading digits of a chain of probability distributions converges to Benford's law as the length of the chain grows. We prove his conjecture in many cases, and provide an interpretation…

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…