Inferring transition rates on networks with incomplete knowledge
Purushottam D. Dixit, Abhinav Jain, Gerhard Stock, Ken. A., Dill

TL;DR
This paper introduces a method based on Maximum Caliber to infer transition rates in networks using limited stationary and dynamical data, accurately predicting rates in biochemical and molecular systems.
Contribution
It presents a novel approach to estimate transition rates by maximizing path entropy constrained by known steady-state and dynamical averages, including a square-root rate dependence.
Findings
Accurately predicts biochemical gene network transition rates.
Successfully estimates peptide conformational transition rates.
Method applies to large networks with limited data.
Abstract
Across many fields, a problem of interest is to predict the transition rates between nodes of a network, given limited stationary state and dynamical information. We give a solution using the principle of Maximum Caliber. We find the transition rate matrix by maximizing the path entropy of a random walker on the network constrained to reproducing a stationary distribution and a few dynamical averages. A main finding here is that when constrained only by the mean jump rate, the rate matrix is given by a square-root dependence of the rate, , on and , the stationary state populations at nodes a and b. We give two examples of our approach. First, we show that this method correctly predicts the correlated rates in a biochemical network of two genes, where we know the exact results from prior simulation. Second, we show that it correctly predicts…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene Regulatory Network Analysis · Protein Structure and Dynamics · Neural dynamics and brain function
