Related papers: Characterization of the critical values of branchi…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

We prove an invariance principle for a general class of continuous time critical branching processes with finite variance (non-local) branching mechanism. We show that the genealogical trees, viewed as random compact metric measure spaces,…

We study a branching random walk with independent and identically distributed, heavy tailed displacements. The offspring law is supercritical and satisfies the Kesten-Stigum condition. We treat the case when the law of the displacements…

A scaling limit for the simple random walk on the largest connected component of the Erdos-Renyi random graph in the critical window is deduced. The limiting diffusion is constructed using resistance form techniques, and is shown to satisfy…

This work extends the studies on the minimum and extremal process of a supercritical branching random walk outside the boundary case which cannot be reduced to the boundary case. We study here the situation where the log-generating function…

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 supercritical Galton-Watson branching process with immigration. It is well known that under suitable conditions on the offspring and immigration distributions, there is a finite, strictly positive limit ${\mathcal{W}}$ for the…

We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.

We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the…

The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

In this article, we consider a branching random walk on the real-line where displacements coming from the same parent have jointly regularly varying tails. The genealogical structure is assumed to be a supercritical Galton-Watson tree,…

We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by…

Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in i.i.d. random environment, $Z_{r,n}$ be the number of particles in the process at moment $0\leq r\leq n-1$ that have a positive number of descendants in generation…

A Galton-Watson branching process with immigration evolving in a random environment is considered. Its associated random walk is assumed to be oscillating. We prove a functional limit theorem in which the process under consideration is…

We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In…

We prove an invariance principle for linearly edge reinforced random walks on $\gamma$-stable critical Galton-Watson trees, where $\gamma \in (1,2]$ and where the edge joining $x$ to its parent has rescaled initial weight $d(\rho,…

We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…

We are interested in the survival probability of a population modeled by a critical branching process in an i.i.d. random environment. We assume that the random walk associated with the branching process is oscillating and satisfies a…

Consider a discrete-time supercritical discounted branching random walk, in which increments at depth $k$ are independent and identically distributed with the same law as $m^{-kH}Y$, where $Y$ has a fixed law, $H>0$, and $m>1$ is the…