Related papers: Coagulation, non-associative algebras and binary t…
We establish precise bounds on cumulants for a rather general class of non-linear geometric functionals satisfying the stabilization property under a simple, stationary (marked) point process admitting fast decay of its correlation…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
We report a number of exact solutions for temperature-dependent Smoluchowski equations. These equations quantify the ballistic agglomeration, where the evolution of densities of agglomerates of different size is entangled with the evolution…
We describe a basic framework for studying dynamic scaling that has roots in dynamical systems and probability theory. Within this framework, we study Smoluchowski's coagulation equation for the three simplest rate kernels $K(x,y)=2$, $x+y$…
This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…
We study the enumeration of spinal tree-child phylogenetic networks, a rigid family of tree-child networks in which all internal vertices lie on a single root--to--leaf path. We provide two complementary combinatorial frameworks. First, we…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…
We consider self-similar solutions of Smoluchowski's coagulation equation with a diagonal kernel of homogeneity $\gamma < 1$. We show that there exists a family of second-kind self-similar solutions with power-law behavior $x^{-(1+\rho)}$…
We design exact polynomial expansions of a class of Feynman--Kac particle distributions. These expansions are finite and are parametrized by coalescent trees and other related combinatorial quantities. The accuracy of the expansions at any…
We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages…
We consider self-similar solutions with finite mass to Smoluchowski's coagulation equation for rate kernels that have homogeneity zero but are possibly singular such as Smoluchowski's original kernel. We prove pointwise exponential decay of…
In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
We consider the multicomponent Smoluchowski coagulation equation under non-equilibrium conditions induced either by a source term or via a constant flux constraint. We prove that the corresponding stationary non-equilibrium solutions have a…
Existence and non-existence of integrable stationary solutions to Smoluchowski's coagulation equation with source are investigated when the source term is integrable with an arbitrary support in (0, $\infty$). Besides algebraic upper and…
Processing sentence constituency trees in binarised form is a common and popular approach in literature. However, constituency trees are non-binary by nature. The binarisation procedure changes deeply the structure, furthering constituents…
Uniqueness of mass-conserving self-similar solutions to Smoluchowski's coagulation equation is shown when the coagulation kernel $K$ is given by $K(x,x\_*)=2(x x\_*)^{-\alpha}$, $(x,x\_*)\in (0,\infty)^2$, for some $\alpha>0$.
Over the past decade, a combinatorial framework for discrete, finite, and irreversibly aggregating systems has emerged. This work reviews its progress, practical applications, and limitations. We outline the approach's assumptions and…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
Most of major algorithms for phylogenetic tree reconstruction assume that sequences in the analyzed set either do not have any offspring, or that parent sequences can maximally mutate into just two descendants. The graph resulting from such…