A probabilistic algorithm for aggregating vastly undersampled large Markov chains
From MaRDI portal
Publication:2115692
DOI10.1016/j.physd.2020.132799OpenAlexW3105261954MaRDI QIDQ2115692
Christof Schütte, Andreas Bittracher
Publication date: 21 March 2022
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physd.2020.132799
Related Items
Optimal Reaction Coordinates: Variational Characterization and Sparse Computation, Large population limits of Markov processes on random networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification
- A robust spectral method for finding lumpings and meta stable states of non-reversible Markov chains
- An SVD approach to identifying metastable states of Markov chains
- A direct approach to conformational dynamics based on hybrid Monte Carlo
- A new aggregation-disaggregation algorithm
- Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
- Transition manifolds of complex metastable systems. Theory and data-driven computation of effective dynamics
- Statistically optimal almost-invariant sets
- Robust Perron cluster analysis in conformation dynamics
- Perturbation theory for linear operators.
- Finite approximations of Markov operators
- Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification
- On weak lumpability in Markov chains
- Smoothed Aggregation Multigrid for Markov Chains
- Probability Distance Based Compression of Hidden Markov Models
- Randomized Algorithms for Matrices and Data
- Recursively Accelerated Multilevel Aggregation for Markov Chains
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- A Reduction Process for Perturbed Markov Chains
- A Compression Algorithm for Probability Transition Matrices
- On the Approximation of Complicated Dynamical Behavior
- Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains
- Near-Decomposability, Partition and Aggregation, and the Relevance of Stability Discussions
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
