Related papers: A multiplicative coalescent with asynchronous mult…
Longitudinal molecular data of rapidly evolving viruses and pathogens provide information about disease spread and complement traditional surveillance approaches based on case count data. The coalescent is used to model the genealogy that…
We study systems of particles on a line which have a maximum, are locally finite and evolve with independent increments. ``Quasi-stationary states'' are defined as probability measures, on the \sigma-algebra generated by the gap variables,…
We study the existence of densities for distributions of piecewise deterministic Markov processes. We also obtain relationships between invariant densities of the continuous time process and that of the process observed at jump times. In…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
The Mittag-Leffler process $X=(X_t)_{t\ge 0}$ is introduced. This Markov process has the property that its marginal random variables $X_t$ are Mittag-Leffler distributed with parameter $e^{-t}$, $t\in [0,\infty)$, and the semigroup…
$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…
We introduce a new version of particle filter in which the number of "children" of a particle at a given time has a Poisson distribution. As a result, the number of particles is random and varies with time. An advantage of this scheme is…
We study the masses of blocks of the $\Lambda$-coalescent with dust and some aspects of their large and small time behaviors. To do so, we start by associating the $\Lambda$-coalescent to a nested interval-partition constructed from the…
We consider finite state, discrete-time, mixing Markov chains $(V,P)$, where $V$ is the state space and $P$ is transition matrix. To each such chain $(V,P)$, we associate a sequence of chains $(V_n,P_n)$ by coding trajectories of $(V,P)$…
We construct a Markov process model to describe the evolution of labor division and its dynamical behavior is investigated by numerical simulations in detail. We have shown that under the mechanism of increasing returns, the division of…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
In this paper, we develop some matrix Poisson's equations satisfied by the mean and variance of the mixing time in an irreducible positive-recurrent discrete-time Markov chain with infinitely-many levels, and provide a computational…
I show how to run an N-time-step Markov chain simulation in a circular fashion, so that the state at time 0 follows the state at time N-1 in the same way as states at times t follow those at times t-1 for 0<t<N. This wrap-around of the…
In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We study several fundamental properties of a class of stochastic processes called spatial Lambda-coalescents. In these models, a number of particles perform independent random walks on some underlying graph G. In addition, particles on the…
We investigate the infinitely many demes limit of the genealogy of a sample of individuals from a subdivided population subject to sporadic mass extinction events. By exploiting a separation of timescales property of Wright's island model,…
For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for…
Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…
The nested Kingman coalescent describes the dynamics of particles (called genes) contained in larger components (called species), where pairs of species coalesce at constant rate and pairs of genes coalesce at constant rate provided they…