Related papers: Supercritical causal maps : geodesics and simple r…

Let $\mathcal G$ be an infinite graph -- not necessarily one-ended -- on which the simple random walk is transient. We define a variant of the continuous-time random walk on $\mathcal G$ which reaches $\infty$ in finite time and "reflects…

We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…

The random walk with hyperbolic probabilities that we are introducing is an example of stochastic diffusion in a one-dimensional heterogeneous media. Although driven by site-dependent one-step transition probabilities, the process retains…

We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…

We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with…

We study random walks on $\mathbb{Z}$ which have a linear (or almost linear) drift towards 0 in a range around 0. This drift leads to a metastable Gaussian distribution centered at zero. We give specific, fast growing, time windows where we…

We relate ergodic-theoretic properties of a very small tree or lamination to the behavior of folding and unfolding paths in Outer space that approximate it, and we obtain a criterion for unique ergodicity in both cases. Our main result is…

We use the language of proper CAT(-1) spaces to study thick, locally compact trees, the real, complex and quaternionic hyperbolic spaces and the hyperbolic plane over the octonions. These are rank 1 Euclidean buildings, respectively rank 1…

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4,…

In this paper, we study hyperbolic rational maps with finitely connected Fatou sets. We construct models of post-critically finite hyperbolic tree mapping schemes for such maps, generalizing post-critically finite rational maps in the case…

Let $(X,d)$ be a geodesic Gromov-hyperbolic space, $o \in X$ a basepoint and $\mu$ a countably supported non-elementary probability measure on $\operatorname{Isom}(X)$. Denote by $z_n$ the random walk on $X$ driven by the probability…

We study a model of multi-excited random walk with non-nearest neighbour steps on $\mathbb Z$, in which the walk can jump from a vertex $x$ to either $x+1$ or $x-i$ with $i\in \{1,2,\dots,L\}$, $L\ge 1$. We first point out the multi-type…

We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…

We show the equivalence of several characterizations of relative hyperbolicity for metric spaces, and obtain extra information about geodesics in a relatively hyperbolic space. We apply this to characterize hyperbolically embedded subgroups…

We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…

We study a random perturbation of the Euclidean plane, and show that it is unlikely that the distance-minimizing path between the two points can be extended into an infinite distance-minimizing path. More precisely, we study a large class…

Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…

The biased random walk on supercritical Galton--Watson trees is known to exhibit a multiscale phenomenon in the slow regime: the maximal displacement of the walk in the first $n$ steps is of order $(\log n)^3$, whereas the typical…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…