• Login
View Item 
  • DASH Home
  • Harvard Kennedy School
  • HKS Students and Research Affiliates
  • View Item
  • DASH Home
  • Harvard Kennedy School
  • HKS Students and Research Affiliates
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of DASH
  • Communities & Collections
  • By Issue Date
  • Author
  • Title
  • Keyword
  • FAS Department
This Collection
  • By Issue Date
  • Author
  • Title
  • Keyword

Submitters

  • Login
  • Quick submit
  • Waiver Generator

About

  • About DASH
  • DASH Stories
  • DASH FAQs
  • Accessibility
  • COVID-related Research
  • Terms of Use
  • Privacy Policy

Statistics

  • By Schools
  • By Collections
  • By Departments
  • By Items
  • By Country
  • By Authors

Using arborescences to estimate hierarchicalness in directed complex networks

 
Thumbnail
View/Open
hierarchicalness-notrackchng.pdf (374.5Kb)
Author
Coscia, MicheleHARVARD
Published Version
https://doi.org/10.1371/journal.pone.0190825
Metadata
Show full item record
Citation
Coscia, Michele. 2018. “Using Arborescences to Estimate Hierarchicalness in Directed Complex Networks.” Edited by Constantine Dovrolis. PLOS ONE 13 (1) (January 30): e0190825. doi:10.1371/journal.pone.0190825.
Abstract
Complex networks are a useful tool for the understanding of complex systems. One of the emerging properties of such systems is their tendency to form hierarchies: networks can be organized in levels, with nodes in each level exerting control on the ones beneath them. In this paper, we focus on the problem of estimating how hierarchical a directed network is. We propose a structural argument: a network has a strong top-down organization if we need to delete only few edges to reduce it to a perfect hierarchy—an arborescence. In an arborescence, all edges point away from the root and there are no horizontal connections, both characteristics we desire in our idealization of what a perfect hierarchy requires. We test our arborescence score in synthetic and real-world directed networks against the current state of the art in hierarchy detection: agony, flow hierarchy and global reaching centrality. These tests highlight that our arborescence score is intuitive and we can visualize it; it is able to better distinguish between networks with and without a hierarchical structure; it agrees the most with the literature about the hierarchy of well-studied complex systems; and it is not just a score, but it provides an overall scheme of the underlying hierarchy of any directed complex network.
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:37140312

Collections
  • HKS Students and Research Affiliates [31]

Contact administrator regarding this item (to report mistakes or request changes)

e: osc@harvard.edu

t: +1 (617) 495 4089

Creative Commons license‌Creative Commons Attribution 4.0 International License

Except where otherwise noted, this work is subject to a Creative Commons Attribution 4.0 International License, which allows anyone to share and adapt our material as long as proper attribution is given. For details and exceptions, see the Harvard Library Copyright Policy ©2022 Presidents and Fellows of Harvard College.

  • Follow us on Twitter
  • Contact
  • Harvard Library
  • Harvard University