Related papers: The Contact Process on Periodic Trees
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
The supercritical series expansion of the survival probability for the one-dimensional contact process in heterogeneous and disordered lattices is used for the evaluation of the loci of critical points and critical exponents $\beta$. The…
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…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
The atom-bond connectivity (ABC) index is a degree-based molecular descriptor that found diverse chemical applications. Characterizing trees with minimum ABC-index remained an elusive open problem even after serious attempts and is…
We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…
The long-time dynamics of the critical contact process which is brought suddenly out of an uncorrelated initial state undergoes ageing in close analogy with quenched magnetic systems. In particular, we show through Monte Carlo simulations…
This work examines the global dynamics of classical solutions of a two-stage (juvenile-adult) reaction-diffusion population model in time-periodic and spatially heterogeneous environments. It is shown that the sign of the principal…
We study a spatial model of random permutations on trees with a time parameter $T>0$, a special case of which is the random stirring process. The model on trees was first analysed by Bj\"ornberg and Ueltschi[BU16], who established the…
We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…
We introduce a method to prove metastability of the contact process on Erd\H{o}s-R\'enyi graphs and on configuration model graphs. The method relies on uniformly bounding the total infection rate from below, over all sets with a fixed…
We introduce a model for a population on a lattice with diffusion and birth/death according to 2A->3A and A->0 for a particle A. We find that the model displays a phase transition from an active to an absorbing state which is continuous in…
In this paper, we introduce a type switching mechanism for the Contact Process on the lattice $\mathbb{Z}^d$. That is, we allow the individual particles/sites to switch between two (or more) types independently of one another, and the…
A central quantity of importance for ultracold atoms is contact, which measures two-body correlations at short distances in dilute systems. It appears in universal relations among thermodynamic quantities, such as large momentum tails,…
A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $\lambda = \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a…
We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with…
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…