1-dependent stationary sequences for some given joint distributions of two consecutive random variables
From MaRDI portal
Publication:1930604
DOI10.1007/S11009-011-9234-YzbMATH Open1259.60015OpenAlexW4233025134MaRDI QIDQ1930604FDOQ1930604
Authors: George Haiman 
Publication date: 11 January 2013
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-011-9234-y
Recommendations
- Runs in m-dependent sequences
- A further note on runs in independent sequences
- Longest runs in a sequence of \(m\)-dependent random variables
- Counts of long aligned word matches among random letter sequences
- The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences
Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Runs and scans with applications
- On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials
- Longest runs in a sequence of \(m\)-dependent random variables
- On the length of the longest run in a multi-state Markov chain.
- First passage time for some stationary processes
- Combining \(m\)-dependence with Markovness
- On 1-dependent processes and \(k\)-block factors
- Periods in strings
- An algebraic construction of a class of one-dependent processes
- DNA, words and models. Statistics of exceptional words. Translated from the 2003 French original
- On the structure of 1-dependent Markov chains
Cited In (1)
This page was built for publication: 1-dependent stationary sequences for some given joint distributions of two consecutive random variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930604)
