Related papers: The frog model with death revisited

Let $P \subseteq \mathbb{R}^2$ be a set of points and $T$ be a spanning tree of $P$. The \emph{stabbing number} of $T$ is the maximum number of intersections any line in the plane determines with the edges of $T$. The \emph{tree stabbing…

The problem of reconstructing the drift of a diffusion in $\erre^d$, $d\geq 2$, from the transition probability density observed outside a domain is considered. The solution of this problem also solves a new inverse problem for a class of…

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

The escape probability $\xi_{x}$ from a site $x$ of a one-dimensional disordered lattice with trapping is treated as a discrete dynamical evolution by random iterations over nonlinear maps parametrized by the right and left jump…

A random walk on a regular tree (or any non-amenable graph) has positive speed. We ask whether such a walk can be slowed down by applying carefully chosen time-dependent permutations of the vertices. We prove that on trees the random walk…

We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…

We study the ergodic theory of a multitype contact process with equal death rates and unequal birth rates on the $d$-dimensional integer lattice and regular trees. We prove that for birth rates in a certain interval there is coexistence on…

Tree-based ensemble methods, as Random Forests and Gradient Boosted Trees, have been successfully used for regression in many applications and research studies. Furthermore, these methods have been extended in order to deal with uncertainty…

A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the accumulated in-degree of the vertex and a new vertex is…

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 prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

We propose the following simple stochastic model for phylogenetic trees. New types are born and die according to a birth and death chain. At each birth we associate a fitness to the new type sampled from a fixed distribution. At each death…

Consider a birth and death chain to model the number of types of a given virus. Each type gives birth to a new type at rate $\lambda$ and dies at rate 1. Each type is also assigned a fitness. When a death occurs either the least fit type…

We consider a system of interacting random walks known as the frog model. Let $\mathcal{K}_n=(\mathcal{V}_n,\mathcal{E}_n)$ be the complete graph with $n$ vertices and $o\in\mathcal{V}_n$ be a special vertex called the root. Initially,…

We prove an invariance principle for the bridge of a random walk conditioned to stay positive, when the random walk is in the domain of attraction of a stable law, both in the discrete and in the absolutely continuous setting. This includes…

We study the death and restoration of collective oscillations in networks of oscillators coupled through random-walk diffusion. Differently than the usual diffusion coupling used to model chemical reactions, here the equilibria of the…

The drift-barrier hypothesis states that random genetic drift constrains the refinement of a phenotype under natural selection. The influence of effective population size and the genome-wide deleterious mutation rate were studied…

We establish long-range order for the hard-core model on a finite, regular bipartite graph above a threshold fugacity given in terms of expansion parameters of the graph. The result applies to the $d$-dimensional hypercube graph and, more…

Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…

Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away' observations. Several theoretical results (and simple algorithms) are available when…