Related papers: Designing optimal transport networks
Given the dynamic nature of traffic, we investigate the variant of robust network design where we have to determine the capacity to reserve on each link so that each demand vector belonging to a polyhedral set can be routed. The objective…
We study optimal information provision in transportation networks when users are strategic and the network state is uncertain. An omniscient planner observes the network state and discloses information to the users with the goal of…
It is shown that optimal network plans can be obtained, naturally, as a limit of easier problems of point allocations. These problems are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of…
The branching geometry of biological transport networks is characterized by a diameter scaling exponent $\alpha$. Two structural attractors compete: impedance matching ($\alpha \sim 2$) for pulsatile flow and viscous-metabolic minimization…
Optimal transportation problem seeks for a coupling $\pi$ of two probability measures $\mu$ and $\nu$ which minimize the total cost $\int c d\pi$, which is linear in $\pi$. In this paper, we introduce a variation of optimal transportation…
It is commonly known that there exist short paths between vertices in a network showing the small-world effect. Yet vertices, for example, the individuals living in society, usually are not able to find the shortest paths, due to the very…
In designing a network to link n cities in a square of area n, one might be guided by the following two desiderata. First, the total network length should not be much greater than the length of the shortest network connecting all cities.…
We propose a new method to estimate Wasserstein distances and optimal transport plans between two probability distributions from samples in high dimension. Unlike plug-in rules that simply replace the true distributions by their empirical…
We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier's Theorem…
In this paper, We propose a effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential delivering exponent alpha. we assume that the handling capacity of one vertex is…
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or node failures, traffic bursts, and topology changes, and…
We numerically investigate the scale-free network model of Barab{\'a}si and Albert [A. L. Barab{\'a}si and R. Albert, Science {\bf 286}, 509 (1999)] through the use of various path finding strategies. In real networks, global network…
In this paper, we study information transport in multiplex networks comprised of two coupled subnetworks. The upper subnetwork, called the logical layer, employs the shortest paths protocol to determine the logical paths for packets…
This paper focuses on designing edge-weighted networks, whose robustness is characterized by maximizing algebraic connectivity, or the second smallest eigenvalue of the Laplacian matrix. This problem is motivated by cooperative vehicle…
We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…
In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture realistic properties of real-world problems that are not…
The network structure of an urban transportation system has a significant impact on its traffic performance. This study uses network indicators along with several traffic performance measures including speed, trip length, travel time, and…
Optimizing paths on networks is crucial for many applications, from subway traffic to Internet communication. As global path optimization that takes account of all path-choices simultaneously is computationally hard, most existing routing…
A Barab\'asi-Albert scale-free network is constructed whose nodes are the Poisson distributed random points within a unit square and links are the straight line connections among the nodes. The cost function, which is the total wiring…
In this work, we propose a novel machine learning approach to compute the optimal transport map between two continuous distributions from their unpaired samples, based on the DeepParticle methods. The proposed method leads to a min-min…