Finds an approximate partition by clustering the leading right eigenvectors of the transition matrix, then returns the forced lumping over that partition. This is a heuristic for approximate lumping/metastable aggregation, not a proof of exact lumpability.
autoLump(object, k)# S4 method for markovchain
autoLump(object, k)
A list with partition and lumped_chain.
A markovchain object.
Number of macro-states to discover.