Related papers: How far can you see in a forest?
The worldwide variation in vegetation height is fundamental to the global carbon cycle and central to the functioning of ecosystems and their biodiversity. Geospatially explicit and, ideally, highly resolved information is required to…
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…
A spiral in $\mathbb{R}^{d+1}$ is defined as a set of the form $\left\{\sqrt[d+1]{n}\cdot\boldsymbol{u}_n\right\}_{n\ge 1},$ where $\left(\boldsymbol{u}_n\right)_{n\ge 1}$ is a spherical sequence. Such point sets have been extensively…
Tree-size distribution is one of the most investigated subjects in plant population biology. The forestry literature reports that tree-size distribution trajectories vary across different stands and/or species, while the metabolic scaling…
Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…
Bennett, Iosevich and Taylor proved that compact subsets of ${\Bbb R}^d$, $d \ge 2$, of Hausdorff dimensions greater than $\frac{d+1}{2}$ contain chains of arbitrary length with gaps in a non-trivial interval. In this paper we generalize…
The arboricity $\Gamma(G)$ of an undirected graph $G =(V,E)$ is the minimal number $k$ such that $E$ can be partitioned into $k$ forests on $V$. Nash-Williams' formula states that $k = \lceil \gamma(G) \rceil$, where $\gamma(G)$ is the…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
As well known the rotation distance D(S,T) between two binary trees S, T of n vertices is the minimum number of rotations of pairs of vertices to transform S into T. We introduce the new operation of chain rotation on a tree, involving two…
We make progress on a number of open problems concerning the area requirement for drawing trees on a grid. We prove that 1. every tree of size $n$ (with arbitrarily large degree) has a straight-line drawing with area $n2^{O(\sqrt{\log\log…
In the Lorentz mirror walk in dimension $d\geq 2$, mirrors are randomly placed on the vertices of $\mathbb{Z}^d$ at density $p\in[0,1]$. A light ray is then shot from the origin and deflected through the various mirrors in space. The object…
If the current energy density of the universe is indeed dominated by a cosmological constant, then high-redshift sources will remain visible to us only until they reach some finite age in their rest-frame. The radiation emitted beyond that…
Given any infinite tree in the plane satisfying certain topological conditions, we construct an entire function $f$ with only two critical values $\pm 1$ and no asymptotic values such that $f^{-1}([-1,1])$ is ambiently homeomorphic to the…
Many problems in Discrete and Computational Geometry deal with simple polygons or polygonal regions. Many algorithms and data-structures perform considerably faster, if the underlying polygonal region has low local complexity. One obstacle…
The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…
Estimating canopy height and its changes at meter resolution from satellite imagery is a significant challenge in computer vision with critical environmental applications. However, the lack of open-access datasets at this resolution hinders…
For some $k \in \mathbb{Z}_{\geq 0}\cup \infty$, we call a linear forest $k$-bounded if each of its components has at most $k$ edges. We will say a $(k,\ell)$-bounded linear forest decomposition of a graph $G$ is a partition of $E(G)$ into…
Let $\cT$ be a monadic-second order class of finite trees, and let $\bT(x)$ be its (ordinary) generating function, with radius of convergence $\rho$. If $\rho \ge 1$ then $\cT$ has an explicit specification (without using recursion) in…
We use a recently found generalization of the Cauchy-Binet theorem to give a new proof of the Chebotarev-Shamis forest theorem telling that det(1+L) is the number of rooted spanning forests in a finite simple graph G with Laplacian L. More…
We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than standard search…