Related papers: Biological and Shortest-Path Routing Procedures fo…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
Rapid advances in high-throughput technologies have led to considerable interest in analyzing genome-scale data in the context of biological pathways, with the goal of identifying functional systems that are involved in a given phenotype.…
Air transport systems are highly dynamic at temporal scales from minutes to years. This dynamic behavior not only characterizes the evolution of the system but also affect the system's functioning. Understanding the evolutionary mechanisms…
Routing is, arguably, the most fundamental task in computer networking, and the most extensively studied one. A key challenge for routing in real-world environments is the need to contend with uncertainty about future traffic demands. We…
Inference and prediction of routes have become of interest over the past decade owing to a dramatic increase in package delivery and ride-sharing services. Given the underlying combinatorial structure and the incorporation of probabilities,…
A common technique to speed up shortest path queries in graphs is to use a bidirectional search, i.e., performing a forward search from the start and a backward search from the destination until a common vertex on a shortest path is found.…
The structure of road networks impacts various urban dynamics, from traffic congestion to environmental sustainability and access to essential services. Recent studies reveal that most roads are underutilized, faster alternative routes are…
Decoupling the permanent identifier of a node from the node's topology-dependent address is a promising approach toward completely scalable self-organizing networks. A group of proposals that have adopted such an approach use the same…
Route choice is often modelled as a two-step procedure in which travellers choose their routes from small sets of promising candidates. Many methods developed to identify such choice sets rely on assumptions about the mechanisms behind the…
The human brain can be considered to be a graphical structure comprising of tens of billions of biological neurons connected by synapses. It has the remarkable ability to automatically re-route information flow through alternate paths in…
This paper presents a dynamic routing guidance system that optimizes route recommendations for individual vehicles in an emerging transportation system while enhancing travelers' trip equity. We develop a framework to quantify trip quality…
Empirical studies on the spatial structures in several real transport networks reveal that the distance distribution in these networks obeys power law. To discuss the influence of the power-law exponent on the network's structure and…
Recently, there has been an explosion of work on network routing in hostile environments. Hostile environments tend to be dynamic, and the motivation for this work stems from the scenario of IED placements by insurgents in a logistical…
We introduce the concept of efficiency of a network, measuring how efficiently it exchanges information. By using this simple measure small-world networks are seen as systems that are both globally and locally efficient. This allows to give…
Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…
In route selection problems, the driver's personal preferences will determine whether she prefers a route with a travel time that has a relatively low mean and high variance over one that has relatively high mean and low variance. In…
The transportation system is an interplay between infrastructure, vehicles, and policy. During the past century, the rapid expansion of the road network, blended with increasing vehicle production and mobility demands, has been stressing…
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry. Applications include shortest paths in traffic networks with variable link travel times.
Consider a communication network to which a sequence of self-interested users come and send requests for data transmission between nodes. This work studies the question of how to guide the path selection choices made by those…
Analyzing and characterizing the differences between networks is a fundamental and challenging problem in network science. Previously, most network comparison methods that rely on topological properties have been restricted to measuring…