Related papers: Tree diameter, height and stocking in even-aged fo…
Forestry is a major industry in many parts of the world. It relies on forest inventory, which consists of measuring tree attributes. We propose to use 3D mapping, based on the iterative closest point algorithm, to automatically measure tree…
We apply dimensional analysis with Buckinghams "Pi" theorem to estimate the volume of wood in a tree stem, given the tree's height and diameter. We use Meyer's (1953) data on 31 cherry trees from the Allegheny National forest as the main…
Accurately estimating forest biomass is crucial for global carbon cycle modelling and climate change mitigation. Tree height, a key factor in biomass calculations, can be measured using Synthetic Aperture Radar (SAR) technology. This study…
For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and finite boxes of ${\mathbb Z}^d$, the diameter of the UST is…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…
The age of forest stands is critical information for many aspects of forest management and conservation but area-wide information about forest stand age often does not exist. In this study, we developed regression models for large-scale…
We introduce top trees as a design of a new simpler interface for data structures maintaining information in a fully-dynamic forest. We demonstrate how easy and versatile they are to use on a host of different applications. For example, we…
In this paper, we focus on the prediction phase of a random forest and study the problem of representing a bag of decision trees using a smaller bag of decision trees, where we only consider binary decision problems on the binary domain and…
Tree perception is an essential building block toward autonomous forestry operations. Current developments generally consider input data from lidar sensors to solve forest navigation, tree detection and diameter estimation problems. Whereas…
The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with proper thinness~1 are exactly the proper interval graphs. A…
After more than a century of research the typical growth pattern of a tree was thought to be fairly well understood. Following germination height growth accelerates for some time, then increment peaks and the added height each year becomes…
In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
In this paper we critically examine predictions of the Lya forest within the standard cold dark matter (SCDM) model, paying particular attention to the low end of the column-density distribution. We show in particular that the width of…
We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaym\'e trees and simply generated trees. We show that for a tree of…
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…
In tropical regions, fires propagate readily in grasslands but typically consume only edges of forest patches. Thus forest patches grow due to tree propagation and shrink by fires in surrounding grasslands. The interplay between these…
We derive the asymptotic distribution of the total length $L_n$ of a $\operatorname {Beta}(2-\alpha,\alpha)$-coalescent tree for $1<\alpha<2$, starting from $n$ individuals. There are two regimes: If $\alpha\le1/2(1+\sqrt{5})$, then $L_n$…
Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST -- a structure…
A stochastic forest model of young and old age class trees is studied. First, we prove existence, uniqueness and boundedness of global nonnegative solutions. Second, we investigate asymptotic behavior of solutions by giving a sufficient…