Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. The simplicity of planar networks
 
research article

The simplicity of planar networks

Viana, Matheus P.
•
Strano, Emanuele  
•
Bordin, Patricia
Show more
2013
Scientific Reports

Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a non trivial and non local information about the spatial organization of these graphs. We define the simplicity index as the average ratio of these lengths and the simplicity profile characterizes the simplicity at different scales. We measure these metrics on artificial (roads, highways, railways) and natural networks (leaves, slime mould, insect wings) and show that there are fundamental differences in the organization of urban and biological systems, related to their function, navigation or distribution: straight lines are organized hierarchically in biological cases, and have random lengths and locations in urban systems. In the case of time evolving networks, the simplicity is able to reveal important structural changes during their evolution.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

articles-srep03495.pdf

Type

Publisher's Version

Version

http://purl.org/coar/version/c_970fb48d4fbd8a85

Access type

openaccess

License Condition

CC BY

Size

1.71 MB

Format

Adobe PDF

Checksum (MD5)

9203367b111c82bd1ee51b759c82d4eb

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés