Related papers: Characterization of the critical values of branchi…
We study a branching random walk on $\r$ with an absorbing barrier. The position of the barrier depends on the generation. In each generation, only the individuals born below the barrier survive and reproduce. Given a reproduction law,…
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks find the target within a finite time when b>b_c. For b<b_c,…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
We consider a branching-selection particle system on the real line. In this model the total size of the population at time $n$ is limited by $\exp\left(a n^{1/3}\right)$. At each step $n$, every individual dies while reproducing…
We consider a critical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We are interested in the event $\mathcal{A}_i(n)$ that all individuals alive at time $n$ are offspring of the…
In this paper, we study a new discrete tree and the resulting branching process, which we call the \textbf{E}rlang \textbf{W}eighted \textbf{T}ree(\textbf{EWT}). The EWT appears as the local weak limit of a random graph model proposed…
The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…
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.
Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after $n$ steps behaves in probability like ${3\over 2} \log n$ when $n\to \infty$.…
Let $\mathcal{T}$ be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean $\mu >1$, conditioned to survive. Let $\varphi_{\mathcal{T}}$ be a random embedding of $\mathcal{T}$ into $\mathbb{Z}^d$ according…
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
We consider a branching random walk with an absorbing barrier, where the step of the associated one-dimensional random walk is in the domain of attraction of an $\alpha$-stable law with $1<\alpha<2$. We shall prove that there is a barrier…
In this article we continue the study of the quenched distributions of transient, one-dimensional random walks in a random environment. In a previous article we showed that while the quenched distributions of the hitting times do not…
In this paper we prove that, under the assumption of quasi-transitivity, if a branching random walk on ${{\mathbb{Z}}^d}$ survives locally (at arbitrarily large times there are individuals alive at the origin), then so does the same process…
We consider a class of multitype Galton-Watson branching processes with a countably infinite type set $\mathcal{X}_d$ whose mean progeny matrices have a block lower Hessenberg form. For these processes, the probability $\boldsymbol{q}(A)$…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Random walk centrality is a fundamental metric in graph mining for quantifying node importance and influence, defined as the weighted average of hitting times to a node from all other nodes. Despite its ability to capture rich graph…
Let $T$ be the extinction moment of a critical branching process $Z=(Z_{n},n\geq 0) $ in a random environment specified by iid probability generating functions. We study the asymptotic behavior of the probability of extinction of the…
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…
In this article, we study linearly edge-reinforced random walk on general multi-level ladders for large initial edge weights. For infinite ladders, we show that the process can be represented as a random walk in a random environment, given…