Home Research Download Extreme rearrangement Links

Graph transformation method for calculating waiting times in Markov chains

This work was described in detail in: S. A. Trygubenko and D. J. Wales, `Graph Transformation Method for Calculating Waiting Times in Markov Chains', J. Chem. Phys., 124, 234110 (2006). [JCP Online] [arXiv]

Fortran 95 implementations of the sparse- and dense-optimised graph transformation algorithms discussed in this article are distributed free of charge under the GPL. Please take a copy here.