Structural Inference of Hierarchies in Networks

Abstract

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.

DOI: 10.1007/978-3-540-73133-7_1

Extracted Key Phrases

8 Figures and Tables

05101520072008200920102011201220132014201520162017
Citations per Year

83 Citations

Semantic Scholar estimates that this publication has 83 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Clauset2006StructuralIO, title={Structural Inference of Hierarchies in Networks}, author={Aaron Clauset and Cristopher Moore and Mark E. J. Newman}, booktitle={SNA@ICML}, year={2006} }