Related papers: Weighted Irrigation Plans
We study mean ergodicity in amenable operator semigroups and establish the connection to the convergence of strong and weak ergodic nets. We then use these results in order to show the convergence of uniform families of ergodic nets that…
We propose a simple extension of residual networks that works simultaneously in multiple resolutions. Our network design is inspired by the iterative back-projection algorithm but seeks the more difficult task of learning how to enhance…
We study the averaging-based distributed optimization solvers over random networks. We show a general result on the convergence of such schemes using weight-matrices that are row-stochastic almost surely and column-stochastic in expectation…
Mixture modeling, which considers the potential heterogeneity in data, is widely adopted for classification and clustering problems. Mixture models can be estimated using the Expectation-Maximization algorithm, which works with the complete…
In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…
Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…
We propose a model for the growth of weighted networks that couples the establishment of new edges and vertices and the weights' dynamical evolution. The model is based on a simple weight-driven dynamics and generates networks exhibiting…
We study the computation of the flow of water on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and one…
A central challenge in the design of energy-efficient wind farms is the presence of wake effects between turbines. When a wind turbine harvests energy from free wind, it produces a turbulent region with reduced energy for downstream…
Optimal power flow (OPF) is a key tool for planning and operations in energy grids. The line-flow constraints, generator loading effect, piece-wise cost functions, emission, and voltage quality cost make the optimization model non-convex…
In this paper we investigate networks whose evolution is governed by the interaction of a random assembly process and an optimization process. In the first process, new nodes are added one at a time and form connections to randomly selected…
Designing networks with specified collective properties is useful in a variety of application areas, enabling the study of how given properties affect the behavior of network models, the downscaling of empirical networks to workable sizes,…
We develop efficient algorithms for a fundamental network design problem arising in potential-based flow models, which are central to many energy transport networks (e.g., hydrogen and electricity). In contrast to classical network flow…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…
Natural disasters or attacks may disrupt infrastructure networks on a vast scale. Parts of the damaged network are interdependent, making it difficult to plan and optimally execute the recovery operations. To study how interdependencies…
Reconstructing weighted networks from partial information is necessary in many important circumstances, e.g. for a correct estimation of systemic risk. It has been shown that, in order to achieve an accurate reconstruction, it is crucial to…
While many large infrastructure networks, such as power, water, and natural gas systems, have similar physical properties governing flows, these systems tend to have distinctly different sizes and topological structures. This paper seeks to…
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 investigate the geometry of injection regions and its relationship to optimization of power flows in tree networks. The injection region is the set of all vectors of bus power injections that satisfy the network and operation…
We consider a network-preserved model of power networks with proper algebraic constraints resulting from constant power loads. Both for the linear and the nonlinear differential algebraic model of the network, we derive explicit reduced…