Related papers: (Random) Trees of Intermediate Uniform Growth

Let G denote a closed, connected, self adjoint, noncompact subgroup of GL(n,R), and let d_{R} denote the canonical right invariant Riemannian metric on G. For v in R^{n} let G_{v} = {g in G : g(v) = v}. We obtain algebraically defined upper…

Two kinds of evolving trees are considered here: the exponential trees, where subsequent nodes are linked to old nodes without any preference, and the Barab\'asi--Albert scale-free networks, where the probability of linking to a node is…

We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…

We study the limiting behavior of multiple ergodic averages involving sequences of integers that satisfy some regularity conditions and have polynomial growth. We show that for "typical" choices of Hardy field functions $a(t)$ with…

Using uniformization, Cantor type sets can be regarded as boundaries of rooted trees. In this setting, we show that the trace of a first-order Sobolev space on the boundary of a regular rooted tree is exactly a Besov space with an explicit…

Net-trees are a general purpose data structure for metric data that have been used to solve a wide range of algorithmic problems. We give a simple randomized algorithm to construct net-trees on doubling metrics using $O(n\log n)$ time in…

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

We present a survey of results related to the Milnor's problem on group growth. We discuss the cases of polynomial growth, exponential but not uniformly exponential growth, but the main part of the article is devoted to the intermediate…

Given a permutation $\sigma$, its corresponding binary search tree is obtained by recursively inserting the values $\sigma(1),\ldots,\sigma(n)$ into a binary tree so that the label of each node is larger than the labels of its left subtree…

In this paper, we study spectrally invariant subalgebras of uniform Roe algebras for discrete groups with subexponential growth. For a group $G$ with subexponential growth and satisfying property $P$, we construct a class of subalgebras…

The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…

We introduce an object called a tree growing sequence (TGS) in an effort to generalize bijective correspondences between $G$-parking functions, spanning trees, and the set of monomials in the Tutte polynomial of a graph $G$. A tree growing…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

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…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

Let $T$ be an infinite rooted tree with weights $w_e$ assigned to its edges. Denote by $m_n(T)$ the minimum weight of a path from the root to a node of the $n$th generation. We consider the possible behaviour of $m_n(T)$ with focus on the…

The notions of unimodular Minkowski and Hausdorff dimensions are defined in [arXiv:1807.02980] for unimodular random discrete metric spaces. The present paper is focused on the connections between these notions and the polynomial growth…

Using explicit methods, we provide an upper bound to the norm of the Busemann cocycle of a locally finite regular tree $X$, emphasizing the symmetries of the cocycle. The latter takes value into a submodule of square summable functions on…

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 destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…