A probabilistic algorithm for aggregating vastly undersampled large Markov chains (Q2115692)

From MaRDI portal
Revision as of 02:53, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A probabilistic algorithm for aggregating vastly undersampled large Markov chains
scientific article

    Statements

    A probabilistic algorithm for aggregating vastly undersampled large Markov chains (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2022
    0 references
    Markov chain
    0 references
    aggregation
    0 references
    sparse sampling
    0 references
    metastability
    0 references
    randomized algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers