Related papers: The Contact Process on Random Graphs and Galton-Wa…

We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…

In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…

In this paper we are concerned with the contact process on the squared lattice. The contact process intuitively describes the spread of the infectious disease on a graph, where an infectious vertex becomes healthy at a constant rate while a…

Let n points be placed independently in d-dimensional space according to the densities $f(x) = A_d e^{-\lambda \|x\|^{\alpha}}, \lambda > 0, x \in \Re^d, d \geq 2.$ Let $d_n$ be the longest edge length for the nearest neighbor graph on…

We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for…

Let $G=G(n,p_n)$ be a homogeneous Erd\"os-R\'enyi graph, and $A$ its adjacency matrix with eigenvalues $\lambda_1(A) \geq \lambda_2(A) \geq ... \geq \lambda_n(A).$ Local laws have been used to show that $lambda_2(A)$ can exhibit…

This article is concerned with a version of the contact process with sexual reproduction on a graph with two levels of interactions modeling metapopulations. The population is spatially distributed into patches and offspring are produced in…

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…

The members of Martin-L\"of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L\"of random Galton--Watson trees with survival parameter $\frac{2}{3}$. To be such a member, a…

We investigate the contact process on four different types of scale-free inhomogeneous random graphs evolving according to a stationary dynamics, where each potential edge is updated with a rate depending on the strength of the adjacent…

We study the contact process running in the one-dimensional lattice undergoing dynamical percolation, where edges open at rate $vp$ and close at rate $v(1-p)$. Our goal is to explore how the speed of the environment, $v$, affects the…

We study one specific version of the contact process on a graph. Here, we allow multiple infections carried by the nodes and include a probability of removing nodes in a graph. The removal probability is purely determined by the number of…

This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…

Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…

We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…

We work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…

Population genetic processes, such as the adaptation of a quantitative trait to directional selection, may occur on longer time scales than the sweep of a single advantageous mutation. To study such processes in finite populations,…

We consider the discrete-time threshold-$\theta \ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \theta occupied neighbors at time t will be occupied at time t+1 with probability p,…