title: Generalised power graph compression reveals dominant relationship patterns in complex networks.
abstract: We introduce a framework for the discovery of dominant relationship patterns in complex networks, by compressing the networks into power graphs with overlapping power nodes. When paired with enrichment analysis of node classification terms, the most compressible sets of edges provide a highly informative sketch of the dominant relationship patterns that define the network. In addition, this procedure also gives rise to a novel, link-based definition of overlapping node communities in which nodes are defined by their relationships with sets of other nodes, rather than through connections within the community. We show that this completely general approach can be applied to undirected, directed, and bipartite networks, yielding valuable insights into the large-scale structure of real-world networks, including social networks and food webs. Our approach therefore provides a novel way in which network architecture can be studied, defined and classified.
authors.affiliation: Theory of Condensed Matter, Cavendish Laboratory, University of Cambridge, JJ Thomson Avenue, Cambridge CB3 0HE, United Kingdom.
authors.forename: Sebastian E
authors.initials: SE
authors.lastname: Ahnert
mesh_terms: D000465:Algorithms; D000818:Animals; D003196:Computer Graphics / Q000706:statistics & numerical data*; D020387:Food Chain; D006801:Humans; D015233:Models, Statistical; D010944:Plants; D060756:Social Networking