autoLump: Automatically aggregate a Markov chain by spectral clustering
In markovchain: Easy Handling Discrete Time Markov Chains
autoLump R Documentation
Automatically aggregate a Markov chain by spectral clustering
Description
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.
Usage
autoLump(object, k)
## S4 method for signature 'markovchain'
autoLump(object, k)
Arguments
object
A markovchain object.
k
Number of macro-states to discover.
Value
A list with partition and lumped_chain.
markovchain documentation built on Oct. 10, 2026, 9:07 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| autoLump | R Documentation |
Automatically aggregate a Markov chain by spectral clustering
Description
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.
Usage
autoLump(object, k)
## S4 method for signature 'markovchain'
autoLump(object, k)
Arguments
object |
A |
k |
Number of macro-states to discover. |
Value
A list with partition and lumped_chain.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.