Approximation of sojourn-times via maximal couplings: motif frequency distributions (Q2510394)

From MaRDI portal
Revision as of 01:29, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q51206270, #quickstatements; #temporary_batch_1712272666262)
scientific article
Language Label Description Also known as
English
Approximation of sojourn-times via maximal couplings: motif frequency distributions
scientific article

    Statements

    Approximation of sojourn-times via maximal couplings: motif frequency distributions (English)
    0 references
    0 references
    0 references
    1 August 2014
    0 references
    Markov chains in Polish state spaces \(S\), which encompass discrete state spaces, are considered. Given a measurable set \(T \in S\), a sojourn time \(T_n\) is a random number of times a Markov chain visits \(T\) in its \(n\) first transitions. For relatively small values of \(n\), distributions of \(T_n\) can be obtained explicitly using generating functions. If \(n\) is large enough, then normal approximation or compound Poisson approximation are used to describe distributions of \(T_n\). In this article, approximations to sojourn-time distributions in Harris recurrent Markov chains are applied to such \(n\) that are too long for exact calculations, but too short to rely on normal or compound Poisson approximations. Distributions of \(T_n\) are approximated for \(n\) of order \((1-\alpha)^{-m}\), where \(m\) is the largest integer for which the exact distribution of \(T_m\) is accessible and \(0 \leq \alpha \leq 1\) is an ergodicity coefficient associated with the probability transition kernel of the chain.
    0 references
    Markov chains
    0 references
    sojourn time
    0 references
    ergodicity coefficients
    0 references
    non-asymptotic approximations of distributions
    0 references
    genomic sequence analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references