EUVIMEDEUVIMED entdecken
Crossref

A flow-based hierarchy measure for weighted and directed networks

Guglielmo D’Amico, Riccardo De Blasis, Pegah Mahdavi, Vlad Stefan Barbu

Journal of Complex Networks · 28.10.2026 · 14 (6)

DOI: 10.1093/comnet/cnag043 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 05.11.2026. Verfasst von Guglielmo D’Amico und 3 weiteren Autor:innen. Die Arbeit nennt 30 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Hierarchical organization is a fundamental structural property of many directed networks and is commonly quantified using the Global Reaching Centrality (GRC) framework, which evaluates dispersion in node reachability based on shortest-path distances. However, in many empirical weighted directed systems, accessibility between nodes is mediated by multiple indirect pathways rather than by single geodesic routes. Motivated by this limitation, this paper introduces a flow-based extension of the GRC measure that replaces shortest-path reachability with a flow-based propagation mechanism based on first-hit weighted accessibility. The proposed formulation defines a local reaching centrality measure that captures the extent to which nodes accumulate accessibility from the rest of the network through weighted indirect propagation pathways. For each pair, all weighted paths of minimum length are aggregated and longer paths are excluded. A corresponding global hierarchy index is obtained by aggregating dispersion in these local scores while preserving the boundedness and permutation invariance properties of the original GRC measure. To avoid multiple counting of indirect transmission effects, accessibility contributions are computed using a first-hit layered construction that retains the hierarchical reachability structure underlying the classical formulation. Comparative analysis on structured benchmark configurations and ensembles of synthetic directed weighted networks shows that, once the shortest-path benchmark is normalized in the same way, the proposed index agrees with it when hierarchy is imposed by the support and departs from it where weights and multiple minimum-length paths matter; normalizing by the maximum local score is essential in heavy-tailed networks. Applications to the BACI international trade network and the UN migrant-stock network further illustrate how the measure provides a stable characterization of destination-side hierarchical accessibility in empirical flow systems. These results suggest that incorporating first-hit flow-based propagation at the minimum reachable distance extends GRC to weighted directed networks.

Zitieren

APA

D’Amico, G., Blasis, R. D., Mahdavi, P., & Barbu, V. S. (2026). A flow-based hierarchy measure for weighted and directed networks. Journal of Complex Networks, 14(6). https://doi.org/10.1093/comnet/cnag043

Vancouver

D’Amico G, Blasis RD, Mahdavi P, Barbu VS. A flow-based hierarchy measure for weighted and directed networks. Journal of Complex Networks. 2026;14(6). doi:10.1093/comnet/cnag043

BibTeX
@article{DAmico2026,
  author = {D’Amico, Guglielmo and Blasis, Riccardo De and Mahdavi, Pegah and Barbu, Vlad Stefan},
  title = {A flow-based hierarchy measure for weighted and directed networks},
  journal = {Journal of Complex Networks},
  year = {2026},
  volume = {14},
  number = {6},
  doi = {10.1093/comnet/cnag043}
}
Kostenlos starten →