Nested hierarchies in planar graphs
arXiv:0906.4826 · doi:10.1016/j.dam.2011.07.018
Abstract
We construct a partial order relation which acts on the set of 3-cliques of a maximal planar graph G and defines a unique hierarchy. We demonstrate that G is the union of a set of special subgraphs, named `bubbles', that are themselves maximal planar graphs. The graph G is retrieved by connecting these bubbles in a tree structure where neighboring bubbles are joined together by a 3-clique. Bubbles naturally provide the subdivision of G into communities and the tree structure defines the hierarchical relations between these communities.
References in corpus (6)
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Hierarchical structure and the prediction of missing links in networks
- A tool for filtering information in complex systems
- Correlation based networks of equity returns sampled at different time horizons
- Complex Networks on Hyperbolic Surfaces
Cited by in corpus (6)
- Nestedness in complex networks: Observation, emergence, and implications
- Community detection for correlation matrices
- Hierarchical information clustering by means of topologically embedded graphs
- Relation between Financial Market Structure and the Real Economy: Comparison between Clustering Methods
- Exploring complex networks via topological embedding on surfaces
- Learning Clique Forests