Related papers: Tree convolution for probability distributions wit…
We study the profile $X_{n,k}$ of random search trees including binary search trees and $m$-ary search trees. Our main result is a functional limit theorem of the normalized profile $X_{n,k}/\mathbb{E}X_{n,k}$ for $k=\lfloor\alpha\log…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
We extend to arbitrary measures results of Bao, Erd\"os, Schnelli, Moreillon, and Ji on the connectedness of the supports of additive convolutions of measures on \mathbb{R} and of free multiplicative convolutions of measures on…
We show that on groups generated by bounded activity automata, every symmetric, finitely supported probability measure has the Liouville property. More generally we show this for every group of automorphisms of bounded type of a rooted…
The last decade brought a significant increase in the amount of data and a variety of new inference methods for reconstructing the detailed evolutionary history of various cancers. This brings the need of designing efficient procedures for…
In this paper we determine the distributional behavior of sums of free (in the sense of Voiculescu) identically distributed, infinitesimal random variables. The theory is shown to parallel the classical theory of independent random…
The free convolution is the binary operation on the set of probability measures on the real line which allows to deduce, from the individual spectral distributions, the spectral distribution of a sum of independent unitarily invariant…
In a one-parameter model for evolution of random trees, which also includes the Barabasi-Albert random tree, almost sure behavior and the limiting distribution of the degree of a vertex in a fixed position are examined. Results about Polya…
We consider stochastic processes on complete, locally compact tree-like metric spaces $(T,r)$ on their "natural scale" with boundedly finite speed measure $\nu$. Given a triple $(T,r,\nu)$ such a speed-$\nu$ motion on $(T,r)$ can be…
We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…
We study the probability measure $\mu_{0}$ for which the moment sequence is $\binom{3n}{n}\frac{1}{n+1}$. We prove that $\mu_{0}$ is absolutely continuous, find the density function and prove that $\mu_{0}$ is infinitely divisible with…
We consider the free additive convolution semigroup $\lbrace \mu^{\boxplus t}:\,t\ge 1\rbrace$ and determine the local behavior of the density of $\mu^{\boxplus t}$ at the endpoints and at any singular point of its support. We then study…
We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…
We extend the classical coding of measured $\mathbb R$-trees by continuous excursion-type functions to c\`adl\`ag excursion-type functions through the notion of parametric representations. The main feature of this extension is its…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…
Let $s(n)$ denote the number of ones in the binary expansion of a natural number $n\in\mathbb{N}$. For any $t\in\mathbb{N}$ and $d\in\mathbb{Z}$, let $\mu_t(d)$ denote the asymptotic density of the set of those natural numbers $n$ for which…
A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…
Algorithmic meta-theorems, stating that graph properties expressible in some particular logic can be decided efficiently in graph classes having some specific structural properties, are now standard in sequential graph algorithms. One of…