Related Experiment Video
Updated: Aug 2, 2025

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
Published on: December 10, 2012
Adaptive power method for estimating large deviations in Markov chains
Francesco Coghi1, Hugo Touchette2
1Nordita, KTH Royal Institute of Technology and Stockholm University, Stockholm, Sweden.
We present an adaptive power method for learning large deviation functions in nonequilibrium systems. This stochastic algorithm efficiently analyzes dynamical phase transitions in Markov processes, outperforming existing methods.
Area of Science:
- Statistical Physics
- Nonequilibrium Systems
- Stochastic Processes
Background:
- Large deviation functions characterize fluctuations in physical systems, particularly nonequilibrium processes.
- Stochastic algorithms, like the power method, are adapted for analyzing Markov processes and diffusions.
- Previous work introduced an adaptive power method for risk-sensitive control and continuous-time diffusions.
Purpose of the Study:
- To conduct an in-depth performance analysis of an adaptive power method for learning large deviation functions.
- To investigate the algorithm's convergence near dynamical phase transitions.
- To evaluate the impact of learning rate and transfer learning on convergence speed.
Main Methods:
- Application of a stochastic algorithm based on the power method.
- Adaptive learning of large deviation functions for Markov processes.
- Analysis of convergence rates and the effect of transfer learning.
- Testing the algorithm on a random walk's mean degree on an Erdős-Rényi random graph.
Main Results:
- The adaptive power method demonstrates efficiency in analyzing dynamical phase transitions.
- Convergence speed is studied as a function of the learning rate.
- Transfer learning was incorporated and its effects analyzed.
- The method proved effective for distinguishing between high-degree and low-degree trajectories in the test case.
Conclusions:
- The adaptive power method is a performant and complex-efficient tool for computing large deviation functions.
- The algorithm excels in analyzing systems near dynamical phase transitions.
- It offers advantages over existing algorithms for studying fluctuations in Markov processes.
Related Concept Videos
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Estimating Population Mean with Unknown Standard Deviation
William S. Gosset (1876–1937) of the...
Estimating Population Mean with Known Standard Deviation
The confidence interval estimate will have the form as follows:
(point estimate - error bound, point estimate +...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Noncompartmental Analysis: Statistical Moment Theory
Estimating Population Standard Deviation

