Related papers: Once-excited random walks on general trees
We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…
We study one-dimensional excited random walks with non-nearest neighbor jumps. When the process is at a vertex that has not been visited before, its next transition has a positive drift to the right, possibly with long jumps. Whenever the…
We consider a left-transient random walk in a random environment on Z that will be disturbed by cookies inducing a drift to the right of strength 1. The number of cookies per site is i.i.d. and independent of the environment. Criteria for…
We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…
We consider a branching random walk on $\Z$, where the particles behave differently in visited and unvisited sites. Informally, each site on the positive half-line contains initially a cookie. On the first visit of a site its cookie is…
One dimensional excited random walk has been extensively studied for bounded, i.i.d. cookie environments. In this case, many important properties of the walk including transience or recurrence, positivity or non-positivity of the speed, and…
The phase transition of $M$-digging random on a general tree was studied by Collevecchio, Huynh and Kious (2018). In this paper, we study particularly the critical $M$-digging random walk on a superperiodic tree that is proved to be…
We consider a nearest-neighbor random walk on $\mathbb{Z}$ whose probability $\omega_x(j)$ to jump to the right from site $x$ depends not only on $x$ but also on the number of prior visits $j$ to $x$. The collection…
Deterministic walk in an excited random environment is a non-Markov integer-valued process $(X_n)_{n=0}^{\infty}$, whose jump at time $n$ depends on the number of visits to the site $X_n$. The environment can be understood as stacks of…
In this paper we consider an excited random walk on $\mathbb{Z}$ in identically piled periodic environment. This is a discrete time process on $\mathbb{Z}$ defined by parameters $(p_1,\dots p_M) \in [0,1]^M$ for some positive integer $M$,…
We consider a random walk in an i.i.d. random environment on Z that is perturbed by cookies of strength 1. The number of cookies per site is assumed to be i.i.d. Results on the speed of the random walk are obtained. Our main tool is the…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
It is a celebrated fact that a simple random walk on an infinite $k$-ary tree for $k \geq 2$ returns to the initial vertex at most finitely many times during infinitely many transitions; it is called transient. This work points out the fact…
In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit…
The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…
Consider a simple random walk on the integers with the following transition mechanism. At each site $x$, the probability of jumping to the right is $\omega(x)\in[\frac12,1)$, until the first time the process jumps to the left from site $x$,…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
A random walk on Z^d is excited if the first time it visits a vertex there is a bias in one direction, but on subsequent visits to that vertex the walker picks a neighbor uniformly at random. We show that excited random walk on Z^d, is…
We establish recurrence and transience criteria for critical branching processes in random environment with immigration. These results are then applied to discuss recurrence and transience of a recurrent random walk in a random environment…
We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…