Related papers: Simulation of Multidimensional Diffusions with Sti…
We develop continuous time Markov chain (CTMC) approximation of one-dimensional diffusions with a lower sticky boundary. Approximate solutions to the action of the Feynman-Kac operator associated with a sticky diffusion and first passage…
Sticky Brownian motion is the simplest example of a diffusion process that can spend finite time both in the interior of a domain and on its boundary. It arises in various applications such as in biology, materials science, and finance.…
Motivated by queues with many servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove,…
Encounter-based models of diffusion provide a probabilistic framework for analyzing the effects of a partially absorbing reactive surface, in which the probability of absorption depends upon the amount of surface-particle contact time.…
Sticky diffusion models a Markovian particle experiencing reflection and temporary adhesion phenomena at the boundary. Numerous numerical schemes exist for approximating stopped or reflected stochastic differential equations (SDEs), but…
We present a novel approach of coupling two multidimensional and non-degenerate It\^o processes $(X_t)$ and $(Y_t)$ which follow dynamics with different drifts. Our coupling is sticky in the sense that there is a stochastic process $(r_t)$,…
The aim of this article is to provide a scheme for simulating diffusion processes evolving in one-dimensional discontinuous media. This scheme does not rely on smoothing the coefficients that appear in the infinitesimal generator of the…
Computing the stationary distributions of a continuous-time Markov chain (CTMC) involves solving a set of linear equations. In most cases of interest, the number of equations is infinite or too large, and the equations cannot be solved…
Fluid approximations have seen great success in approximating the macro-scale behaviour of Markov systems with a large number of discrete states. However, these methods rely on the continuous-time Markov chain (CTMC) having a particular…
We propose a discrete time discrete space Markov chain approximation with a Brownian bridge correction for computing curvilinear boundary crossing probabilities of a general diffusion process on a finite time interval. For broad classes of…
Diffusion models have achieved huge empirical success in data generation tasks. Recently, some efforts have been made to adapt the framework of diffusion models to discrete state space, providing a more natural approach for modeling…
Analyses of serially-sampled data often begin with the assumption that the observations represent discrete samples from a latent continuous-time stochastic process. The continuous-time Markov chain (CTMC) is one such generative model whose…
We introduce the Space-Time Markov Chain Approximation (STMCA) for a general diffusion process on a finite metric graph $\Gamma$. The STMCA is a doubly asymmetric (in both time and space) random walk defined on a subdivisions of $\Gamma$,…
The Markov chain approximation of a one-dimensional symmetric diffusion is investigated in this paper. Given an irreducible reflecting diffusion on a closed interval with scale function $s$ and speed measure $m$, the approximating Markov…
We propose a method to approximate continuous-time, continuous-state stochastic processes by a discrete-time Markov chain defined on a nonuniform grid. Our method provides exact moment matching for processes whose first and second moments…
Modelling random dynamical systems in continuous time, diffusion processes are a powerful tool in many areas of science. Model parameters can be estimated from time-discretely observed processes using Markov chain Monte Carlo (MCMC) methods…
Every probability distribution can be approximated up to a given precision by a phase-type distribution, i.e. a distribution encoded by a continuous time Markov chain (CTMC). However, an excessive number of states in the corresponding CTMC…
Continuous diffusion models have demonstrated remarkable performance in data generation across various domains, yet their efficiency remains constrained by two critical limitations: (1) the local adjacency structure of the forward Markov…
In this paper we consider large state space continuous time Markov chains (MCs) arising in the field of systems biology. For density dependent families of MCs that represent the interaction of large groups of identical objects, Kurtz has…
We propose a novel method for simulating conditioned diffusion processes (diffusion bridges) in Euclidean spaces. By training a neural network to approximate bridge dynamics, our approach eliminates the need for computationally intensive…