Efficient exploration of discrete energy landscapes
arXiv:0910.2559 · doi:10.1103/PhysRevE.83.011113
Abstract
Many physical and chemical processes, such as folding of biopolymers, are best described as dynamics on large combinatorial energy landscapes. A concise approximate description of dynamics is obtained by partitioning the micro-states of the landscape into macro-states. Since most landscapes of interest are not tractable analytically, the probabilities of transitions between macro-states need to be extracted numerically from the microscopic ones, typically by full enumeration of the state space. Here we propose to approximate transition probabilities by a Markov chain Monte-Carlo method. For landscapes of the number partitioning problem and an RNA switch molecule we show that the method allows for accurate probability estimates with significantly reduced computational cost.
arXiv comment7 pages, 5 figures
References in corpus (13)
- Exploring the Free Energy Landscape: From Dynamics to Networks and Back
- Prediction and statistics of pseudoknots in RNA structures using exactly clustered stochastic simulations
- A physicist's approach to number partitioning
- Probabilistic Analysis of the Number Partitioning Problem
- Energy landscapes, supergraphs, and "folding funnels" in spin systems
- The lid method for exhaustive exploration of metastable states of complex systems
- Properties of the energy landscape of network models for covalent glasses
- From simple to complex networks: inherent structures, barriers and valleys in the context of spin glasses
- Phase transition and landscape statistics of the number partitioning problem
- Funnels in Energy Landscapes
- A graph theoretical analysis of the energy landscape of model polymers
- Stochastic dynamics of model proteins on a directed graph
- Hidden Structure in Protein Energy Landscapes