Related papers: Levy Approximation of Impulsive Recurrent Process …

Let $X:=(X_t)_{t\geq 0}$ be an ergodic Markov process on $\real^d$, and $p>0$. We derive upper bounds of the $p$-Wasserstein distance between the invariant measure and the empirical measures of the Markov process $X$. For this we assume,…

We show that adaptive least-squares finite element methods driven by the canonical least-squares functional converge under weak conditions on PDE operator, mesh-refinement, and marking strategy. Contrary to prior works, our plain…

We propose a new method called the Metropolis-adjusted Mirror Langevin algorithm for approximate sampling from distributions whose support is a compact and convex set. This algorithm adds an accept-reject filter to the Markov chain induced…

We establish the existence of solutions to common noise McKean-Vlasov martingale problems for coefficients with low regularity. Our approach is able to handle the key challenge posed by drift coefficients that are discontinuous with respect…

There is increasing interest to develop Bayesian inferential algorithms for point process models with intractable likelihoods. A purpose of this paper is to illustrate the utility of using simulation based strategies, including Approximate…

We consider additive functionals of stationary Markov processes and show that under Kipnis-Varadhan type conditions they converge in rough path topology to a Stratonovich Brownian motion, with a correction to the Levy area that can be…

In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…

In this paper we propose a new approach for sampling from probability measures in, possibly, high dimensional spaces. By perturbing the standard overdamped Langevin dynamics by a suitable Stratonovich perturbation that preserves the…

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…

This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the…

Motivated by entropic optimal transport, time reversal of Markov jump processes in $\mathbb{R}^n$ is investigated. Relying on an abstract integration by parts formula for the carr\'e du champ of a Markov process recently obtained by…

In this paper, we prove the existence and uniqueness of the solution to reflected backward doubly stochastic differential equations driven by Teugels martingales associated with a L\'evy process where the barrier process is not necessarily…

We propose a numerical integrator for determining low-rank approximations to solutions of large-scale matrix differential equations. The considered differential equations are semilinear and stiff. Our method consists of first splitting the…

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…

For a positive self-similar Markov process, X, we construct a local time for the random set, $\Theta$, of times where the process reaches its past supremum. Using this local time we describe an exit system for the excursions of X out of its…

This paper addresses the question of predicting when a positive self-similar Markov process X attains its pathwise global supremum or infimum before hitting zero for the first time (if it does at all). This problem has been studied in…

Continuous-time Markov chains describing interacting processes exhibit a state space that grows exponentially in the number of processes. This state-space explosion renders the computation or storage of the time-marginal distribution, which…

We study proximal random reshuffling for minimizing the sum of locally Lipschitz functions and a proper lower semicontinuous convex function without assuming coercivity or the existence of limit points. The algorithmic guarantees pertaining…

This work concerns estimation of linear autoregressive models with Markov-switching using expectation maximisation (E.M.) algorithm. Our method generalise the method introduced by Elliot for general hidden Markov models and avoid to use…

Using Lamperti's relationship between L\'{e}vy processes and positive self-similar Markov processes (pssMp), we study the weak convergence of the law $\mathbb{P}_x$ of a pssMp starting at $x>0$, in the Skorohod space of c\`{a}dl\`{a}g…