Related Experiment Video
Updated: Jun 23, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
Kinetic Network in Milestoning: Clustering, Reduction, and Transition Path Analysis.
Ru Wang1, Xiaojun Ji2,3, Hao Wang1
1Qingdao Institute for Theoretical and Computational Sciences, School of Chemistry and Chemical Engineering, Shandong University, Qingdao, Shandong 266237, P. R. China.
We developed a new algorithm to simplify complex Milestoning kinetic networks. This method reduces dimensionality while retaining crucial kinetic data for analyzing molecular dynamics and pathways.
Area of Science:
- Computational Chemistry
- Statistical Mechanics
- Chemical Kinetics
Background:
- Milestoning is a powerful method for analyzing complex chemical systems.
- High-dimensional Milestoning networks can be computationally intensive and difficult to interpret.
- Extracting essential kinetic information from these networks is crucial for understanding molecular dynamics.
Purpose of the Study:
- To present a novel algorithm for reducing high-dimensional Milestoning networks.
- To preserve key kinetic properties like residence and passage times during reduction.
- To enable efficient analysis of transition pathways in complex systems.
Main Methods:
- The reduction of the Milestoning (ReM) algorithm involves three main steps.
- Nodes (milestones) are clustered based on metastability using an auxiliary continuous-time Markov chain.
- A reduced network is formed by transforming the clustered network, followed by transition pathway analysis using transition path theory.
Main Results:
- The ReM algorithm successfully reduces the dimensionality of Milestoning networks.
- Essential kinetic information, including local residence time, exit time, and mean first passage time, is preserved.
- The method was validated on a toy model and a solvated alanine dipeptide system.
Conclusions:
- The ReM algorithm offers an efficient approach to analyze high-dimensional Milestoning kinetic networks.
- This reduction technique simplifies complex systems while retaining critical kinetic insights.
- The method is applicable to both time-reversible and non-time-reversible networks from simulations.
More Related Videos
07:28JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
Published on: October 19, 2021
06:55Kinematic History of a Salient-recess Junction Explored through a Combined Approach of Field Data and Analog Sandbox Modeling
Published on: August 5, 2016
Related Concept Videos
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Manipulation and Analysis
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...
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...