Fig. 1 Fastest and simplest paths in primal and dual networks.

Slides:



Advertisements
Similar presentations
ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
Advertisements

ENGM 732 Formalization of Network Flows Network Flow Models.
A Probabilistic Model for Road Selection in Mobile Maps Thomas C. van Dijk Jan-Henrik Haunert W2GIS, 5 April 2013.
SUBWAY SYSTEM IN NEW YORK CITY The Magical Subway.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Mapping City Wide Travel Times Andrew Hardin. Project Goal Encouraging alternate transportation – NYC- Bike Share – Boulder’s Transportation Management.
CCR = Connectivity Residue Ratio = Pr. [ node pair connected by an edge are together in a common page on computer disk drive.] “U of M Scientists were.
Surface depiction of cluster II epitopes on the surface of ricin toxin
Mapping the Matrix: The Ways of Neocortex
Comparison of network robustness measures over a larger time window
Fig. 4 Pupil shape and image quality in the model sheep eye.
Fig. 4 Schematic illustration of the pH-mediated reorganization of the interchain hydrogen bond network of the PSPMA brushes. Schematic illustration of.
Fig. 1 Upward emission functions used to compute the maps.
Fig. 1 Metropolitan DENV epidemic transmission evidenced through contact tracing. Metropolitan DENV epidemic transmission evidenced through contact tracing.
Fig. 2 Tera-Wasserburg plot of zircon dates from LASS and APM data.
Fig. 4 Estimations of nonlinear functionals of a single-qubit state with the quantum Fredkin gate. Estimations of nonlinear functionals of a single-qubit.
Fig. 2 Views of the Pincer-FATKIN interface and the dimer interface.
Fig. 2 Electronically conducting xylem wires.
Fig. 3 Length modulates flow pattern.
Fig. 2 The arrangements of metal core and ligands.
Fig. 4 States of the Antarctic Ice Sheet after 10,000 years.
Fig. 2. Clinically actionable somatic genomic alterations in various tumor types. Clinically actionable somatic genomic alterations in various tumor types.
Fig. 4 Reentrant and doubly reentrant transition state analysis.
Structural analysis of graphene-embedded FeN4 (FeN4/GN) catalysts
Fig. 1 NP-free Ch-CNC droplets.
Fig. 4 Morphogenesis in the Ch-CNC host droplets and NP assemblies.
Fig. 2 Some examples of weekly forecasts (the number of the forecasts are reported on Table 1). Some examples of weekly forecasts (the number of the forecasts.
Fig. 1 Map of the trifurcation area of the SJFZ.
Fig. 3 Faculty placement distributions.
Fig. 3 Scan rate effects on the layer edge current.
Fig. 1 Study area and field site setting.
Fig. 3 Controlled phase shift.
Fig. 1 Bioinspired design of AAD for promoting wound contraction.
Fig. 2 Images of complex structures formed via sequential folding.
by Riccardo Gallotti, Mason A. Porter, and Marc Barthelemy
Fig. 2 Configuration and composition of urban green space.
Fig. 4 Identification of C
Fig. 4 Memristive characteristics in a 1T-TaS2 nano-thick crystal.
Fig. 3 Evolutions of freshwater transport and salinity.
Fig. 5 Maps of Europe’s artificial sky brightness, in twofold increasing steps, as a ratio to the natural sky brightness (assumed to be 174 μcd/m2). Maps.
Fig. 2 Schematic drawings of Göbekli Tepe skulls.
Fig. 3 CFD simulations. CFD simulations. (A to R) Details of water flow around Tribrachidium oriented at 0° to the current. Model with original height.
Fig. 1 Topology of places and city block complexity.
Fig. 1 Fractional coverage of the mapping method used in this study.
Fig. 1 Schematic of biological neuronal network and an ONW ST that emulates a biological synapse. Schematic of biological neuronal network and an ONW ST.
Fig. 3 Maximal energy intake.
Fig. 6 Proposed models explaining the peopling of the Americas.
Fig. 2 Number of years that would have been required for the observed vertebrate species extinctions in the last 114 years to occur under a background.
Fig. 1 Droplet transport on transverse wave surface topographies.
Fig. 1 Sketch and schematic diagram of photobleaching reaction in a strongly coupled system. Sketch and schematic diagram of photobleaching reaction in.
Fig. 2 Inferring the diffusion equation from a single Brownian motion.
Fig. 3 Efficiency of the GDML predictor versus a model that has been trained on energies. Efficiency of the GDML predictor versus a model that has been.
Bulk-boundary correspondence and topological nontrivial nature of TaP
Fig. 1 Distribution of deformation and aqueous alteration in MIL
Fig. 2 Structural information.
Fig. 2 Growth kinetics of borophene on silver.
Fig. 10 Map of light pollution’s visual impact on the night sky.
SEM and TEM images and photoluminescence properties of composites
Fig. 1 Prestige hierarchies in faculty hiring networks.
Fig. 4 Scaling laws distinguish biochemical networks from random networks across levels of organization. Scaling laws distinguish biochemical networks.
Fig. 3 Voltage-driven phase switching in a 1T-TaS2 nano-thick crystal.
Fig. 4 Matrix for intersections of differentially expressed transcripts between RNAiAFL transgenic and null kernels. Matrix for intersections of differentially.
Fig. 2 Spatial distribution of five city groups.
Fig. 3 Global and basin-averaged sampling error compared with reconstructed temperature change. Global and basin-averaged sampling error compared with.
Fig. 3 The human FABP7 point mutation phenotype is recapitulated in Fabp7 KO mice, which also showed sleep fragmentation. The human FABP7 point mutation.
Fig. 3 Rubbery strain, pressure, and temperature sensors.
Fig. 5 Spatial resolution of the optogenetic activation achieved with OLED microarrays. Spatial resolution of the optogenetic activation achieved with.
Fig. 2 Reduced dendritic complexity of neurons in the prelimbic layer of the mPFC 8 weeks after HZE particle irradiation. Reduced dendritic complexity.
Fig. 2 Printed three-axis acceleration sensor.
Fig. 1 Uplift of the Isthmus of Panama and global sea levels over the last 20 My. Uplift of the Isthmus of Panama and global sea levels over the last 20.
Presentation transcript:

Fig. 1 Fastest and simplest paths in primal and dual networks. Fastest and simplest paths in primal and dual networks. (A) In the primal network of the New York City (NYC) metropolitan system, a simplest path (light blue) from 125th Street on line 5 (dark green) to 121st Street on line J (brown) differs significantly from a fastest path (gray). There is only one connection for the above simplest path (Brooklyn Bridge–City Hall/Chambers Street) in Lower Manhattan. In contrast, the above fastest path needs three connections (5→F→E→J). We compute the duration of this path using travel times from the Metropolitan Transportation Authority (MTA) Data Feeds (see Materials and Methods). We neglect walking and waiting times. (B) In the dual space, nodes represent routes [where ACE, BDFM, and NQR are service names (49)], and edges represent connections. A “simplest path” in the primal space is defined as a shortest path with the minimal number of edges in the dual space (light-blue arrow). It has a length of C = 1 and occurs along the direct connection between line 5 (dark-green node) and line J (brown node). The above fastest path in the primal space has a length of C = 3 (gray arrows) in the dual space, as one has to change lines three times. [We extracted the schematic of the NYC metropolitan system from a map that is publicly available on Wikimedia Commons (45).] Riccardo Gallotti et al. Sci Adv 2016;2:e1500445 Copyright © 2016, The Authors