Search arXivSearch

arXiv · 1702.00600

Numerical algorithms for mean exit time and escape probability of stochastic systems with asymmetric Lévy motion

Abstract

For non-Gaussian stochastic dynamical systems, mean exit time and escape probability are important deterministic quantities, which can be obtained from integro-differential (nonlocal) equations. We develop an efficient and convergent numerical method for the mean first exit time and escape probability for stochastic systems with an asymmetric Lévy motion, and analyze the properties of the solutions of the nonlocal equations. We also investigate the effects of different system factors on the mean exit time and escape probability, including the skewness parameter, the size of the domain, the drift term and the intensity of Gaussian and non-Gaussian noises. We find that the behavior of the mean exit time and the escape probability has dramatic difference at the boundary of the domain when the index of stability crosses the critical value of one.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiao Wang, Jinqiao Duan, Xiaofan Li, Renming Song. 2017-02-02. Numerical algorithms for mean exit time and escape probability of stochastic systems with asymmetric Lévy motion. https://arxiv.org/abs/1702.00600

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS