Convergence to stable laws and a local limit theorem for stochastic recursions
نویسندگان
چکیده
منابع مشابه
The Local Limit Theorem: A Historical Perspective
The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...
متن کاملCentral Limit Theorem and convergence to stable laws in Mallows distance
We give a new proof of the classical Central Limit Theorem, in the Mallows (Lr-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality related to this metric. The key is to analyse the case where equality holds. We provide some results concerning rates of convergence. We also consider converge...
متن کاملA Limit Theorem for Stochastic Acceleration
We consider the motion of a particle in a weak mean zero random force field F, which depends on the position, x(t), and the velocity, v(t) = 2(0. The equation of motion is 2(0 = ef(x( t ) , v(t), 0~), where x( ') and v(-) take values in R d, d > 3, and co ranges over some probability space. We show, under suitable mixing and moment conditions on F, that as e--+ 0, v~( t ) v(t/e 2) converges wea...
متن کاملThe fractional Fisher information and the central limit theorem for stable laws
A new information-theoretic approach to the central limit theorem for stable laws is presented. The main novelty is the concept of relative fractional Fisher information, which shares most of the properties of the classical one, included Blachman-Stam type inequalities. These inequalities relate the fractional Fisher information of the sum of n independent random variables to the information co...
متن کاملStochastic Limit Laws for Schedule Makespans
A basic multiprocessor version of the makespan scheduling problem requires that n tasks be scheduled on m identical processors so as to minimize the latest task nishing time. In the standard probability model considered here, the task durations are i.i.d. random variables with a general distribution F having nite mean. Our main objective is to estimate the distribution of the makespan as a func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2010
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm118-2-21