Related papers: A note on the limit law of one-sided tree destruct…
Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…
Nature and our world have a bias! Roughly $30\%$ of the time the number $1$ occurs as the leading digit in many datasets base $10$. This phenomenon is known as Benford's law and it arrises in diverse fields such as the stock market,…
In the framework of generalized Oppenheim expansions we prove strong law of large numbers for lightly trimmed sums. In the first part of this work we identify a particular class of expansions for which we provide a convergence result…
We answer three questions posed by Bubeck and Linial on the limit densities of subtrees in trees. We prove there exist positive $\varepsilon_1$ and $\varepsilon_2$ such that every tree that is neither a path nor a star has inducibility at…
In this paper we establish lower bounds on information divergence of a distribution on the integers from a Poisson distribution. These lower bounds are tight and in the cases where a rate of convergence in the Law of Thin Numbers can be…
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense,…
We introduce generalized dynamical pruning on rooted binary trees with edge lengths. The pruning removes parts of a tree $T$, starting from the leaves, according to a pruning function defined on subtrees within $T$. The generalized pruning…
The decomposition of a density function on a domain into a minimal sum of unimodal components is a fundamental problem in statistics, leading to the topological invariant of unimodal category of a density. This paper gives an efficient…
We show that the Bernoulli part extraction method can be used to obtain approximate forms of the local limit theorem for sums of independent lattice valued random variables, with effective error term, that is with explicit parameters and…
Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problem of reconstructing the transmitted symbol…
We investigate the randomized decision tree complexity of a specific class of read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, every internal node of which is labeled by a threshold function…
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
We consider systems of stochastic fixed-point equations that arise in the asymptotic analysis of random recursive structures and algorithms such as Quicksort, generalized P\'olya urn processes and path lengths of random recursive trees and…
In this work we present a nonlocal conservation law with a velocity depending on an integral term over a part of the space. The model class covers already existing models in literature, but it is also able to describe new dynamics mainly…
The critical beta-splitting tree, introduced by Aldous, is a Markov branching phylogenetic tree. Aldous and Pittel recently proved, amongst other results, a central limit theorem for the height of a random leaf. We give an alternative…
We provide an informal overview of recent developments concerning the singular local limit of nonlocal conservation laws. In particular, we discuss some counterexamples to convergence and we highlight the role of numerical viscosity in the…
We consider a continuous time random walk on the rooted binary tree of depth $n$ with all transition rates equal to one and study its cover time, namely the time until all vertices of the tree have been visited. We prove that, normalized by…
We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…
Rooted plane trees are reduced by four different operations on the fringe. The number of surviving nodes after reducing the tree repeatedly for a fixed number of times is asymptotically analyzed. The four different operations include…
A set of points with finite density is constructed in $\mathbb{R}^d$, with $d\geq2$, by adding points to a Poisson process such that any line segment of length $O\left(\varepsilon^{-(d-1)}\ln\varepsilon^{-1}\right)$ in $\mathbb{R}^d$ will…