相关论文: Colored Coalescent Theory
We develop a probabilistic technique for colorizing grayscale natural images. In light of the intrinsic uncertainty of this task, the proposed probabilistic framework has numerous desirable properties. In particular, our model is able to…
This paper extends earlier work by Cox and Durrett, who studied the coalescence times for two lineages in the stepping stone model on the two-dimensional torus. We show that the genealogy of a sample of size n is given by a time change of…
Species networks generalize the notion of species trees to allow for hybridization or other lateral gene transfer. Under the Network Multispecies Coalescent Model, individual gene trees arising from a network can have any topology, but…
$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…
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 revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…
Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…
Given two colorings of a graph, we consider the following problem: can we recolor the graph from one coloring to the other through a series of elementary changes, such that the graph is properly colored after each step? We introduce the…
In the Kingman coalescent tree the length of order $r$ is defined as the sum of the lengths of all branches that support $r$ leaves. For $r=1$ these branches are external, while for $r\ge2$ they are internal and carry a subtree with $r$…
The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic chromatic index} is the analogous graph parameter for edge…
We study a genealogical model for continuous-state branching processes with immigration with a (sub)critical branching mechanism. This model allows the immigrants to be on the same line of descent. The corresponding family tree is an…
We investigate the genealogy of a sample of $k\geq1$ particles chosen uniformly without replacement from a population alive at large times in a critical discrete-time Galton-Watson process in a varying environment (GWVE). We will show that…
We investigate the $\Lambda$-Seed-Bank-Wright-Fisher process, a model describing allele frequency dynamics in populations exhibiting both skewed offspring distributions and dormancy. By performing a change of measure, we condition this…
We study a class of coalescents derived from a sampling procedure out of N i.i.d. Pareto(alpha) random variables, normalized by their sum, including beta-size-biasing on total length effects (beta < alpha). Depending on the range of alpha,…
Representation of coalescent process using pruning of trees has been used by Goldschmidt and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the $\beta(3/2,1/2)$-coalescent. By considering a pruning procedure on…
Cancer progression is an evolutionary process that is driven by mutation and selection in a population of tumor cells. We discuss mathematical models of cancer progression, starting from traditional multistage theory. Each stage is…
We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors' weights. We present a…
The ability to estimate the rate of convergence for the distributions of regenerative processes is in great demand. These processes are often encountered in queuing theory and in related problems. In some papers on regenerative processes,…
The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…
The broadcasting models on a d-ary tree T arise in many contexts such as biology, information theory, statistical physics and computer science. We consider the k-colouring model, i.e. the root of T is assigned an arbitrary colour and,…