2021
DOI: 10.1088/1751-8121/abe67b
|View full text |Cite
|
Sign up to set email alerts
|

Instantons for rare events in heavy-tailed distributions

Abstract: Large deviation theory and instanton calculus for stochastic systems are widely used to gain insight into the evolution and probability of rare events. At its core lies the fact that rare events are, under the right circumstances, dominated by their least unlikely realization. Their computation through a saddle-point approximation of the path integral for the corresponding stochastic field theory then reduces an inefficient stochastic sampling problem into a deterministic optimization problem: finding the path… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2
1

Relationship

3
4

Authors

Journals

citations
Cited by 15 publications
(18 citation statements)
references
References 41 publications
0
18
0
Order By: Relevance
“…3.3, act in some cases in which the standard large deviation scaling fails due to the presence of some form of long-term memory. In a very recent paper [6], a nonlinear reparametrisation of the scaled cumulant generating functions is proposed to properly compute instantons in case of observables with heavy tailed distributions.…”
Section: Discussionmentioning
confidence: 99%
“…3.3, act in some cases in which the standard large deviation scaling fails due to the presence of some form of long-term memory. In a very recent paper [6], a nonlinear reparametrisation of the scaled cumulant generating functions is proposed to properly compute instantons in case of observables with heavy tailed distributions.…”
Section: Discussionmentioning
confidence: 99%
“…In contrast to the optimisation approach by Chernykh and Stepanov [9] and others, where only a fixed Lagrange multiplier is specified without a priori knowledge of the resulting value of a, this method allows us to directly compute instantons for specified observable values a. This is convenient if a) there are multiple local minima, and the map F → a becomes multivalued, and b) there are observable regions where the action fails to be convex and the F -a-duality breaks down because the scaled cumulant-generating function of the process u diverges [30]. On the downside, we now have to solve multiple optimisation problems for each observable value that we want to compute an instanton for.…”
Section: Numerical Proceduresmentioning
confidence: 99%
“…The final time constraint on the gradient of passive scalar to attain z = ψ j (t f ) is implemented in (27) through a Lagrange multiplier λ ∈ R, [38]. The function F : R → R is a nonlinear reparametrization to ensure there is a unique λ for every large passive scalar gradients of interest [23].…”
Section: B the Action And Instanton Equations For The Ps-rfd Dynamicsmentioning
confidence: 99%
“…The benefit of solving equations ( 28) is even more significant for extreme events since this factor of improvement grows as Re and/or z increase. To overcome the problem of heavy tails, we convexify the rate function with a reparametrization of the observable according to the scheme presented in [23]. Concretely, we choose F (z) = sign(z) log log |z|, to be inserted as boundary condition into (27).…”
Section: B Extreme Configurations Of the Passive Scalar Gradientmentioning
confidence: 99%
See 1 more Smart Citation