Search

Large continuous-time Markov chains with exponentially small transition rates arise in modeling complex systems in physics, chemistry and biology. We propose a constructive graph-algorithmic approach to determine the sequence of critical timescales at which the qualitative behavior of a given Markov chain changes, and give an effective description of the dynamics on each of them. This approach is valid for both time-reversible and time-irreversible Markov processes, with or without symmetry. Central to this approach are two graph algorithms, Algorithm 1 and Algorithm 2, for obtaining the sequences of the critical timescales and the hierarchies of Typical Transition Graphs or T-graphs indicating the most likely transitions in the system {without and with} symmetry respectively. The sequence of {critical} timescales includes the subsequence of the reciprocals { of the real parts } of eigenvalues. Under a certain assumption, we prove sharp asymptotic estimates for eigenvalues (including prefactors) and show how one can extract them from the output of Algorithm 1. We discuss the relationship between Algorithms 1 and 2, and explain how one needs to interpret the output of Algorithm 1 if it is applied in the case with symmetry instead of Algorithm 2. Finally, we analyze an example motivated by R. D. Astumian's model of the dynamics of kinesin, a molecular motor, by means of Algorithm 2., Comment: 46 pages, 17 figures

We consider stochastic networks with pairwise transition rates of the exponential form where the temperature T is a small parameter. Such networks arise in physics and chemistry and serve as mathematically tractable models of complex systems. Typically, such networks contain large numbers of states and widely varying pairwise transition rates. We present a methodology for spectral analysis and clustering of such networks that takes advance of the small parameter T and consists of two steps: (1) computing zero-temperature asymptotics for eigenvalues and the collection of quasi-invariant sets, and (2) finite temperature continuation. Step (1) is re- ducible to a sequence of optimization problems on graphs. A novel single-sweep algorithm for solving them is introduced. Its mathematical justification is provided. This algorithm is valid for both time-reversible and time-irreversible networks. For time-reversible networks, a finite temperature continuation technique combining lumping and truncation with Rayleigh quotient iteration is developed. The proposed methodology is applied to the network representing the energy landscape of the Lennard-Jones-75 cluster containing 169,523 states and 226,377 edges. The transition process between its two major funnels, is analyzed. The corresponding eigenvalue is shown to have a kink at the solid-solid phase transition temperature., Comment: 33 pages, 16 figures