相关论文: Irrigable Measures for Weighted Irrigation Plans
We model an irrigation network where lower branches must be thicker in order to support the weight of the higher ones. This leads to a countable family of ODEs, one for each branch, that must be solved by backward induction. Having…
We consider a branched transport problem with weakly imposed boundary conditions. This problem arises as a reduced model for pattern formation in type-I superconductors. For this model, it is conjectured that the dimension of the boundary…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
We consider a branched transport type problem with weakly imposed boundary conditions, which can be seen as a blown-up version of a reduced model for type-I superconductors in the regime of vanishing external magnetic field. We prove that…
We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph $G=(V,E)$ where the weight an edge $e \in E$ can be upgraded for a cost $c(e)$. Given a budget $B$ for improvement, the goal is to find…
In weighted trees, all edges are endowed with positive integral weight. We enumerate weighted bicolored plane trees according to their weight and number of edges.
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index…
Irrigation decision systems and water need models have been important research topics in agriculture since 90s. They improve the efficiency of crop yields, provide an appropriate use of water on the earth and so, prevent the water scarcity…
Modeling networks can serve as a means of summarizing high-dimensional complex systems. Adapting an approach devised for dense, weighted networks, we propose a new method for generating and estimating unweighted networks. This approach can…
Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate novel fast methods of…
An accurate and precise understanding of global irrigation usage is crucial for a variety of climate science efforts. Irrigation is highly energy-intensive, and as population growth continues at its current pace, increases in crop need and…
The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new…
The agricultural irrigation system is closely related to agricultural production. There are some problems in nowadays agricultural irrigation system, such as poor mobility, imprecision and high price. To address these issues, an intelligent…
Dense networks with weighted connections often exhibit a community like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node's community membership. We…
The function or performance of a network is strongly dependent on its robustness, quantifying the ability of the network to continue functioning under perturbations. While a wide variety of robustness metrics have been proposed, they have…
This monograph resolves - in a dense class of cases - several open problems concerning geodesics in i.i.d. first-passage percolation on $\mathbb{Z}^d$. Our primary interest is in the empirical measures of edge-weights observed along…
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…
We present a new approach to the calculation of measures in weighted networks, based on the translation of a weighted network into an ensemble of edges. This leads to a straightforward generalization of any measure defined on unweighted…
We present an algebraic approach to the watershed adapted to edge or node weighted graphs. Starting with the flooding adjunction, we introduce the flooding graphs, for which node and edge weights may be deduced one from the other. Each node…
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…