Related papers: Connectivity properties of Branching Interlacement…

In this article, we consider a Branching Random Walk on the real line. The genealogical structure is assumed to be given through a supercritical branching process in the i.i.d. environment and satisfies the Kesten-Stigum condition. The…

We investigate a class of line ensembles whose local structure is described by independent geometric random walk bridges, which have been conditioned to interlace with each other. The latter arise naturally in the context Schur processes,…

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…

This thesis investigates critical phenomena and equilibrium states in various stochastic models through three interconnected studies. In the first chapter, we analyze the Activated Random Walk model on a one-dimensional ring in the…

In this paper, we introduce a novel model for random hypergraphs based on weighted random connection models. In accordance with the standard theory for hypergraphs, this model is constructed from a bipartite graph. In our stochastic model,…

The food web is a directed graph in which nodes label species and directed links represent the predation between species. The cascade model generates random food webs. The continuum cascade model is a Poisson approximation of the cascade…

We present a general method to calculate the connected correlation function of random Ising chains at zero temperature. This quantity is shown to relate to the surviving probability of some one-dimensional, adsorbing random walker on a…

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

The lonely branching random walks on ${\mathbb Z}^d$ is an interacting particle system where each particle moves as an independent random walk and undergoes critical binary branching when it is alone. We show that if the symmetrized walk is…

The effect of blocking between different species occurring in one dimension is investigated here numerically in the case of particles following branching and annihilating random walk with two offsprings. It is shown that two-dimensional…

We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube…

We consider a branching random walk in a random space-time environment of disasters where each particle is killed when meeting a disaster. This extends the model of the "random walk in a disastrous random environment" introduced by [15]. We…

We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…

For a general class of percolation models with long-range correlations on $\mathbb Z^d$, $d\geq 2$, introduced in arXiv:1212.2885, we establish regularity conditions of Barlow arXiv:math/0302004 that mesoscopic subballs of all large enough…

Extreme events such as earthquakes, floods, and power blackouts often display burst phenomena where multiple extreme events occur in quick succession or in bunches. This study examines bunching of extreme events on a complex network using a…

The Brownian Web (BW) is a family of coalescing Brownian motions starting from every point in space and time $\R\times\R$. It was first introduced by Arratia, and later analyzed in detail by T\'{o}th and Werner. More recently, Fontes,…

We study branching random walk on $\mathbb{Z}$ in a bounded i.i.d. random environment. For this process, we prove that, for almost every realization of the environment, the distributions of the maximally displaced particle (re-centered…

The contact process is a simple model for the spread of an infection in a structured population. We investigate the case when the underlying structure evolves dynamically as a degree-dependent dynamical percolation model. Starting with a…

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…