2020
DOI: 10.1051/m2an/2019071
|View full text |Cite
|
Sign up to set email alerts
|

Ergodic SDEs on submanifolds and related numerical sampling schemes

Abstract: In many applications, it is often necessary to sample the mean value of certain quantity with respect to a probability measure µ on the level set of a smooth function ξ :A specially interesting case is the so-called conditional probability measure, which is useful in the study of free energy calculation and model reduction of diffusion processes. By Birkhoff's ergodic theorem, one approach to estimate the mean value is to compute the time average along an infinitely long trajectory of an ergodic diffusion proc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 17 publications
(26 citation statements)
references
References 39 publications
(141 reference statements)
0
26
0
Order By: Relevance
“…A recent strategy has been to introduce a reversibility check in addition to the standard acceptionrejection rule, which makes the HMC scheme under constraint reversible [52,35]. Note that [53] proposes an interesting alternative to the scheme used here, which is however not compatible with a Metropolis selection procedure in its current form. We thus present the algorithm as written in [35], with some simplifications and adaptations to our context, for which we introduce next the constrained Langevin dynamics.…”
Section: Description Of the Algorithm The Description Of The Constramentioning
confidence: 99%
“…A recent strategy has been to introduce a reversibility check in addition to the standard acceptionrejection rule, which makes the HMC scheme under constraint reversible [52,35]. Note that [53] proposes an interesting alternative to the scheme used here, which is however not compatible with a Metropolis selection procedure in its current form. We thus present the algorithm as written in [35], with some simplifications and adaptations to our context, for which we introduce next the constrained Langevin dynamics.…”
Section: Description Of the Algorithm The Description Of The Constramentioning
confidence: 99%
“…First of all, we recall some notations as well as some results from the work [70,69] in order to introduce the problem under investigation.…”
Section: Mathematical Setupmentioning
confidence: 99%
“…the scalar product u, v a −1 = u T a −1 v, for u, v ∈ R n . It is shown in [69] that, starting from y(0) ∈ Σ z , the process…”
Section: Mathematical Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…We quote in particular the Markov chain Monte Carlo (MCMC) methods [10,27,45] and the hybrid Monte Carlo methods [46,65], where the need for a reverse projection check is shown to be a key step. We also mention the integrators in [47,66] that are based on an Euler discretization and present new approaches for projecting on the manifold. The alternative approach of using Metropolis-Hastings rejection procedure allows to fully remove the bias on the invariant measure.…”
Section: Introductionmentioning
confidence: 99%