English
Related papers

Related papers: From persistent random walks to the telegraph nois…

200 papers

For many stochastic processes, the probability $S(t)$ of not-having reached a target in unbounded space up to time $t$ follows a slow algebraic decay at long times, $S(t)\sim S_0/t^\theta$. This is typically the case of symmetric compact…

Statistical Mechanics · Physics 2019-07-09 N. Levernier , M. Dolgushev , O. Bénichou , R. Voituriez , T. Guérin

Continuous Time Markov Chains, Hawkes processes and many other interesting processes can be described as solution of stochastic differential equations driven by Poisson measures. Previous works, using the Stein's method, give the…

Probability · Mathematics 2026-04-02 Eustache Besançon , Laure Coutin , Laurent Decreusefond , Pascal Moyal

Let W be the number of points in (0,t] of a stationary finite-state Markov renewal point process. We derive a bound for the total variation distance between the distribution of W and a compound Poisson distribution. For any nonnegative…

Probability · Mathematics 2007-05-23 Torkel Erhardsson

We introduce and study a family of Markov processes on partitions. The processes preserve the so-called z-measures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the…

Mathematical Physics · Physics 2007-05-23 Alexei Borodin , Grigori Olshanski

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

Probability · Mathematics 2015-08-18 Andrea Collevecchio , Kais Hamza , Meng Shi

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…

Statistics Theory · Mathematics 2026-05-06 Martin Bladt , Rasmus Frigaard Lemvig

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

Probability · Mathematics 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

Probability · Mathematics 2016-08-08 Bojan Basrak , Drago Špoljarić

Consider $n$ independent Goldstein-Kac telegraph processes $X_1(t), \dots ,X_n(t), \; n\ge 2, \; t\ge 0,$ on the real line $\Bbb R$. Each the process $X_k(t), \; k=1,\dots,n,$ describes a stochastic motion at constant finite speed $c_k>0$…

Probability · Mathematics 2018-08-14 Alexander D. Kolesnik

We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different…

Information Theory · Computer Science 2018-10-03 Dragana Bajovic , José M. F. Moura , Dejan Vukobratovic

The continuous-time random walk is defined as a Poissonization of discrete-time random walk. We study the noncolliding system of continuous-time simple and symmetric random walks on ${\mathbb{Z}}$. We show that the system is determinantal…

Probability · Mathematics 2014-09-30 Syota Esaki

We study Markov processes conditioned so that their local time must grow slower than a prescribed function. Building upon recent work on Brownian motion with constrained local time in [5] and [33], we study transience and recurrence for a…

Probability · Mathematics 2020-12-24 Adam Barker

The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are…

Probability · Mathematics 2019-03-08 Dariusz Buraczewski , Piotr Dyszewski , Alexander Iksanov , Alexander Marynych

We study the loop clusters induced by Poissonian ensembles of Markov loops on a finite or countable graph (Markov loops can be viewed as excursions of Markov chains with a random starting point, up to re-rooting). Poissonian ensembles are…

Probability · Mathematics 2013-04-17 Yves Le Jan , Sophie Lemaire

We present a general method to derive the metastable behavior of weakly mixing Markov chains. This approach is based on properties of the resolvent equations and can be applied to metastable dynamics which do not satisfy the mixing…

Probability · Mathematics 2024-06-21 Claudio Landim , Diego Marcondes , Insuk Seo

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Probability · Mathematics 2018-10-09 Ruojun Huang

Brownian motion is the only random process which is Gaussian, stationary and Markovian. Dropping the Markovian property, i.e. allowing for memory, one obtains a class of processes called fractional Brownian motion, indexed by the Hurst…

Statistical Mechanics · Physics 2016-07-27 Mathieu Delorme , Kay Jörg Wiese

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

Probability · Mathematics 2015-11-30 P. Caputo , A. Faggionato , A. Gaudilliere

We consider a simple regression model where a regressor is composed of order statistics and a noise is Markov-modulated. We introduce an empirical bridge of regression residuals and prove its weak convergence to a centered Gaussian process.

Probability · Mathematics 2014-10-24 Artyom Kovalevskii , Evgeny Shatalin

We introduce a class of Markov processes conditioned to avoid intersection over a moving time window of length T>0, a setting we refer to as myopic non-intersection. In particular, we study a system of myopic non-intersecting Brownian…

Probability · Mathematics 2025-06-06 Jonas Arista , Daniel Remenik , Avelio Sepúlveda