Related papers: A martingale approach for the elephant random walk
The simple random walk on $\mathbb{Z}^p$ shows two drastically different behaviours depending on the value of $p$: it is recurrent when $p\in\{1,2\}$ while it escapes (with a rate increasing with $p$) as soon as $p\geq3$. This classical…
The Random Walk Pinning Model (RWPM) is a statistical mechanics model in which the trajectory of a continuous time random walk $X=(X_t)_{t\geq 0}$ is rewarded according to the time it spends together with a moving catalyst. More…
We study the noncolliding random walk (RW), which is a particle system of one-dimensional, simple and symmetric RWs starting from distinct even sites and conditioned never to collide with each other. When the number of particles is finite,…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…
A probabilistic approach is provided to establish new hypergeometric identities. It is based on the calculation of moments of the limiting distribution of the position of the elephant random walk in the superdiffusive regime.
The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…
In this paper sequential monitoring schemes to detect nonparametric drifts are studied for the random walk case. The procedure is based on a kernel smoother. As a by-product we obtain the asymptotics of the Nadaraya-Watson estimator and its…
In this article, we establish solid foundations for the study of Maximal Entropy Random Walks (MERWs) on infinite graphs. We introduce a generalized definition that extends the original concept, along with rigorous tools for handling this…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…
We consider one-dimensional excited random walks (ERWs) with i.i.d. markovian cookie stacks in the non-boundary recurrent regime. We prove that under diffusive scaling such an ERW converges in the standard Skorokhod topology to a multiple…
We consider a discrete time random walk in one dimension. At each time step the walker jumps by a random distance, independent from step to step, drawn from an arbitrary symmetric density function. We show that the expected positive maximum…
We study an extension of the generalized excited random walk (GERW) on $\mathbb{Z}^d$ introduced in [Ann. Probab. 40 (5), 2012, [7]] by Menshikov, Popov, Ram\'irez and Vachkovskaia. Our extension consists in studying a version of the GERW…
We work under the A\"{\i}d\'{e}kon-Chen conditions which ensure that the derivative martingale in a supercritical branching random walk on the line converges almost surely to a nondegenerate nonnegative random variable that we denote by…
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…
Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…
This paper is concerned with a stochastic linear-quadratic leader-follower differential game with elephant memory. The model is general in that the state equation for both the leader and the follower includes the elephant memory of the…
Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…
The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a fully automated manner.…