相关论文: How often does a critical elephant random walk ret…
This paper provides a detailed description for the asymptotics of exponential functionals of random walks with light/heavy tails. We give the convergence rate based on the key observation that the asymptotics depends on the sample paths…
The dynamics of the avalanche width in the evolution model is described using a random walk picture. In this approach the critical exponents for avalanche distribution, $\tau$, and avalanche average time, $\gamma$, are found to be the same…
We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…
Consider a critical branching random walk on $\mathbb{Z}^d$, $d\geq 1$, started with a single particle at the origin, and let $L(x)$ be the total number of particles that ever visit a vertex $x$. We study the tail of $L(x)$ under suitable…
This elementary treatment first summarizes extreme values of a Bernoulli random walk on the one-dimensional integer lattice over a finite discrete time interval. Both the symmetric (unbiased) and asymmetric (biased) cases are discussed.…
We consider a random walk with transition probabilities weakly dependent on an environment with a deterministic, but strongly chaotic, evolution. We prove that for almost all initial conditions of the environment the walk satisfies the CLT.
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which…
In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
We study the so-called elephant random walk (ERW) which is a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory which exhibits a phase transition from diffusive to superdiffusive behaviour. We prove a law of large…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We study the elephant random walk in arbitrary dimension $d\geq 1$. Our main focus is the limiting random variable appearing in the superdiffusive regime. Building on a link between the elephant random walk and P\'olya-type urn models, we…
For a symmetric random walk in $Z^2$ which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erd\H{o}s-Taylor conjecture and obtain the…
In this paper we present rigorous results on the critical behavior of the Activated Random Walk model. We conjecture that on a general class of graphs, including $\mathbb{Z}^d$, and under general initial conditions, the system at the…
We study the escape behavior of a lamb to safe haven pursued by a hungry lion. Identifying the system with a pair of vicious Brownian walkers we evaluate the probability density function for the vicious pair and from there we estimate the…
In this paper we consider a stochastic process that may experience random reset events which bring suddenly the system to the starting value and analyze the relevant statistical magnitudes. We focus our attention on monotonous…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
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…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…