相关论文: Stationary distributions for jump processes with m…

Let $\Gamma$ denote the space of all locally finite subsets (configurations) in $R^d$. A stochastic dynamics of binary jumps in continuum is a Markov process on $\Gamma$ in which pairs of particles simultaneously hop over $R^d$. In this…

We investigate the convergence of hitting times for jump-diffusion processes. Specifically, we study a sequence of stochastic differential equations with jumps. Under reasonable assumptions, we establish the convergence of solutions to the…

Markov jump processes (or continuous-time Markov chains) are a simple and important class of continuous-time dynamical systems. In this paper, we tackle the problem of simulating from the posterior distribution over paths in these models,…

This paper addresses the estimation of locally stationary long-range dependent processes, a methodology that allows the statistical analysis of time series data exhibiting both nonstationarity and strong dependency. A time-varying…

We obtain the uniform measure as a stationary measure of the one-dimensional discrete-time quantum walks by solving the corresponding eigenvalue problem. As an application, the uniform probability measure on a finite interval at a time can…

We introduce a novel class of generative models based on piecewise deterministic Markov processes (PDMPs), a family of non-diffusive stochastic processes consisting of deterministic motion and random jumps at random times. Similarly to…

Consider a compact metric space $S$ and a pair $(j,k)$ with $k \ge 2$ and $1 \le j \le k$. For any probability distribution $\theta \in P(S)$, define a Markov chain on $S$ by: from state $s$, take $k$ i.i.d. ($\theta$) samples, and jump to…

What can one say on convergence to stationarity of a finite state Markov chain that behaves "locally" like a nearest neighbor random walk on ${\mathbb Z}$ ? The model we consider is a version of nearest neighbor lazy random walk on the…

We study the behavior of independent and stationary increments jump processes as they approach fixed thresholds. The exact crossing time is unavailable because the real-time information about successive jumps is unknown. Instead, the…

We investigate the Poisson regression method for Markov and semi-Markov jump processes from a nonparametric angle, allowing the lengths of the time and duration intervals in the partition to vary with the number of observations. Imposing no…

We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…

A continuous-time random walk in the quarter plane with homogeneous transition rates is considered. Given a non-negative reward function on the state space, we are interested in the expected stationary performance. Since a direct derivation…

In this paper, we consider the $(L,1)$ state-dependent reflecting random walk (RW) on the half line, which is a RW allowing jumps to the left at a maxial size $L$. For this model, we provide an explicit criterion for (positive) recurrence…

Dealing with unichain MDPs, we consider stationary distributions of policies that coincide in all but $n$ states. In these states each policy chooses one of two possible actions. We show that the stationary distributions of n+1 such…

Let $r: S\times S\to \bb R_+$ be the jump rates of an irreducible random walk on a finite set $S$, reversible with respect to some probability measure $m$. For $\alpha >1$, let $g: \bb N\to \bb R_+$ be given by $g(0)=0$, $g(1)=1$, $g(k) =…

We consider the piecewise-deterministic Markov process obtained by randomly switching between the flows generated by a finite set of smooth vector fields on a compact set. We obtain H\"ormander-type conditions on the vector fields…

Advances in experimental techniques allow the collection of high-resolution spatio-temporal data that track individual motile entities over time. These tracking data motivate the use of mathematical models to characterise the motion…

We consider a one-dimensional stationary time series of fixed duration $T$. We investigate the time $t_{\rm m}$ at which the process reaches the global maximum within the time interval $[0,T]$. By using a path-decomposition technique, we…

The orientational memory of particles can serve as an effective measure of diffusivity, spreading, and search efficiency in complex stochastic processes. We develop a theoretical framework to describe the decay of directional correlations…

We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed…