Nonparametric Multi Change Point Detection for Markov Chains via Adaptive Clustering
A non-parametric clustering algorithm which can accurately obtain the change points from a given Markovian dataset of length $n$ is proposed by bridging together two different components of mathematical statistics; Rademacher complexities of Markov chains, and adaptive clustering via penalisation.