Related papers: Approximating critical parameters of branching ran…
Consider a supercritical branching random walk in a time-inhomogeneous random environment. We impose a selection (called barrier) on survival in the following way. The position of the barrier may depend on the generation and the…
In this paper we consider two branching processes living in a joint random environment. Assuming that both processes are critical we address the following question: What is the probability that both populations survive up to a large time…
It is well known that the behaviour of a branching process is completely described by the generating function of the offspring law and its fixed points. Branching random walks are a natural generalization of branching processes: a branching…
We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…
We consider random walks in dynamic random environments and propose a criterion which, if satisfied, allows to decompose the random walk trajectory into i.i.d. increments, and ultimately to prove limit theorems. The criterion involves the…
We prove a {\it{quenched}} large deviation principle (LDP) for a simple random walk on a supercritical percolation cluster (SRWPC) on $\mathbb Z^d$ ($d\geq 2$). The models under interest include classical Bernoulli bond and site percolation…
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
For the supercritical Bernoulli bond percolation on $\mathbb{Z}^d$ ($d \geq 2$), we give a coupling between the random walk on the infinite cluster and its limit Brownian motion, such that the maximum distance between the paths during…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
We study the limiting behaviors of a generalized elephant random walk on the integer lattice. This random walk is defined by using two sequences of parameters expressing the memory at each step from the whole past and the drift of each step…
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 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…
We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha\in(1,2]$. We consider the critical Bernoulli bond…
We consider connectivity properties of the Branching Interlacements model in $\mathbb{Z}^d,~d\ge5$, recently introduced by Angel, R\'ath and Zhu in 2016. Using stochastic dimension techniques we show that every two vertices visited by the…
The eigenvalue spectra of the transition probability matrix for random walks traversing critically disordered clusters in three different types of percolation problems show that the random walker sees a developing Euclidean signature for…
We consider a random walk amongst positive random conductances on $\mathbb{Z}^d, d \ge 2$, with directional bias. When the conductances have a stable distribution with parameter $\gamma \in (0, 1)$, the walk is sub-ballistic. In this regime…
We investigate a branching random walk where the displacements are independent from the branching mechanism and have a stretched exponential distribution. We describe the positions of the particles in the vicinity of the rightmost particle…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…