相关论文: Random Walk in a Random Environment and First-Pass…

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 study a spatial model of random permutations on trees with a time parameter $T>0$, a special case of which is the random stirring process. The model on trees was first analysed by Bj\"ornberg and Ueltschi[BU16], who established the…

We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…

We revisit the problem of Brownian diffusion with drift in order to study finite-size effects in the geometric Galton-Watson branching process. This is possible because of an exact mapping between one-dimensional random walks and geometric…

The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase…

This paper studies a class of growing systems of random walks on regular trees, known as \emph{frog models with geometric lifetime} in the literature. With the help of results from renewal theory, we derive new bounds for their critical…

We prove a law of large numbers for the range of rotor walks with random initial configuration on regular trees and on Galton-Watson trees. More precisely, we show that on the classes of trees under consideration, even in the case when the…

We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…

We prove that supercritical branching random walk on a transient graph converges almost surely under rescaling to a random measure on the Martin boundary of the graph. Several open problems and conjectures about this limiting measure are…

We consider random walks indexed by arbitrary finite random or deterministic trees. We derive a simple sufficient criterion which ensures that the maximal displacement of the tree-indexed random walk is determined by a single large jump.…

Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…

In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n)…

We study a generalized branching random walk where particles breed at a rate which depends on the number of neighboring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population…

We consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$ and consider a simple symmetric random walk that is killed upon hitting one of the obstacles. For $d \geq 2$ and $p$ strictly above the critical…