Related papers: The Contact Process on Periodic Trees

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 propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise the phase boundary by the existence of a metastable density,…

We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…

We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability…

We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…

The critical beta-splitting tree, introduced by Aldous, is a Markov branching phylogenetic tree. Aldous and Pittel recently proved, amongst other results, a central limit theorem for the height of a random leaf. We give an alternative…

We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…

We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by $d$. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of…

We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to…

For a graph $G$, let $\lambda_1(G)$ and $\lambda_2(G)$ denote the largest and the second largest adjacency eigenvalue of $G$. The sum $\lambda_1(G) + \lambda_2(G)$ is called the \emph{spectral sum} of $G$. We investigate the spectral sum of…

We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…

We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than standard search…

This paper studies contact processes on general countable groups. It is shown that any such contact process has a well-defined exponential growth rate, and this quantity is used to study the process. In particular, it is proved that on any…

We consider the frog model with geometric lifetime (parameter $1-p$) on homogeneous trees of dimension $d$. In 2002, \cite{alves2002-2} proved that there exists a critical lifetime parameter $p_c\in(0,1)$ above which infinitely many frogs…

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 two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…

Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…

In this paper we study the metastability of the contact process on a random regular graph. We show that the extinction time of the contact process, when initialized so that all vertices are infected at time 0, grows exponentially with the…

For $n$-vertex, $d$-dimensional lattices $\Lambda$ with $d \ge 2$, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present an exact closed-form result for the…

The value of an American option is the maximized value of the discounted cash flows from the option. At each time step, one needs to compare the immediate exercise value with the continuation value and decide to exercise as soon as the…