Related papers: Random skeletons in high-dimensional lattice trees

We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…

We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…

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…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…

In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…

A matrix random walk is a stochastic process of the form $B_k = (I+A_1)\cdots(I+A_k)$ where $A_j$ are independent ``step'' matrices in $\mathrm{M}_N(\mathbb{C})$. With the right entry-covariance, a rescaled matrix random walk converges to…

We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…

Recently, Holmes and Perkins identified conditions which ensure that for a class of critical lattice models the scaling limit of the range is the range of super-Brownian motion. One of their conditions is an estimate on a spatial moment of…

We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…

In this paper we consider two continuous-mass population models as analogues of logistic branching random walks, one is supported on a finite trait space and the other one is supported on an infinite trait space. For the first model with…

The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $\lambda$. There is a threshold for $\lambda$, which is called $\lambda_w$, that separates almost sure global extinction from global…

In this paper we investigate the survival probability, \theta_n, in high-dimensional statistical physical models, where \theta_n denotes the probability that the model survives up to time n. We prove that if the r-point functions scale to…

In a deterministic or random tree, a notion of ancestral diversity can be defined as follows. Sample independently $n$ groups of $k$ leaves and count the number $N_n(k)$ of distinct most recent common ancestors of each of the groups. As $n$…

We consider the randomly biased random walk on trees in the slow movement regime as in [HS16], whose potential is given by a branching random walk in the boundary case. We study the heavy range up to the $n$-th return to the root, i.e., the…

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

The behavior at criticality of spatial SIR (susceptible/infected/recovered) epidemic models in dimensions two and three is investigated. In these models, finite populations of size N are situated at the vertices of the integer lattice, and…

Study of random networks generally requires the nodes to be independently and uniformly distributed such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a…

We consider the simple random walk (or P\'olya walk) on the one-dimensional lattice subject to stochastic resetting to the origin with probability $r$ at each time step. The focus is on the joint statistics of the numbers…

We study a continuous-time branching random walk on the lattice $\mathbb{Z}^{d}$, $d\in \mathbb{N}$, with a single source of branching, that is the lattice point where the birth and death of particles can occur. The random walk is assumed…