Hierarchical ordering of reticular networks

Area of Science:

• Network Science
• Complex Systems
• Computational Biology

Background:

• The Horton-Strahler ordering scheme is a standard method for characterizing hierarchical networks in biological and physical systems.
• This scheme assigns integer orders to network edges based on branching topology, increasing from distal to root elements.
• The traditional Horton-Strahler ordering fails for networks containing loops due to contradictions in edge hierarchy.

Purpose of the Study:

• To generalize the Horton-Strahler ordering scheme to accommodate weighted planar reticular networks, including those with loops.
• To assign hierarchical levels to both edges and loops within these complex networks.
• To analyze the robustness of the generalized ordering to perturbations in edge weights.

Main Methods:

• Development of a generalized Horton-Strahler ordering applicable to weighted planar reticular networks.
• Classification of network edges into 'reticular' (loop-forming) and 'tree' (branching) edges.
• Theoretical analysis of the sensitivity of hierarchical levels to weight perturbations.

Main Results:

• The generalized method successfully assigns hierarchical levels to edges and loops in networks with loops.
• The ordering of reticular edges demonstrates greater robustness to noise in weight estimation compared to tree edges.
• The study provides a rigorous theoretical framework for analyzing weighted hierarchical networks.

Conclusions:

• The generalized Horton-Strahler ordering provides a robust method for analyzing hierarchical structures in networks with loops.
• The differential robustness of reticular versus tree edges offers insights into network stability and information flow.
• This approach has potential applications in studying biological networks, such as leaf venation patterns.