Runs in m-dependent sequences
From MaRDI portal
Publication:797228
DOI10.1214/AOP/1176993229zbMATH Open0545.60080OpenAlexW1965064856MaRDI QIDQ797228FDOQ797228
Authors: Svante Janson 
Publication date: 1984
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176993229
Recommendations
- Runs in continuous-valued sequences
- On runs in independent sequences
- Runs in Markov sequences
- Runs in an ordered sequence of random variables
- A further note on runs in independent sequences
- Runs in a Bivariate Sequence Over the First Coordinate
- Longest runs in a sequence of \(m\)-dependent random variables
- scientific article; zbMATH DE number 177034
- Extension of runs to the continuous-valued sequences
Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Special processes (60K99) Stochastic processes (60G99) Renewal theory (60K05)
Cited In (14)
- One-dependent colorings of the star graph
- Mallows permutations and finite dependence
- Runs in a Bivariate Sequence Over the First Coordinate
- Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma
- How long until a random sequence decreases?
- Asymptotic normality of the number of non-appeared values in random \(m\)-dependent sequences
- 1-dependent stationary sequences for some given joint distributions of two consecutive random variables
- Asymptotic normality of numbers of non-occurring values of \(m\)-dependent random variables
- Long paths and connectivity in 1-independent random graphs
- One example of \(m\)-dependent vector's sequence
- One-dependent trigonometric determinantal processes are two-block-factors
- A non-clustering property of stationary sequences
- Runs in an ordered sequence of random variables
- Finitely dependent coloring
This page was built for publication: Runs in m-dependent sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797228)
