Related papers: Steady-state diffusion approximations of Markov ch…
Consider a sequence $P_n$ of positive recurrent transition matrices or kernels that approximate a limiting infinite state matrix or kernel $P_{\infty}$. Such approximations arise naturally when one truncates an infinite state Markov chain…
This paper studies the subgeometric convergence of the stationary distribution in taking the infinite-level limit of a finite-level M/G/1-type Markov chain, that is, in letting the upper boundary level go to infinity. This study is…
We study the continuous limit of a multibox Erhenfest urn model proposed before by the authors. The evolution of the resulting continuous system is governed by a differential equation, which describes a diffusion process on a circle with a…
It is well known, mainly because of the work of Kurtz, that density dependent Markov chains can be approximated by sets of ordinary differential equations (ODEs) when their indexing parameter grows very large. This approximation cannot…
Barrier crossing is a widespread phenomenon across natural and engineering systems. While an abundant cross-disciplinary literature on the topic has emerged over the years, the stochastic underpinnings of the process are yet to be linked…
We study continuous-time Markov chains on the non-negative integers under mild regularity conditions (in particular, the set of jump vectors is finite and both forward and backward jumps are possible). Based on the so-called flux balance…
We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…
We consider the problem to steer a linear dynamical system with full state observation from an initial gaussian distribution in state-space to a final one with minimum energy control. The system is stochastically driven through the control…
We consider a rate control problem for an $N$-particle weakly interacting finite state Markov process. The process models the state evolution of a large collection of particles and allows for multiple particles to change state…
We study a finite system of diffusions on the half-line, absorbed when they hit zero, with a correlation effect that is controlled by the proportion of the processes that have been absorbed. As the number of processes in the system becomes…
This paper is dedicated to the investigation of a new numerical method to approximate the optimal stopping problem for a discrete-time continuous state space Markov chain under partial observations. It is based on a two-step discretization…
We derive a multidimensional Stein's method for asymptotic independence in the case of a general target $\mu$ with a density, being invariant measure of a diffusion process. It allows us to give a general bound in Wasserstein distance…
In the context of PDE-constrained optimization theory, source identification problems traditionally entail particles emerging from an unknown source distribution inside a domain, moving according to a prescribed stochastic process,…
The aim of this review is to provide a concise overview of some of the generic approaches that have been developed to deal with the statistical description of large systems of interacting dissipative 'units'. The latter notion includes,…
The paper studies a higher-order diffusion model of Maxwell-Stefan kind. The model is based upon higher-order moment equations of kinetic theory of mixtures, which include viscous dissipation in the model. Governing equations are analyzed…
The Stein's method is a popular method used to derive upper-bounds of distances between probability distributions. It can be viewed, in certain of its formulations, as an avatar of the semi-group or of the smart-path method used commonly in…
Discrete diffusion models have recently emerged as a powerful class of generative models for chemistry and biology data. In these fields, the goal is to generate various samples with high rewards (e.g., drug-likeness in molecules), making…
We first study crossing statistics in random connection models (RCM) built on marked Poisson point processes on $\mathbb R^d$. Under general assumptions, we show exponential tail bounds for the number of crossings of a box contained in the…
Denoising diffusion probabilistic models and score-matching models have proven to be very powerful for generative tasks. While these approaches have also been applied to the generation of discrete graphs, they have, so far, relied on…
In this article, we discuss the basic ideas of a general procedure to adapt the Stein-Chen method to bound the distance between conditional distributions. From an integration-by-parts formula (IBPF), we derive a Stein operator whose…