Related papers: Branching random walks and contact processes on Ga…
We consider a discrete-time host-parasite model for a population of cells which are colonized by proliferating parasites. The cell population grows like an ordinary Galton-Watson process, but in reflection of real biological settings the…
Branching processes pervade many models in statistical physics. We investigate the survival probability of a Galton-Watson branching process after a finite number of generations. We reveal the finite-size scaling law of the survival…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
We consider a subcritical Galton--Watson tree conditioned on having $n$ vertices with outdegree in a fixed set $\Omega$. Under mild regularity assumptions we prove various limits related to the maximal offspring of a vertex as $n$ tends to…
We consider a particle system in continuous time, discrete population, with spatial motion and nonlocal branching. The offspring's weights and their number may depend on the mother's weight. Our setting captures, for instance, the processes…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
In this paper we are concerned with the contact process with random recovery rates and edge weights on complete graph with $n$ vertices. We show that the model has a critical value which is inversely proportional to the product of the mean…
We establish a general sufficient condition for a sequence of Galton Watson branching processes in varying environment to converge weakly. This condition extends previous results by allowing offspring distributions to have infinite…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
Let $\left\{ S_{n},n\geq 0\right\} $ be a random walk whose increment distribution belongs without centering to the domain of attraction of an $% \alpha $-stable law, i.e., there are some scaling constants $a_{n}$ such that the sequence…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
We present two iterative methods for computing the global and partial extinction probability vectors for Galton-Watson processes with countably infinitely many types. The probabilistic interpretation of these methods involves truncated…
We consider the critical branching processes in correlated random environment which is positively associated and study the probability of survival up to the n-th generation. Moreover, when the environment is given by fractional Brownian…
Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
Consider a random walk on a tree $G=(V,E)$. For $v,w \in V$, let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at $v$ to reach $w$, and let $\pi_v = \mathrm{deg}(v)/2|E|$ denote the…
We consider the behaviour of minimax recursions defined on random trees. Such recursions give the value of a general class of two-player combinatorial games. We examine in particular the case where the tree is given by a Galton-Watson…