Related papers: On the Optimal Shape of Tree Roots and Branches
This paper studies two classes of variational problems introduced in [7], related to the optimal shapes of tree roots and branches. Given a measure $\mu$ describing the distribution of leaves, a sunlight functional $\S(\mu)$ computes the…
The paper studies a class of variational problems, modeling optimal shapes for tree roots. Given a measure $\mu$ describing the distribution of root hair cells, we seek to maximize a harvest functional $\mathcal{H}$, computing the total…
This paper is concerned with a shape optimization problem, where the functional to be maximized describes the total sunlight collected by a distribution of tree leaves, minus the cost for transporting water and nutrient from the base of the…
The models introduced in this paper describe a uniform distribution of plant stems competing for sunlight. The shape of each stem, and the density of leaves, are designed in order to maximize the captured sunlight, subject to a cost for…
The root is an important organ of a plant since it is responsible for water and nutrient uptake. Analyzing and modelling variabilities in the geometry and topology of roots can help in assessing the plant's health, understanding its growth…
The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…
For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not…
The paper analyzes a mollification algorithm, for the numerical computation of optimal irrigation patterns. This provides a regularization of the standard irrigation cost functional, in a Lagrangian framework. Lower semicontinuity and…
The dynamical phenomena of complex networks are very difficult to predict from local information due to the rich microstructures and corresponding complex dynamics. On the other hands, it is a horrible job to compute some stochastic…
In this paper we undertake a multiscale analysis of nutrient uptake by plant root hairs, considering different scale relations between the radius of hairs and the distance between them. We combine the method of formal asymptotic expansions…
In this paper, we determine which non-random sampling of fixed size gives the best linear predictor of the sum of a finite spatial population. We employ different multiscale superpopulation models and use the minimum mean-squared error as…
We consider the problem of \emph{pruning} a classification tree, that is, selecting a suitable subtree that balances bias and variance, in common situations with inhomogeneous training data. Namely, assuming access to mostly data from a…
The Rooted Maximum Leaf Outbranching problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its parameterized version asks if there exists such a tree with at…
In this paper we consider inhomogeneous Galton-Watson trees, and derive various moments for such processes: the number of vertices, the number of leaves, and the height of the tree. Also we make a simple condition of finiteness. We use…
The structure of networks that provide optimal transport properties has been investigated in a variety of contexts. While many different formulations of this problem have been considered, it is recurrently found that optimal networks are…
Inspired by applications in weighted polynomial approximation problems, we study an optimal mass distribution problem. Given a gauge function $h$ and a positive "roof" function $R$ compactly supported in $\mathbb{R}^n$, we are interested in…
Treemaps have been widely applied to the visualization of hierarchical data. A treemap takes a weighted tree and visualizes its leaves in a nested planar geometric shape, with sub-regions partitioned such that each sub-region has an area…
The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
Models involving branched structures are employed to describe several supply-demand systems such as the structure of the nerves of a leaf, the system of roots of a tree and the nervous or cardiovascular systems. Given a flow (traffic path)…