Structural Inference of Hierarchies in Networks

@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}
}
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… 
Detecting hierarchical structure in networks
TLDR
This work proposes a generative Bayesian model that is able to infer whether hierarchies are present or not from a hypothesis space encompassing all types of hierarchical tree structures, and proposes a collapsed Gibbs sampling procedure that jointly infers a partition and its hierarchical structure.
Detectability of ranking hierarchies in directed networks
TLDR
It is found that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network.
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
TLDR
This paper employs approximation algorithms for the graph-partitioning problem to characterize as a function of size the statistical and structural properties of partitions of graphs that could plausibly be interpreted as communities, and defines the network community profile plot, which characterizes the "best" possible community—according to the conductance measure—over a wide range of size scales.
Resolution of ranking hierarchies in directed networks
TLDR
It is found that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network.
Mixture models and exploratory analysis in networks
  • M. Newman, E. Leicht
  • Computer Science, Physics
    Proceedings of the National Academy of Sciences
  • 2007
TLDR
A general technique for detecting structural features in large-scale network data that works by dividing the nodes of a network into classes such that the members of each class have similar patterns of connection to other nodes is described.
Finding Statistically Significant Communities in Networks
TLDR
OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics, is presented.
Detecting the overlapping and hierarchical community structure in complex networks
Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are
Hierarchical Random Graphs for Networks with Weighted Edges and Multiple Edge Attributes
Network analysis has proven a useful tool for analyzing properties of complex systems. Many real-world systems exhibit hierarchical structure and analysis tools should leverage that knowledge in
Hierarchical block structures and high-resolution model selection in large networks
TLDR
A nested generative model is constructed that, through a complete description of the entire network hierarchy at multiple scales, enables the detection of modular structure at levels far beyond those possible with current approaches, and is based on the principle of parsimony.
Statistical properties of community structure in large social and information networks
TLDR
It is found that a generative model, in which new edges are added via an iterative "forest fire" burning process, is able to produce graphs exhibiting a network community structure similar to that observed in nearly every network dataset examined.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
Detecting community structure in networks
TLDR
A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Physics, Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Finding community structure in very large networks.
TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.
Defining and identifying communities in networks.
TLDR
This article proposes a local algorithm to detect communities which outperforms the existing algorithms with respect to computational cost, keeping the same level of reliability and applies to a network of scientific collaborations, which, for its size, cannot be attacked with the usual methods.
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
The Structure and Function of Complex Networks
  • M. Newman
  • Physics, Computer Science
    SIAM Rev.
  • 2003
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Assortative mixing in networks.
  • M. Newman
  • Computer Science, Physics
    Physical review letters
  • 2002
TLDR
This work proposes a model of an assortatively mixed network and finds that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.
Social Network Analysis
This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is argued
...
1
2
3
...