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

DOI10.1007/s11009-011-9234-yzbMath1259.60015OpenAlexW4233025134MaRDI QIDQ1930604

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)

Related Items (1)

One dimensional scan statistics generated by some dependent stationary sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Periods in strings
• Longest runs in a sequence of \(m\)-dependent random variables
• On the structure of 1-dependent Markov chains
• Combining \(m\)-dependence with Markovness
• On 1-dependent processes and \(k\)-block factors
• On the length of the longest run in a multi-state Markov chain.
• First passage time for some stationary processes
• An algebraic construction of a class of one-dependent processes
• On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials

This page was built for publication: 1-dependent stationary sequences for some given joint distributions of two consecutive random variables