The geometric minimum action method: A least action principle on the space of curves
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Freidlin‐Wentzell theory of large deviations for the description of the effect of small random perturbations on dynamical systems is exploited as a numerical tool. Specifically, a numerical algorithm is proposed to compute the quasi‐potential in the theory, which is the key object to quantify the dynamics on long time scales when the effect of the noise becomes ubiquitous: the equilibrium distribution of the system, the pathways of transition between metastable states and their rate, etc., can all be expressed in terms of the quasi‐potential. We propose an algorithm to compute these quantities called the geometric minimum action method (gMAM), which is a blend of the original minimum action method (MAM) and the string method. It is based on a reformulation of the large deviations action functional on the space of curves that allows one to easily perform the double minimization of the original action required to compute the quasi‐potential. The theoretical background of the gMAM in the context of large deviations theory is discussed in detail, as well as the algorithmic aspects of the method. The gMAM is then illustrated on several examples: a finite‐dimensional system displaying bistability and modeled by a nongradient stochastic ordinary differential equation, an infinite‐dimensional analogue of this system modeled by a stochastic partial differential equation, and an example of a bistable genetic switch modeled by a Markov jump process. © 2007 Wiley Periodicals, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gillespie, D. T. (1976) · Journal of Computational Physics · doi:10.1016/0021-9991(76)90041-3 · Cited by 6,029
Foundations for engineering biology
Endy, D. (2005) · Nature · doi:10.1038/nature04342 · Cited by 1,511 · cited 1×
“With DNA sequencing and synthesis becoming both cheaper and more reliable, one is now able to read out and study DNA sequences of existing organisms, manipulate and reassemble them in the computer at will, and finally synthesize them and introduce them into living cells [10].”
BackgroundThe Hill equation revisited: uses and misuses
Weiss, J. N. (1997) · The FASEB Journal · doi:10.1096/fasebj.11.11.9285481 · Cited by 1,000
Cited by
Transition state characteristics during cell differentiation
Brackston, R. D., Lakatos, E., & Stumpf, M. P. H. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006405 · Cited by 67
Ventre, E., Espinasse, T., Bréhier, C.-E., Calvez, V., Lepoutre, T., & Gandrillon, O. (2021) · Journal of Mathematical Biology · doi:10.1007/s00285-021-01684-1 · Cited by 17
“Although the most common approach in this case consists in finding optimal trajectories without computing a potential (see [51] or [52] for more recent works), some methods have been recently built for SDEs model, like Langevin dynamics [53].”
Method
Metadata
- Authors
- Heymann, M., & Vanden‐Eijnden, E.
- Venue
- Communications on Pure and Applied Mathematics
- Publisher
- Wiley
- Published
- 2008-01-29
- Volume
- 61
- Issue
- 8
- Pages
- 1052-1117
- ISSN
- 0010-3640 (ISSN-L)
- 1097-0312
- OpenAlex
- W2143055815
- Cited by
- 214
- References
- 3
- FWCI
- 2.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The geometric minimum action method: A least action principle on the space of curves. https://app.cochat.ai/papers/10.1002/cpa.20238
- The paper
- Heymann, M., & Vanden‐Eijnden, E. (2008). The geometric minimum action method: A least action principle on the space of curves. Communications on Pure and Applied Mathematics. https://doi.org/10.1002/cpa.20238
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.