Related papers: Frog models on trees through renewal theory
In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs), known as frog model. The dynamics of this process is described as follows: There are some active particles, which perform independent SRWs, and sleeping…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove…
We provide sufficient conditions for the validity of a dichotomy, i.e. zero-one law, between recurrence and transience of general frog models. In particular, the results cover frog models with i.i.d. numbers of frogs per site where the frog…
By unifying three foundational principles of modern biology, we develop a mathematical framework to analyze the growing tree of life. Contrary to the static case, where the analogy between phylogenetic trees and the tree that grows in soil…
We study a system of interacting renewal processes which is a model for neuronal activity. We show that the system possesses an exponentially large number (with respect to the number of neurons in the network) of limiting configurations of…
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 study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…
Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong…
The frog model is a system of random walks where active particles set sleeping particles in motion. On the complete graph with n vertices it is equivalent to a well-understood rumor spreading model. We given an alternate and elementary…
In this paper we present a recurrence criterion for the frog model on $\mathbb{Z}^d$ with an i.i.d. initial configuration of sleeping frogs and such that the underlying random walk has a drift to the right.
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We continue to study (see arXiv:2401.08618, https://doi.org/10.48550/arXiv.2401.08618) a renewal equation $\phi(t)=\frak F\phi_t$ proposed in [C. Barril et al., J. Math. Biology, https://doi.org/10.1007/s00285-024-02084-x] to model trees…
We consider an interacting particle system on trees known as the frog model: initially, a single active particle begins at the root and i.i.d.~$\mathrm{Poiss}(\lambda)$ many inactive particles are placed at each non-root vertex. Active…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
We introduce regenerative tree growth processes as consistent families of random trees with n labelled leaves, n>=1, with a regenerative property at branch points. This framework includes growth processes for exchangeably labelled Markov…