Skip to main navigation Skip to search Skip to main content

Inferring transition rates of networks from populations in continuous-time Markov processes

  • Purushottam D. Dixit
  • , Abhinav Jain
  • , Gerhard Stock
  • , Ken A. Dill
  • Columbia University
  • University of Freiburg

Research output: Contribution to journalArticlepeer-review

60 Scopus citations

Abstract

We are interested inferring rate processes on networks. In particular, given a network's topology, the stationary populations on its nodes, and a few global dynamical observables, can we infer all the transition rates between nodes? We draw inferences using the principle of maximum caliber (maximum path entropy). We have previously derived results for discrete-time Markov processes. Here, we treat continuous-time processes, such as dynamics among metastable states of proteins. The present work leads to a particularly important analytical result: namely, that when the network is constrained only by a mean jump rate, the rate matrix is given by a square-root dependence of the rate, kab ∞ (πba)1/2, on πa and πb, the stationary-state populations at nodes a and b. This leads to a fast way to estimate all of the microscopic rates in the system. As an illustration, we show that the method accurately predicts the nonequilibrium transition rates in an in silico gene expression network and transition probabilities among the metastable states of a small peptide at equilibrium. We note also that the method makes sensible predictions for so-called extra-thermodynamic relationships, such as those of Bronsted, Hammond, and others.

Original languageEnglish
Pages (from-to)5464-5472
Number of pages9
JournalJournal of Chemical Theory and Computation
Volume11
Issue number11
DOIs
StatePublished - Nov 10 2015

Fingerprint

Dive into the research topics of 'Inferring transition rates of networks from populations in continuous-time Markov processes'. Together they form a unique fingerprint.

Cite this