Related papers: Markov Chain Approximation of Pure Jump Processes

Our motivation comes from the large population approximation of individual based models in population dynamics and population genetics. We propose a general method to investigate scaling limits of finite dimensional population size Markov…

Markovian projections arise in problems where we aim to mimic the one-dimensional marginal laws of an It\^o semimartingale by using another It\^o process with Markovian dynamics. In applications, Markovian projections are useful in…

We consider periodic Markov chains with absorption. Applying to iterates of this periodic Markov chain criteria for the exponential convergence of conditional distributions of aperiodic absorbed Markov chains, we obtain exponential…

This paper proposes a quantum algorithm for Markov chain spectral gap estimation that is quasi-optimal (i.e., optimal up to a polylogarithmic factor) in the number of vertices for all parameters, and additionally quasi-optimal in the…

Markov chain Monte Carlo methods are a powerful tool for sampling equilibrium configurations in complex systems. One problem these methods often face is slow convergence over large energy barriers. In this work, we propose a novel method…

We study Girsanov's theorem in the context of symmetric Markov processes, extending earlier work of Fukushima-Takeda and Fitzsimmons on Girsanov transformations of ``gradient type.'' We investigate the most general Girsanov transformation…

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…

Filtering---estimating the state of a partially observable Markov process from a sequence of observations---is one of the most widely studied problems in control theory, AI, and computational statistics. Exact computation of the posterior…

We present a novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters. Our algorithm is based on two key…

We propose a new approach for estimating the finite dimensional transition matrix of a Markov chain using a large number of independent sample paths observed at random times. The sample paths may be observed as few as two times, and the…

We investigate the weak limit of the hyper-rough square-root process as the Hurst index $H$ goes to $-1/2\,$. This limit corresponds to the fractional kernel $t^{H - 1 / 2}$ losing integrability. We establish the joint convergence of the…

Let $\{X_n\}_{n\in\N}$ be a Markov chain on a measurable space $\X$ with transition kernel $P$ and let $V:\X\r[1,+\infty)$. The Markov kernel $P$ is here considered as a linear bounded operator on the weighted-supremum space $\cB_V$…

We present a numerical method to compute expectations of functionals of a piecewise-deterministic Markov process. We discuss time dependent functionals as well as deterministic time horizon problems. Our approach is based on the…

We consider a Markov chain $(x_n)$ whose kernel is indexed by a scaling parameter $\gamma>0$, refered to as the step size. The aim is to analyze the behavior of the Markov chain in the doubly asymptotic regime where $n\to\infty$ then…

First, sufficient conditions are given for a triangular array of random vectors such that the sequence of related random step functions converges towards a (not necessarily time homogeneous) diffusion process. These conditions are weaker…

We revisit the classical problem of approximating a stochastic differential equation by a discrete-time and discrete-space Markov chain. Our construction iterates Caratheodory's theorem over time to match the moments of the increments…

The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of…

In the paper, we study a new rate of convergence estimate for homogeneous discrete-time nonlinear Markov chains based on the Markov-Dobrushin condition. This result generalizes the convergence estimates for any positive number of transition…

The Markov Chain Monte Carlo method is the dominant paradigm for posterior computation in Bayesian analysis. It is common to control computation time by making approximations to the Markov transition kernel. Comparatively little attention…

The main goal of this text is comprehensive study of time homogeneous Markov chains on the real line whose drift tends to zero at infinity, we call such processes Markov chains with asymptotically zero drift. Traditionally this topic is…