Related papers: First-passage time for PDifMPs: an Exact simulatio…

The first passage is a generic concept for quantifying when a random quantity such as the position of a diffusing molecule or the value of a stock crosses a preset threshold (target) for the first time. The last decade saw an enlightening…

This paper presents a novel approach to pricing American options using piecewise diffusion Markov processes (PDifMPs), a type of generalised stochastic hybrid system that integrates continuous dynamics with discrete jump processes. Standard…

The mean first passage time~(MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the…

Discrete diffusion models have emerged as powerful tools for high-quality data generation. Despite their success in discrete spaces, such as text generation tasks, the acceleration of discrete diffusion models remains under-explored. In…

We consider the problem of simulating diffusion bridges, which are diffusion processes that are conditioned to initialize and terminate at two given states. The simulation of diffusion bridges has applications in diverse scientific fields…

Processes slow compared to atomic vibrations pose significant challenges in atomistic simulations, particularly for phenomena such as diffusive relaxations and phase transitions, where repeated crossings and the shear number of thermally…

We investigate the full functional form of the first passage time density (FPTD) of a tracer particle in a single-file diffusion (SFD) system whose population is: (i) homogeneous, i.e., all particles having the same diffusion constant and…

We provide an analytic solution to the first-passage time (FPT) problem of a piecewise-smooth stochastic model, namely Brownian motion with dry friction, using two different but closely related approaches which are based on eigenfunction…

This paper introduces Discrete Markov Probabilistic Models (DMPMs), a novel discrete diffusion algorithm for discrete data generation. The algorithm operates in discrete bit space, where the noising process is a continuous-time Markov chain…

We propose a method based on continuous time Markov chain approximation to compute the distribution of Parisian stopping times and price Parisian options under general one-dimensional Markov processes. We prove the convergence of the method…

A class of algorithms in discrete space and continuous time for Brownian first passage time estimation is considered. A simple algorithm is derived that yields exact mean first passage times (MFPT) for linear potentials in one dimension,…

First-passage properties are central to the kinetics of target-search processes. Theoretical approaches so far primarily focused on predicting first-passage statistics for a given process or model. In practice, however, one faces the…

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…

We consider one-dimensional diffusions, with polynomial drift and diffusion coefficients, so that in particular the motion can be space-inhomogeneous, interacting via one-sided reflections. The prototypical example is the well-known model…

We introduce DeepFHT, a survival-analysis framework that couples deep neural networks with first hitting time (FHT) distributions from stochastic process theory. Time to event is represented as the first passage of a latent diffusion…

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…

Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well-described by the annealed continuous time random walk (CTRW). We propose an approximate expression for the first-passage-time (FPT)…

Diffusion models are increasingly used for robot learning, but current designs face a clear trade-off. Action-chunking diffusion policies like ManiCM are fast to run, yet they only predict short segments of motion. This makes them reactive,…

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…

The study of first passage times for diffusing particles reaching target states is foundational in various practical applications, including diffusion-controlled reactions. In this work, we present a bi-scaling theory for the probability…