Related papers: A geometric representation of fragmentation proces…
In a supercritical branching particle system, the trimmed tree consists of those particles which have descendants at all times. We develop this concept in the superprocess setting. For a class of continuous superprocesses with Feller…
We propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND -- sparsified Nested Dissection. It is based on nested dissection, sparsification and low-rank compression. After…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
Motivated by a down-up Markov chain on cladograms, David Aldous conjectured in 1999 that there exists a "diffusion on continuum trees" whose mass partitions at any finite number of branch points evolve as Wright-Fisher diffusions with some…
Metabolites, small molecules that are involved in cellular reactions, provide a direct functional signature of cellular state. Untargeted metabolomics experiments usually relies on tandem mass spectrometry to identify the thousands of…
We consider the height process of a Levy process with no negative jumps, and its associated continuous tree representation. Using Levy snake tools developed by Duquesne and Le Gall, with an underlying Poisson process, we construct a…
We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…
We investigate fragmentation processes with a steady input of fragments. We find that the size distribution approaches a stationary form which exhibits a power law divergence in the small size limit, P(x) ~ x^{-3}. This algebraic behavior…
We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…
We consider fragmentations of an R-tree $T$ driven by cuts arriving according to a Poisson process on $T \times [0, \infty)$, where the first co-ordinate specifies the location of the cut and the second the time at which it occurs. The…
Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to…
We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with $n$ vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of…
Current all-orders proofs of factorization of hard processes are made by extracting the leading power behavior of Feynman graphs, i.e., by extracting asymptotics strictly order-by-order in perturbation theory. The resulting parton densities…
In a deterministic or random tree, a notion of ancestral diversity can be defined as follows. Sample independently $n$ groups of $k$ leaves and count the number $N_n(k)$ of distinct most recent common ancestors of each of the groups. As $n$…
We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from…
Given a general critical or sub-critical branching mechanism and its associated L\'evy continuum random tree, we consider a pruning procedure on this tree using a Poisson snake. It defines a fragmentation process on the tree. We compute the…
This work is the first step towards a description of the Gromov boundary of the free factor graph of a free product, with applications to subgroup classification for outer automorphisms. We extend the theory of algebraic laminations dual to…
We investigate thermalization and symmetry-breaking in a nonlinear stochastic Klein-Gordon equation on a spatial lattice, taking into account damping, nonlinear interaction, and stochastic forcing terms reduced by a perturbative solution…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…