Related papers: A study of random walks on wedges

We consider random walks X_n in Z+, obeying a detailed balance condition, with a weak drift towards the origin when X_n tends to infinity. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional…

Let $G$ be a Cayley graph of a nonamenable group with spectral radius $\rho < 1$. It is known that branching random walk on $G$ with offspring distribution $\mu$ is transient, i.e., visits the origin at most finitely often almost surely, if…

We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…

We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

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 study the frog model on $\mathbb{Z}^d$ with drift in dimension $d \geq 2$ and establish the existence of transient and recurrent regimes depending on the transition probabilities. We focus on a model in which the particles perform…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in…

We consider non-homogeneous random walks on the two-dimensional positive quadrant $\mathbb{N}^2$ and the one-dimensional slab $\{0,1,\dots,k\}\times\mathbb{N}$. In the 1960's the following question was asked for $\mathbb{N}^2$: is it true…

Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…

We establish limit theorems for U-statistics indexed by a random walk on Z^d and we express the limit in terms of some Levy sheet Z(s,t). Under some hypotheses, we prove that the limit process is Z(t,t) if the random walk is transient or…

Intransitivity is a property of connected, oriented graphs representing species interactions that may drive their coexistence even in the presence of competition, the standard example being the three species Rock-Paper-Scissors game. We…

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

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…

Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with equal probability to any neighbor of its current vertex, and ends when it has visited every vertex. We call such a random walk a random…

We study Aldous' conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this…