Related papers: Levy Approximation of Impulsive Recurrent Process …

Assume a L\'evy process $X$ on the time interval $[0,1]$ that is an $L_2$-martingale and let $Y$ be either its stochastic exponential or $X$ itself. We consider Riemann-approximations of certain stochastic integrals driven by $Y$ and relate…

We propose a new policy, called the LP-update policy, to solve finite horizon weakly-coupled Markov decision processes. The latter can be seen as multi-constraint multi-action bandits, and generalize the classical restless bandit problems.…

By the probabilistic coupling approach which combines a new refined basic coupling with the synchronous coupling for L\'evy processes, we obtain explicit exponential contraction rates in terms of the standard $L^1$-Wasserstein distance for…

Given an It\=o semimartingale with a time-homogeneous jump part observed at high frequency, we prove weak convergence of a normalized truncated empirical distribution function of the L\'evy measure to a Gaussian process. In contrast to…

In this paper, we address rare-event simulation for heavy-tailed L\'evy processes with infinite activities. The presence of infinite activities poses a critical challenge, making it impractical to simulate or store the precise sample path…

We develop a novel class of MCMC algorithms based on a stochastized Nesterov scheme. With an appropriate addition of noise, the result is a time-inhomogeneous underdamped Langevin equation, which we prove emits a specified target…

We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…

The paper studies the rate of convergence of the weak Euler approximation for solutions to possibly completely degenerate SDEs driven by Levy processes, with Hoelder-continuous coefficients. It investigates the dependence of the rate on the…

In this work, we establish $\mathrm{L}^2$-exponential convergence for a broad class of Piecewise Deterministic Markov Processes recently proposed in the context of Markov Process Monte Carlo methods and covering in particular the Randomized…

In this paper a new method for inverting the Laplace transform from the real axis is formulated. This method is based on a quadrature formula. We assume that the unknown function $f(t)$ is continuous with (known) compact support. An…

An extension of non-deterministic processes driven by the random telegraph signal is introduced in the framework of "piecewise deterministic Markov processes" [Davis], including a broader category of random systems. The corresponding…

In this paper we consider the convergence of the conditional entropy to the entropy rate for Markov chains. Convergence of certain statistics of long range dependent processes, such as the sample mean, is slow. It has been shown in Carpio…

Motivated by challenges arising in molecular simulation, we study reactive trajectories of the overdamped Langevin dynamics, i.e. trajectories observed as they pass from a set A corresponding to the reagents of a chemical reaction to a set…

We prove existence of weak martingale solutions satisfying an almost sure version of the energy inequality and which constitute a (almost sure) Markov process.

Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In…

A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting approximation is a four tuple Markov…

We construct optimal Markov couplings of L\'{e}vy processes, whose L\'evy (jump) measure has an absolutely continuous component. The construction is based on properties of subordinate Brownian motions and the coupling of Brownian motions by…

Temporal Point Processes (TPP) with partial likelihoods involving a latent structure often entail an intractable marginalization, thus making inference hard. We propose a novel approach to Maximum Likelihood Estimation (MLE) involving…

Reversibility is a key property of Markov chains, central to algorithms such as Metropolis-Hastings and other MCMC methods. Yet many applications yield non-reversible chains, motivating the problem of approximating them by reversible ones…

We introduce a framework to approximate a Markov Decision Process that stands on two pillars: state aggregation -- as the algorithmic infrastructure; and central-limit-theorem-type approximations -- as the mathematical underpinning of…