Related papers: Deterministically driven random walks in a random …
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
We consider a random walk on integers where at the first visits to a site the walker gets a positive drift, but where after a certain number of visits the walker gets a negative drift. We prove that the walker is almost surely transient to…
We investigate excited random walks on $\Z^d, d\ge 1,$ and on planar strips $\Z\times\{0,1,...,L-1\}$ which have a drift in a given direction. The strength of the drift may depend on a random i.i.d. environment and on the local time of the…
We investigate the properties of a deterministic walk, whose locomotion rule is always to travel to the nearest site. Initially the sites are randomly distributed in a closed rectangular ($A/L \times L)$ landscape and, once reached, they…
According to Comets, Gantert and Zeitouni on the one hand and to Derriennic on the other hand, some functionals associated to the hitting times of random walks in random environment on the integer line coincide, for the walk itself and for…
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…
We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…
In recent years, there has been an interest in deriving certain important probabilistic results as consequences of deterministic ones; see for instance \cite{beig} and \cite{acc}. In this work, we continue on this path by deducing a well…
Systems whose time evolutions are entirely deterministic can nevertheless be studied probabilistically, i.e. in terms of the evolution of probability distributions rather than individual trajectories. This approach is central to the…
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…
Benjamini, Haggstrom, Peres and Steif introduced the concept of a dynamical random walk. This is a continuous family of random walks, {S_n(t)}. Benjamini et. al. proved that if d=3 or d=4 then there is an exceptional set of t such that…
We consider random walks in random environments on Z^d. Under a transitivity hypothesis that is much weaker than the customary ellipticity condition, and assuming an absolutely continuous invariant measure on the space of the environments,…
Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…
We present a procedure that determines the law of a random walk in an iid random environment as a function of a single "typical" trajectory. We indicate when the trajectory characterizes the law of the environment, and we say how this law…
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…
We consider crossovers with respect to the weak convergence theorems from a discrete-time quantum walk (DTQW). We show that a continuous-time quantum walk (CTQW) and discrete- and continuous-time random walks can be expressed as DTQWs in…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
We prove an averaged CLT for a random walk in a dynamical environment where the states of the environment at different sites are independent Markov chains.