Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

Efficient Transport Networks through Edge Pruning by Relative Resistance

  • Mathieu Le Verge-Serandour
  • Viktor Vasilev
  • Lara Szeimies
  • Karen Alim
Open at sourcePDFDOICite

Abstract

Transport networks are key to living and engineered systems. How can transport networks adapt efficiently using only local rules, without a global objective or specific boundary conditions? Inspired by observations in biological transport networks, we adapt networks by subsequently pruning edges by relative resistance, thus removing edges whose resistance is higher than the resistance for routing flow through the rest of the network. We find that adaptation by such a local, boundary-condition-free measure of redundancy, set by topology alone, yields sparse, loop-rich, low-dissipation networks.

Related

  1. Efficient, Geometry-only Prediction of Advection-dominated Particle Transport through Saturated Soils
    Hao Liu, Rizwan Khaleel, Markus Rolf +3
    arXivPreprintarXiv licenceFull textGeophysics & seismologyComputational physicsarXiv
  2. The conductance filtration: sink-relative persistence and exact edge sensitivity for heat transport in particle-filled composites
    Daisuke Yasufuku
    arXivPreprintCC BY 4.0Full textCondensed matterarXiv
  3. Finite attainment and efficient computation of regularized quantum channel relative entropy
    Yiwei Xu, Kun Fang
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks
    Zachary Goisman, Matthew L. Stevens, Maxwell Goisman +7
    Optics ExpressPeer-reviewedPublisher termsFull textOptics & photonicsCrossref
  5. Interaction of fluids described through relative motion and application to Bianchi type-I spacetimes
    Peter Mészáros, Daniel Račko
    arXivPreprintCC BY 4.0Full textGravitation & general relativityarXiv

Cite

BibTeXRIS
BibTeX
@misc{vergeserandour2026efficient,
  title = {{Efficient Transport Networks through Edge Pruning by Relative Resistance}},
  author = {Mathieu Le Verge-Serandour and Viktor Vasilev and Lara Szeimies and Karen Alim},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.13582},
  eprint = {2610.13582},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.13582},
}
RIS
TY  - UNPB
TI  - Efficient Transport Networks through Edge Pruning by Relative Resistance
AU  - Mathieu Le Verge-Serandour
AU  - Viktor Vasilev
AU  - Lara Szeimies
AU  - Karen Alim
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2610.13582
UR  - https://arxiv.org/abs/2610.13582
AB  - Transport networks are key to living and engineered systems. How can transport networks adapt efficiently using only local rules, without a global objective or specific boundary conditions? Inspired by observations in biological transport networks, we adapt networks by subsequently pruning edges by relative resistance, thus removing edges whose resistance is higher than the resistance for routing flow through the rest of the network. We find that adaptation by such a local, boundary-condition-free measure of redundancy, set by topology alone, yields sparse, loop-rich, low-dissipation networks.
ER  -