%0 Journal Article %1 Mones2012 %A Mones, Enys %A Vicsek, Lilla %A Vicsek, Tamás %D 2012 %I Public Library of Science %J PLoS ONE %K hierarchical networks %N 3 %P e33799 %R 10.1371/journal.pone.0033799 %T Hierarchy Measure for Complex Networks %U http://dx.doi.org/10.1371%2Fjournal.pone.0033799 %V 7 %X <p>Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges).</p> <p>Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy.</p> <p>Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network.</p> <p>We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. <xref ref-type="sec" rid="s2">Results</xref> for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure.</p>

@article{Mones2012, abstract = {<p>Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges).</p> <p>Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy.</p> <p>Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network.</p> <p>We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. <xref ref-type="sec" rid="s2">Results</xref> for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure.</p>}, added-at = {2012-11-15T11:51:52.000+0100}, author = {Mones, Enys and Vicsek, Lilla and Vicsek, Tamás}, biburl = {https://www.bibsonomy.org/bibtex/2aaa4ee441d7762727a28dc37b1e63674/lopusz_kdd}, description = {PLOS ONE: Hierarchy Measure for Complex Networks}, doi = {10.1371/journal.pone.0033799}, interhash = {eb0f235d3960e8c0497cb81d9e667851}, intrahash = {aaa4ee441d7762727a28dc37b1e63674}, journal = {PLoS ONE}, keywords = {hierarchical networks}, month = {03}, number = 3, pages = {e33799}, publisher = {Public Library of Science}, timestamp = {2012-11-20T16:18:17.000+0100}, title = {Hierarchy Measure for Complex Networks}, url = {http://dx.doi.org/10.1371%2Fjournal.pone.0033799}, volume = 7, year = 2012 }