Related papers: Heuristic Optimal Transport in Branching Networks

Heuristic Optimal Transport in Branching Networks

URL: http://arxiv.org/abs/2311.06650v3
Date: Wed, 7 Feb 2024 16:12:06 GMT
Title: Heuristic Optimal Transport in Branching Networks
Authors: M. Andrecut
Abstract summary: We discuss a fast branching method for optimal transport in networks. We also provide several applications to synthetic examples, a simplified cardiovascular network, and the "Santa Claus" distribution network which includes 141,182 cities around the world.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Optimal transport aims to learn a mapping of sources to targets by minimizing the cost, which is typically defined as a function of distance. The solution to this problem consists of straight line segments optimally connecting sources to targets, and it does not exhibit branching. These optimal solutions are in stark contrast with both natural, and man-made transportation networks, where branching structures are prevalent. Here we discuss a fast heuristic branching method for optimal transport in networks. We also provide several numerical applications to synthetic examples, a simplified cardiovascular network, and the "Santa Claus" distribution network which includes 141,182 cities around the world, with known location and population.

Related papers

Non-iterative Optimization of Trajectory and Radio Resource for Aerial Network [7.824710236769593]
We address a joint trajectory planning, user association, resource allocation, and power control problem in the aerial IoT network. Our framework can incorporate various trajectory planning algorithms such as the genetic, tree search, and reinforcement learning.
arXiv Detail & Related papers (2024-05-02T14:21:29Z)
Hierarchical Multi-Marginal Optimal Transport for Network Alignment [52.206006379563306]
Multi-network alignment is an essential prerequisite for joint learning on multiple networks. We propose a hierarchical multi-marginal optimal transport framework named HOT for multi-network alignment. Our proposed HOT achieves significant improvements over the state-of-the-art in both effectiveness and scalability.
arXiv Detail & Related papers (2023-10-06T02:35:35Z)
Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources [12.139222986297263]
Branched Optimal Transport (BOT) is a generalization of optimal transport in which transportation costs along an edge are subadditive. We show how to efficiently find the best geometry of a BOT network for many sources and sinks, given a topology.
arXiv Detail & Related papers (2022-10-14T10:51:16Z)
InfoOT: Information Maximizing Optimal Transport [58.72713603244467]
InfoOT is an information-theoretic extension of optimal transport. It maximizes the mutual information between domains while minimizing geometric distances. This formulation yields a new projection method that is robust to outliers and generalizes to unseen samples.
arXiv Detail & Related papers (2022-10-06T18:55:41Z)
Neural Optimal Transport [82.2689844201373]
We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. We prove that neural networks are universal approximators of transport plans between probability distributions.
arXiv Detail & Related papers (2022-01-28T16:24:13Z)
Score-based Generative Neural Networks for Large-Scale Optimal Transport [15.666205208594565]
In certain cases, the optimal transport plan takes the form of a one-to-one mapping from the source support to the target support. We study instead the Sinkhorn problem, a regularized form of optimal transport whose solutions are couplings between the source and the target distribution. We introduce a novel framework for learning the Sinkhorn coupling between two distributions in the form of a score-based generative model.
arXiv Detail & Related papers (2021-10-07T07:45:39Z)
Learning Autonomy in Management of Wireless Random Networks [102.02142856863563]
This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes. We develop a flexible deep neural network formalism termed distributed message-passing neural network (DMPNN) with forward and backward computations independent of the network topology.
arXiv Detail & Related papers (2021-06-15T09:03:28Z)
Optimal transport in multilayer networks [68.8204255655161]
We propose a model where optimal flows on different layers contribute differently to the total cost to be minimized. As an application, we consider transportation networks, where each layer is associated to a different transportation system. We show an example of this result on the real 2-layer network of the city of Bordeaux with bus and tram, where in certain regimes the presence of the tram network significantly unburdens the traffic on the road network.
arXiv Detail & Related papers (2021-06-14T07:33:09Z)
TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamics [74.43710101147849]
We present TrajectoryNet, which controls the continuous paths taken between distributions to produce dynamic optimal transport. We show how this is particularly applicable for studying cellular dynamics in data from single-cell RNA sequencing (scRNA-seq) technologies.
arXiv Detail & Related papers (2020-02-09T21:00:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.