Related papers: On the boundary at infinity for branching random w…

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…

In this paper, we study the random walk on a supercritical branching process with an uncountable and unbounded set of types supported on the $d$-regular tree $\mathbb{T}_d$ ($d\geq 3$), namely the cluster $\mathcal{C}_\circ^h$ of the root…

We focus on the existence and its characterization of limit for a certain critical branching random walks in time-space random environment in 1 dimension which was introduced by Birkner et.al. Each particle performs simple random walk on…

We give the exact solution to the problem of a random walk on the Bethe lattice through a mapping on an asymmetric random walk on the half-line. We also study the continuous limit of this model, and discuss in detail the relation between…

In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…

We construct a bounded degree graph $G$, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

We consider a branching random walk on the line. Biggins and Kyprianou [6] proved that, in the boundary case, the associated derivative martingale converges almost surly to a finite nonnegative limit, whose law serves as a fixed point of a…

It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.

We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

We continue our study of critical branching random walk and branching capacity. In this paper we introduce branching recurrence and branching transience and prove an analogous version of Wiener's Test.

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

We consider the precise upper large deviations estimates for the maximal displacement of a branching random walk. In addition, we obtain a description of the extremal process of the branching random walk conditioned on this large deviations…

The complete representation of the Martin compactification for reflected random walks on a half-space $\Z^d\times\N$ is obtained. It is shown that the full Martin compactification is in general not homeomorphic to the ``radial''…

Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk…

In this article we consider transient random walks on free products of graphs. We prove that the asymptotic range of these random walks exists and is strictly positive. In particular, we show that the range varies real-analytically in terms…

Let (Zn) be a branching process with immigration in an independent and identically distributed random environment. Under necessary moment conditions, we show the exact convergence rate in the central limit theorem on logZn by using the…

We study limit laws for simple random walks on supercritical long-range percolation clusters on the integer lattice. For the long range percolation model, the probability that two vertices are connected behaves asymptotically as a negative…

In this paper, we show that the frontier of planar random walk converges weakly under natural parametrization to that of planar Brownian motion. As an intermediate result, we also show the convergence of the renormalized occupation measure.

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…