Related papers: Pathwise construction of tree-valued Fleming-Viot …
We first prove that for all compact metrizable spaces, there exists a topological embedding of the compact metrizable space into each of the sets of compact metric spaces which are connected, path-connected, geodesic, or CAT(0), in the…
We present a genealogy for superprocesses with a non-homogeneous quadratic branching mechanism, relying on a weighted version of the superprocess and a Girsanov theorem. We then decompose this genealogy with respect to the last individual…
We introduce new methods for phylogenetic tree quartet construction by using machine learning to optimize the power of phylogenetic invariants. Phylogenetic invariants are polynomials in the joint probabilities which vanish under a model of…
Consider an arbitrary large population at the present time, originated at an unspecified arbitrary large time in the past, where individuals in the same generation reproduce independently, forward in time, with the same offspring…
We prove gradient estimates for harmonic functions with respect to a $d$-dimensional unimodal pure-jump Levy process under some mild assumptions on the density of its Levy measure. These assumptions allow for a construction of an unimodal…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
For any real-valued stochastic process X with c\`adl\`ag paths we define non-empty family of processes, which have finite total variation, have jumps of the same order as the process X and uniformly approximate its paths: This allows to…
We study the large scale behaviour of a population consisting of two types which evolve in dimension d = 1, 2 according to a spatial Lambda- Fleming-Viot process subject to random time-independent selection. If one of the two types is rare…
In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…
We consider the spatial Lambda-Fleming-Viot process model for frequencies of genetic types in a population living in R^d, in the special case in which there are just two types of individual, labelled 0 and 1. At time zero, everyone in the…
The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a…
We analyze models of genome evolution based on both restricted and unrestricted double-cut-and-join (DCJ) operations. We compare the number of operations along the evolutionary trajectory to the DCJ distance of the genome from its ancestor…
We discuss an impact of various (path-wise) reflection-from-the barrier scenarios upon confining properties of a paradigmatic family of symmetric $\alpha $-stable L\'{e}vy processes, whose permanent residence in a finite interval on a line…
Gromov-Hausdorff (GH) distance is a natural way to measure the distortion between two metric spaces. However, there has been only limited algorithmic development to compute or approximate this distance. We focus on computing the…
Complex processes ranging from protein folding to nuclear fission often follow a low-dimension reaction path parameterized in terms of a few collective variables. In nuclear theory, variables related to the shape of the nuclear density in a…
In this paper, we study the cut-off phenomenon under the total variation distance of $d$-dimensional Ornstein-Uhlenbeck processes which are driven by L\'evy processes. That is to say, under the total variation distance, there is an abrupt…
In the present paper we investigate geometric characteristics of compact metric spaces, which can be described in terms of Gromov-Hausdorff distances to simplexes, i.e., to finite metric spaces such that all their nonzero distances are…
In this work, we present a simple and efficient generator of polymeric linear chains, based on a random self-avoiding walk process. The chains are generated using a discrete process of growth, in cubic networks and in a finite time, without…
We use the method of atomic decomposition to build new families of function spaces, similar to Besov spaces, in measure spaces with grids, a very mild assumption. Besov spaces with low regularity are considered in measure spaces with good…
We show uniqueness of the spine of a Fleming-Viot particle system under minimal assumptions on the driving process. If the driving process is a continuous time Markov process on a finite space, we show that asymptotically, when the number…