Limiting behavior of a process of runs
From MaRDI portal
Publication:1149164
DOI10.1214/aop/1176994512zbMath0453.60017OpenAlexW2027404923MaRDI QIDQ1149164
Publication date: 1981
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176994512
mixing propertyindependent identically distributed random variablesrunsergodic processconvergence to Poisson processthe longest run distribution
Central limit and other weak theorems (60F05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)
Related Items
Compound Poisson approximation: A user's guide ⋮ On growing random binary trees ⋮ On asymptotics of the maximal gain without losses. ⋮ Longest runs in a sequence of \(m\)-dependent random variables ⋮ COMPOUND POISSON APPROXIMATION OF THE NUMBER DISTRIBUTION FOR MONOTONE STRINGS OF FIXED LENGTH IN A RANDOM SEQUENCE ⋮ On the Most Probable Shape of a Search Tree Grown from a Random Permutation ⋮ On the strong law of large numbers for sums over increasing runs ⋮ Poisson approximation for the number of non-decreasing runs in Markov chains ⋮ On the length of the longest increasing run in \(\mathbb{R}^d\) ⋮ Poisson approximation ⋮ Three problems on the lengths of increasing runs ⋮ Strong laws for the maximal gain over increasing runs