Source-linked AI summary

Damage and fluctuations induce loops in optimal transport networks

Eleni Katifori, Gergely J. Szöllősi, Marcelo O. Magnasco

arXiv:0906.0006v1physics.bio-phcond-mat.dis-nnq-bio.TO

TL;DR

The paper asks why leaf venation contains many loops despite efficiency-based transport models favoring loopless trees. It optimizes networks for random vein damage and fluctuating, sparsely distributed loads, finding loops in both optimum states.

  • Problem

    Observed leaf venation contains many functional loops, whereas transport optimized under constant load is often tree-like; the paper examines damage resilience and fluctuating loads as possible explanations.

  • Method

    The paper models random damage by averaging transport performance over damaged links and models fluctuating load with a single moving sink, optimizing network dissipation under a fixed conductance cost.

  • Results

    Both damage-resilience and fluctuating-load criteria produce looped optimal networks, including nested or dense recursively looped structures.

  • Takeaways & Limitations

    Loops can support flow around vein injuries and may improve delivery under fluctuating loads, matching structural features observed in leaves.

  • Takeaways & Limitations

    The annealing-based optimization cannot guarantee that the minima found are global minima.

Abstract

from arXiv · show

Leaf venation is a pervasive example of a complex biological network, endowing leaves with a transport system and mechanical resilience. Transport networks optimized for efficiency have been shown to be trees, i.e. loopless. However, dicotyledon leaf venation has a large number of closed loops, which are functional and able to transport fluid in the event of damage to any vein, including the primary veins. Inspired by leaf venation, we study two possible reasons for the existence of a high density of loops in transport networks: resilience to damage and fluctuations in load. In the first case, we seek the optimal transport network in the presence of random damage by averaging over damage to each link. In the second case, we seek the network that optimizes transport when the load is sparsely distributed: at any given time most sinks are closed. We find that both criteria lead to the presence of loops in the optimum state.

Loading 0906.0006v1…