1-dependent stationary sequences for some given joint distributions of two consecutive random variables

DOI10.1007/S11009-011-9234-YMaRDI QIDQ1930604zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

longest success run1-dependent sequencesmean and variance of number of words

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

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

Cites work

• An algebraic construction of a class of one-dependent processes
• Combining \(m\)-dependence with Markovness
• DNA, words and models. Statistics of exceptional words. Translated from the 2003 French original
• First passage time for some stationary processes
• Longest runs in a sequence of \(m\)-dependent random variables
• On 1-dependent processes and k-block factors
• On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials
• On the length of the longest run in a multi-state Markov chain.
• On the structure of 1-dependent Markov chains
• Periods in strings
• Runs and scans with applications

Cited in

(1)

• One dimensional scan statistics generated by some dependent stationary sequences

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)