Evidence map›Paper›PMID 31088262›Full record

ArticleJournal of the Royal Society, Interface2019

Travel in city road networks follows similar transport trade-off principles to neural and plant arbors.

Jonathan Y Suen, Saket Navlakha

Open access · bronzeAbstract read
In one paragraph

Article in Journal of the Royal Society, Interface, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
1.2field-weighted citation impact, top 16% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed, 10 citations in OpenAlex.

  1. Biomimetics with Trade-Offs.Biomimetics (Basel, Switzerland) · 2023
    Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors at 1 institution in 1 country.

Jonathan Y SuenThe Salk Institute for Biological Studies, Integrative Biology Laboratory , La Jolla, CA 92037 , USA.
Saket NavlakhaThe Salk Institute for Biological Studies, Integrative Biology Laboratory , La Jolla, CA 92037 , USA.
Salk Institute for Biological Studies · US

Funding

CRCNS: Common algorithmic strategies used by the brain for labeling points in high-dimensional spaceR01DC017695 · NIDCD · SALK INSTITUTE FOR BIOLOGICAL STUDIES · PI NAVLAKHA, SAKET · 2018 to 2020
$1.3M
NIDCD NIH HHS R01 DC017695
6 · The paper itself

Abstract

Both engineered and biological transportation networks face trade-offs in their design. Network users desire to quickly get from one location in the network to another, whereas network planners need to minimize costs in building infrastructure. Here, we use the theory of Pareto optimality to study this design trade-off in the road networks of 101 cities, with wide-ranging population sizes, land areas and geographies. Using a simple one parameter trade-off function, we find that most cities lie near the Pareto front and are significantly closer to the front than expected by alternate design structures. To account for other optimization dimensions or constraints that may be important (e.g. traffic congestion, geography), we performed a higher-order Pareto optimality analysis and found that most cities analysed lie within a region of design space bounded by only four archetypal cities. The trade-offs studied here are also faced and well-optimized by two biological transport networks-neural arbors in the brain and branching architectures of plant shoots-suggesting similar design principles across some biological and engineered transport systems.

Indexed as

AlgorithmsModels, TheoreticalTransportationUrban RenewalCitiesbiological networksnetwork theoryPareto optimalitytransport networks

Identifiers

PMID31088262
PMCPMC6544892
OpenAlexW2946759908

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.