Related papers: Once-excited random walks on general trees
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We introduce a method for studying monotonicity of the speed of excited random walks in high dimensions, based on a formula for the speed obtained via cut-times and Girsanov's transform. While the method gives rise to similar results as…
We consider biased random walk on regular tree and we obtain the spectral radius, first return probability and $n$-step transition probability.
We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks find the target within a finite time when b>b_c. For b<b_c,…
We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of…
We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
We define and analyze random quantum walks on homogeneous trees of degree $q\geq 3$. Such walks describe the discrete time evolution of a quantum particle with internal degree of freedom in $\C^q$ hopping on the neighboring sites of the…
In the previous chapters, we explored the effects of resetting on networks considering one and two nodes. In this chapter, we will describe a generalization of random walks with resetting to an arbitrary number of nodes $\mathcal{M}$. In…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
This paper studies the behavior of RWRE on trees in the critical case left open in previous work. For trees of exponential growth, a random perturbation of the transition probabilities can change a transient random walk into a recurrent…
We investigate the directed random walk on hierarchic trees. Two cases are investigated: random variables on deterministic trees with a continuous branching, and random variables on the trees constructed trough the random branching process.…
We obtain the convergence in law of a sequence of excited (also called cookies) random walks toward an excited Brownian motion. This last process is a continuous semi-martingale whose drift is a function, say $\phi$, of its local time. It…
In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
We consider excited random walks on the integers with a bounded number of i.i.d. cookies per site which may induce drifts both to the left and to the right. We extend the criteria for recurrence and transience by M. Zerner and for…
In this paper, we give a detailed construction of an example of excited random walk with speed zero in an ergodic random environment that have an infinite average number of cookies in each site. This example confirms that a result of…