A probabilistic algorithm for aggregating vastly undersampled large Markov chains (Q2115692): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.physd.2020.132799 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.PHYSD.2020.132799 / rank | |||
Normal rank | |||
Latest revision as of 02:53, 17 December 2024
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
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
