Markov Chain Partitioning via Spectral Features and Weighted k-Means
A new algorithm partitions Markov chains using P² spectral eigenvectors and weighted k-means. It ultimately selects the optimal partition by scoring candidates based on their Frobenius norm distance to the stationary state.
2026-07-22 ~ 2026-07-22 · 2 related posts
- Spectral clustering method groups Markov chains via P² eigenvectors and weighted k-means — michaelchchoi · 2026-07-22
- Best partition is scored by stationarity distance to yield a faster Markov chain — michaelchchoi · 2026-07-22