Related papers: An Orchard Theorem
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…
Consider a uniform random rooted tree on vertices labelled by $[n] = \{1,2,\ldots,n\}$, with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number $m \le n$ of cars arrive one by…
A hierarchical structure describing the inter-relationships of species has long been a fundamental concept in systematic biology, from Linnean classification through to the more recent quest for a 'Tree of Life.' In this paper we use an…
Given a random real quadratic field from $\{ \mathbb{Q}(\sqrt{p}\,) ~|~ p \text{ primes} \}$, the conjectural probability $\mathbb{P}(h=q)$ that it has class number $q$ is given for all positive odd integers $q$. Some related conjectures of…
A non-local model describing the growth of a tree-like transportation network with given allocation rules is proposed. In this model we focus on tree like networks, and the network transports the very resource it needs to build itself. Some…
In this article, written primarily for physicists and geometers, we survey several manifestations of a general localization principle for orbifold theories such as $K$-theory, index theory, motivic integration and elliptic genera.
This is a long introduction to the theory of "branch groups": groups acting on rooted trees which exhibit some self-similarity features in their lattice of subgroups.
Accurate localization is an important functional requirement for precision orchard management. However, there are few off-the-shelf commercial solutions available to growers. In this paper, we present SeeTree, a modular, open source…
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a…
We generalize the concept of $r$-point clusters of a scheme $S$ to $r$-relative clusters of a $B$-scheme $\mathcal{S}$. Define schemes $Cl_r$ that naturally parametrize the $r$-relative clusters which generalize the Kleiman's construction…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
We characterize the situations in which certain accumulation properties of topological spaces are preserved under taking products.
Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…
In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such…
Vegetation patterns, a natural phenomenon observed worldwide, are typically driven by spatially distributed feedback. However, the spatial colonization mechanisms of clonal plants, driven by the growth of a rhizome, are usually not…
We introduce the Pitman Yor Diffusion Tree (PYDT) for hierarchical clustering, a generalization of the Dirichlet Diffusion Tree (Neal, 2001) which removes the restriction to binary branching structure. The generative process is described…
In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.
We give characterizations for the parabolicity of regular trees.
A new 2-parameter family of central structures in trees, called central forests, is introduced. Minieka's $m$-center problem and McMorris's and Reid's central-$k$-tree can be seen as special cases of central forests in trees. A central…