Related papers: Central and $L^p$-concentration of 1-Lipschitz map…
Given a Lipschitz map $f$ from a cube into a metric space, we find several equivalent conditions for $f$ to have a Lipschitz factorization through a metric tree. As an application we prove a recent conjecture of David and Schul. The…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
Understanding the effects of the choice of the tree on the joint distribution of a tree-structured Markov random field (MRF) is crucial for fully exploiting the intelligibility of such probabilistic graphical models. Tools must be developed…
Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…
This article considers the question of how much of the mass of an element in a Paley-Wiener space can be concentracted on a given set. We seek bounds in terms of relative densities of the given set. We extend a result of Donoho and Logan…
Gromov's Lipschitz order is an order relation on the set of metric measure spaces. One of the compactifications of the space of isomorphism classes of metric measure spaces equipped with the concentration topology is constructed by using…
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.…
We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…
We study expansion/contraction properties of some common classes of mappings of the Euclidean space ${\mathbb R}^n, n\ge 2\,,$ with respect to the distance ratio metric. The first main case is the behavior of M\"obius transformations of the…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
The main result of the article is the rate of convergence to the Rosenblatt-type distributions in non-central limit theorems. Specifications of the main theorem are discussed for several scenarios. In particular, special attention is paid…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
We compute the magnitude (an isometric invariant of metric spaces) of compact $\mathbb{R}$-trees and show that it equals $1 + L/2$, where $L \in [0, \infty]$ denotes the total length. Although length is the only geometric invariant captured…
The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study…
By means of a variational identity of Poho\v{z}aev-Pucci-Serrin type for solutions of class $C^1$ recently obtained, we give some necessary conditions for locating the concentration points for a class of quasi-linear elliptic problems in…
The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
We survey the definition and some elementary properties of real trees. There are no new results, as far as we know. One purpose is to give a number of different definitions and show the equivalence between them. We discuss also, for…