相关论文: Distance-dependent chase-escape on trees
Motivated as a null model for comparison with data, we study the following model for a phylogenetic tree on $n$ extant species. The origin of the clade is a random time in the past, whose (improper) distribution is uniform on $(0,\infty)$.…
We consider random walks indexed by arbitrary finite random or deterministic trees. We derive a simple sufficient criterion which ensures that the maximal displacement of the tree-indexed random walk is determined by a single large jump.…
This thesis presents analysis of the properties and run-time of the Rapidly-exploring Random Tree (RRT) algorithm. It is shown that the time for the RRT with stepsize $\epsilon$ to grow close to every point in the $d$-dimensional unit cube…
We study a discrete host-parasitoid system where the host population follows the classical Ricker functional form and is also subject to Allee effects. We determine basins of attraction of the local attractors of the single population model…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
The purpose of this paper is to implement a random death process into a persistent random walk model which produces subballistic superdiffusion (L\'{e}vy walk). We develop a Markovian model of cell motility with the extra residence variable…
We study evolution equations governed by an averaging operator on a directed tree, showing existence and uniqueness of solutions. In addition we find conditions of the initial condition that allows us to find the asymptotic decay rate of…
We study the following growth model on a regular d-ary tree. Points at distance n adjacent to the existing subtree are added with probabilities proportional to alpha^{-n}, where alpha<1 is a positive real parameter. The heights of these…
In this paper we consider two branching processes living in a joint random environment. Assuming that both processes are critical we address the following question: What is the probability that both populations survive up to a large time…
Consider the following interacting particle system on the $d$-ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake…
We define a notion of stochastic domination between trees, where one tree dominates another if when the vertices of each are labeled with independent, identically distributed random variables, one tree is always more likely to contain a…
In this paper, we focus on susceptible-infected-susceptible dynamics on metapopulation networks, where nodes represent subpopulations, and where agents diffuse and interact. Recent studies suggest that heterogeneous network structure…
In the present paper, we determine the full spectrum of the simple random walk on finite, complete $d$-ary trees. We also find an eigenbasis for the transition matrix. As an application, we apply our results to get a lower bound for the…
We consider a population of particles with unit life length. Dying each particle produces offspring whose size depends on the random environment specifying the reproduction law of all particles of the given generation and on the number of…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
In this paper we define a novel edit distance for merge trees, which we argue to be suitable for a good range of applications. Relying also on some technical results contained in other works, we investigate its stability properties, which…
In this work we define a novel edit distance for trees considered with some abstract weights on the edges. The metric is driven by the idea of considering trees as topological summaries in the context of persistence and topological data…
Interacting populations often create complicated spatiotemporal behavior, and understanding it is a basic problem in the dynamics of spatial systems. We study the two-species case by simulations of a host--parasitoid model. In the case of…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…