A Mathematical Theory of Optimal Milestoning (with a Detour via Exact Milestoning)

Ling Lin, Jianfeng Lu, Eric Vanden Eijnden

Research output: Contribution to journalArticle

Abstract

Milestoning is a computational procedure that reduces the dynamics of complex systems to memoryless jumps between intermediates, or milestones, and only retains some information about the probability of these jumps and the time lags between them. Here we analyze a variant of this procedure, termed optimal milestoning, which relies on a specific choice of milestones to capture exactly some kinetic features of the original dynamical system. In particular, we prove that optimal milestoning permits the exact calculation of the mean first passage times (MFPT) between any two milestones. In so doing, we also analyze another variant of the method, called exact milestoning, which also permits the exact calculation of certain MFPTs, but at the price of retaining more information about the original system's dynamics. Finally, we discuss importance sampling strategies based on optimal and exact milestoning that can be used to bypass the simulation of the original system when estimating the statistical quantities used in these methods.

Original languageEnglish (US)
JournalCommunications on Pure and Applied Mathematics
DOIs
StateAccepted/In press - 2017

Fingerprint

Dynamical systems
Importance sampling
Jump
Large scale systems
Mean First Passage Time
Sampling Strategy
Time Lag
Exact Method
Importance Sampling
System Dynamics
Kinetics
Complex Systems
Dynamical system
Simulation

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

@article{696dff5542d34d18a8a2e353ffcdb25d,
title = "A Mathematical Theory of Optimal Milestoning (with a Detour via Exact Milestoning)",
abstract = "Milestoning is a computational procedure that reduces the dynamics of complex systems to memoryless jumps between intermediates, or milestones, and only retains some information about the probability of these jumps and the time lags between them. Here we analyze a variant of this procedure, termed optimal milestoning, which relies on a specific choice of milestones to capture exactly some kinetic features of the original dynamical system. In particular, we prove that optimal milestoning permits the exact calculation of the mean first passage times (MFPT) between any two milestones. In so doing, we also analyze another variant of the method, called exact milestoning, which also permits the exact calculation of certain MFPTs, but at the price of retaining more information about the original system's dynamics. Finally, we discuss importance sampling strategies based on optimal and exact milestoning that can be used to bypass the simulation of the original system when estimating the statistical quantities used in these methods.",
author = "Ling Lin and Jianfeng Lu and {Vanden Eijnden}, Eric",
year = "2017",
doi = "10.1002/cpa.21725",
language = "English (US)",
journal = "Communications on Pure and Applied Mathematics",
issn = "0010-3640",
publisher = "Wiley-Liss Inc.",

}

TY - JOUR

T1 - A Mathematical Theory of Optimal Milestoning (with a Detour via Exact Milestoning)

AU - Lin, Ling

AU - Lu, Jianfeng

AU - Vanden Eijnden, Eric

PY - 2017

Y1 - 2017

N2 - Milestoning is a computational procedure that reduces the dynamics of complex systems to memoryless jumps between intermediates, or milestones, and only retains some information about the probability of these jumps and the time lags between them. Here we analyze a variant of this procedure, termed optimal milestoning, which relies on a specific choice of milestones to capture exactly some kinetic features of the original dynamical system. In particular, we prove that optimal milestoning permits the exact calculation of the mean first passage times (MFPT) between any two milestones. In so doing, we also analyze another variant of the method, called exact milestoning, which also permits the exact calculation of certain MFPTs, but at the price of retaining more information about the original system's dynamics. Finally, we discuss importance sampling strategies based on optimal and exact milestoning that can be used to bypass the simulation of the original system when estimating the statistical quantities used in these methods.

AB - Milestoning is a computational procedure that reduces the dynamics of complex systems to memoryless jumps between intermediates, or milestones, and only retains some information about the probability of these jumps and the time lags between them. Here we analyze a variant of this procedure, termed optimal milestoning, which relies on a specific choice of milestones to capture exactly some kinetic features of the original dynamical system. In particular, we prove that optimal milestoning permits the exact calculation of the mean first passage times (MFPT) between any two milestones. In so doing, we also analyze another variant of the method, called exact milestoning, which also permits the exact calculation of certain MFPTs, but at the price of retaining more information about the original system's dynamics. Finally, we discuss importance sampling strategies based on optimal and exact milestoning that can be used to bypass the simulation of the original system when estimating the statistical quantities used in these methods.

UR - http://www.scopus.com/inward/record.url?scp=85019234701&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85019234701&partnerID=8YFLogxK

U2 - 10.1002/cpa.21725

DO - 10.1002/cpa.21725

M3 - Article

JO - Communications on Pure and Applied Mathematics

JF - Communications on Pure and Applied Mathematics

SN - 0010-3640

ER -