Related papers: Robust network formation with biological applicati…
The reliable operation of large-scale electric power networks is increasingly challenging, particularly with the integration of stochastic renewable generation. In this work, we address the problem of minimizing network transients by…
The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle…
In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and velocities to edges. However, directly using Newton's method on…
We rigorously derive the dense graph limit of a discrete model describing the formation of biological transportation networks. The discrete model, defined on undirected graphs with pressure-driven flows, incorporates a convex energy…
The increasing urban population imposes a substantial and growing burden on the supporting infrastructure, such as electricity, water, heating, natural gas, road transportation, etc. This paper presents a Hetero-functional graph theory…
We consider two variational models for transport networks, an urban planning and a branched transport model, in which the degree of network complexity and ramification is governed by a small parameter $\varepsilon>0$. Smaller $\varepsilon$…
Recent theoretical and empirical studies have focused on the structural properties of complex relational networks in social, biological and technological systems. Here we study the basic properties of twenty 1-square-mile samples of street…
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We present a unified analytical framework within which power control, rate allocation, routing, and congestion control for wireless networks can be optimized in a coherent and integrated manner. We consider a multi-commodity flow model with…
We show analytically that abrupt structural transitions can arise in functionally optimal networks, driven by small changes in the level of transport congestion. Our findings are based on an exactly solvable model system which mimics a…
Global infrastructure robustness and local transport efficiency are critical requirements for transportation networks. However, since passengers often travel greedily to maximize their own benefit and trigger traffic jams, overall…
In modern network design, "efficiency" is often conflated with raw performance metrics like latency or aggregate throughput. This paper proposes a resource-centric definition of efficiency, isolating the hardware cost required to maintain a…
In this paper, we study weakly dynamic undirected graphs, that can be used to represent some logistic networks. The goal is to deliver all the delivery points in the network. The network exists in a mostly stable environment, except for a…
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…
Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply.…
Energy saving is becoming an important issue in the design and use of computer networks. In this work we propose a problem that considers the use of rate adaptation as the energy saving strategy in networks. The problem is modeled as an…
We study dynamic network formation from a centralized perspective. In each period, the social planner builds a single link to connect previously unlinked pairs. The social planner is forward-looking, with instantaneous utility monotonic in…
The collection of all the strongly connected components in a directed graph, among each cluster of which any node has a path to another node, is a typical example of the intertwining structure and dynamics in complex networks, as its…