A probabilistic algorithm for aggregating vastly undersampled large Markov chains (Q2115692)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A probabilistic algorithm for aggregating vastly undersampled large Markov chains |
scientific article; zbMATH DE number 7493971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic algorithm for aggregating vastly undersampled large Markov chains |
scientific article; zbMATH DE number 7493971 |
Statements
A probabilistic algorithm for aggregating vastly undersampled large Markov chains (English)
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
