English
Related papers

Related papers: Approximating exit times of continuous Markov proc…

200 papers

We consider triangular arrays of Markov chains that converge weakly to a diffusion process. Second order Edgeworth type expansions for transition densities are proved. The paper differs from recent results in two respects. We allow…

Statistics Theory · Mathematics 2007-05-23 Valentin Konakov , Enno Mammen

We study the limit behaviour of upper and lower bounds on expected time averages in imprecise Markov chains; a generalised type of Markov chain where the local dynamics, traditionally characterised by transition probabilities, are now…

Probability · Mathematics 2020-03-27 Natan T'Joens , Jasper De Bock

We consider a general method for the approximation of the distribution of a process conditioned to not hit a given set. Existing methods are based on particle system that are failable, in the sense that, in many situations , they are not…

Probability · Mathematics 2016-06-30 William Oçafrain , Denis Villemonais

This paper presents a wp-style calculus for obtaining bounds on the expected run-time of probabilistic programs. Its application includes determining the (possibly infinite) expected termination time of a probabilistic program and proving…

Logic in Computer Science · Computer Science 2022-02-17 Benjamin Lucien Kaminski , Joost-Pieter Katoen , Christoph Matheja , Federico Olmedo

This paper investigates the exit-time problem for time-inhomogeneous diffusion processes. The focus is on the small-noise behavior of the exit time from a bounded positively invariant domain. We demonstrate that, when the drift and…

Probability · Mathematics 2025-01-22 Ashot Aleksian , Stéphane Villeneuve

We present a systematic method for computing explicit approximations to martingale representations for a large class of Brownian functionals. The approximations are obtained by obtained by computing a directional derivative of the weak…

Probability · Mathematics 2018-03-28 Rama Cont , Yi Lu

We consider the optimal stopping problem consisting in, given a strong Markov process, a reward function and a discount rate, finding the stopping time such that the expected reward at the stopping time is maximum. The approach we follow,…

Probability · Mathematics 2014-05-30 Fabián Crocce

The efficient management of large-scale queueing networks is critical for a variety of sectors, including healthcare, logistics, and customer service, where system performance has profound implications for operational effectiveness and cost…

Methodology · Statistics 2024-02-22 L. Jeff Hong , Yingda Song , Tan Wang

In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…

Probability · Mathematics 2016-11-08 Christoph Reisinger

Inspired by a duration-dependent life insurance model, we consider continuous-time semi-Markov jump processes, initially assumed to have a finite state-space. We develop approximations using jump processes that are time-homogeneous Markov,…

Probability · Mathematics 2025-08-11 Martin Bladt , Andreea Minca , Oscar Peralta

This work develops Monte Carlo Euler adaptive time stepping methods for the weak approximation problem of jump diffusion driven stochastic differential equations. The main result is the derivation of a new expansion for the omputational…

Numerical Analysis · Mathematics 2007-05-23 E. Mordecki , A. Szepessy , R. Tempone , G. E. Zouraris

Reinforcement Learning Algorithms are predominantly developed for stationary environments, and the limited literature that considers nonstationary environments often involves specific assumptions about changes that can occur in transition…

Machine Learning · Computer Science 2025-09-25 Ranga Shaarad Ayyagari , Revanth Raj Eega , Ambedkar Dukkipati

This paper provides a general and abstract approach to approximate ergodic regimes of Markov and Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton & Pages (2002) and based on simulation algorithms…

Probability · Mathematics 2018-01-17 Gilles Pagès , Clément Rey

We derive general bounds on the probability that the empirical first-passage time $\overline{\tau}_n\equiv \sum_{i=1}^n\tau_i/n$ of a reversible ergodic Markov process inferred from a sample of $n$ independent realizations deviates from the…

Statistical Mechanics · Physics 2023-12-12 Rick Bebon , Aljaž Godec

Invariance principles are obtained for a Markov process on a half-line with continuous paths on the interior. The domains of attraction of the two different types of self-similar processes are investigated. Our approach is to establish…

Probability · Mathematics 2008-11-14 Kouji Yano

Let $X$ be a Markov process taking values in $\mathbf{E}$ with continuous paths and transition function $(P_{s,t})$. Given a measure $\mu$ on $(\mathbf{E}, \mathscr{E})$, a Markov bridge starting at $(s,\varepsilon_x)$ and ending at…

Probability · Mathematics 2015-11-13 Umut Çetin , Albina Danilova

In this paper we first provide several conditional limit theorems for L\'evy processes with negative drift and regularly varying tail. Then we apply them to study the asymptotic behavior of expectations of some exponential functionals of…

Probability · Mathematics 2020-05-29 Wei Xu

We obtain exponential moment asymptotics for the Bessel point process. As a direct consequence, we improve on the asymptotics for the expectation and variance of the associated counting function, and establish several central limit…

Mathematical Physics · Physics 2021-05-11 Christophe Charlier

In this paper, we study an approximation scheme for L\'evy processes with drift in terms of a representation that is akin to the celebrated Mehler formula for L\'evy-Ornstein-Uhlenbeck processes. The approximation scheme is based on a…

Probability · Mathematics 2025-11-25 Max Nendel

The CEV model is given by the stochastic differential equation $X_t=X_0+\int_0^t\mu X_sds+\int_0^t\sigma (X^+_s)^pdW_s$, $\frac{1}{2}\le p<1$. It features a non-Lipschitz diffusion coefficient and gets absorbed at zero with a positive…

Probability · Mathematics 2010-05-06 V. Abramov , F. Klebaner , R. Liptser