One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to form groups of groups, and so forth, up through all levels of organization in the network. Here, we give a precise definition of hierarchical structure, give a generic model for generating arbitrary hierarchical structure in a random graph, and describe a statistically principled way to learn the set of hierarchical features that most plausibly explain a particular real-world network. By applying this approach to two example networks, we demonstrate its advantages for the interpretation of network data, the annotation of graphs with edge, vertex and community properties, and the generation of generic null models for further hypothesis testing. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Clauset, A., Moore, C., & Newman, M. E. J. (2007). Structural inference of hierarchies in networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4503 LNCS, pp. 1–13). Springer Verlag. https://doi.org/10.1007/978-3-540-73133-7_1
Mendeley helps you to discover research relevant for your work.