Structural Inference of Hierarchies in Networks
<|reference_start|>Structural Inference of Hierarchies in Networks: 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.<|reference_end|>
@article{clauset2006structural,
    title={Structural Inference of Hierarchies in Networks},
    author={Aaron Clauset and Cristopher Moore and M. E. J. Newman},
    journal={Proc. 23rd International Conference on Machine Learning (ICML),
  Workshop on Social Network Analysis, Pittsburgh PA, June 2006},
    year={2006},
    doi={10.1007/978-3-540-73133-7_1},
    archivePrefix={arXiv},
    eprint={physics/0610051},
    primaryClass={physics.soc-ph cs.LG physics.data-an}
}