Subgraph covers - An information theoretic approach to motif analysis in networks

  title={Subgraph covers - An information theoretic approach to motif analysis in networks},
  author={Anatol E. Wegner},
  • A. Wegner
  • Published 5 June 2014
  • Computer Science, Mathematics
  • ArXiv
Many real world networks contain a statistically surprising number of certain subgraphs, called network motifs. In the prevalent approach to motif analysis, network motifs are detected by comparing subgraph frequencies in the original network with a statistical null model. In this paper we propose an alternative approach to motif analysis where network motifs are defined to be connectivity patterns that occur in a subgraph cover that represents the network using minimal total information. A… 

Figures and Tables from this paper

COMICS: a community property-based triangle motif clustering scheme

Results show that the community property-based triangle motif clustering scheme (COMICS) outperforms others in both runtime and accuracy, and the triangle motif structures can bridge network structures and statistical data in the academic collaboration area.

A Survey on Subgraph Counting

This survey aims to provide a comprehensive overview of the existing methods for subgraph counting, identifying and describing the main conceptual approaches, giving insight on their advantages and limitations, and providing pointers to existing implementations.

Hypergraph reconstruction from network data

This work introduces a Bayesian framework to infer higher-order interactions hidden in network data, based on the principle of parsimony and only includes higher- order structures when there is sufficient statistical evidence for them.

Compressing network populations with modal networks reveals structural diversity

It is shown that these nonparametric methods derived from the minimum description length principle recover planted heterogeneity in synthetic network populations and effectively identify important structural heterogeneities in example network populations representing global trade and the fossil record.

Identifying networks with common organizational principles

This paper introduces a new network comparison methodology that is aimed at identifying common organizational principles in networks that is simple, intuitive and applicable in a wide variety of settings ranging from the functional classification of proteins to tracking the evolution of a world trade network.

Networks beyond pairwise interactions: structure and dynamics



Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking

A novel algorithm for discovering large network motifs that achieves these goals, based on a novel symmetry-breaking technique, which eliminates repeated isomorphism testing, leading to an exponential speed-up over previous methods.

Kavosh: a new algorithm for finding network motifs

A new algorithm, Kavosh, for finding k-size network motifs with less memory and CPU time in comparison to other existing algorithms, based on counting all k- size sub-graphs of a given graph (directed or undirected).

Strategies for Network Motifs Discovery

A review and runtime comparison of current motif detection algorithms in the field and categorize the algorithms outlining the main differences and advantages of each strategy to allow a fair and objective efficiency comparison using a set of benchmark networks.

Random graphs containing arbitrary distributions of subgraphs

  • B. KarrerM. Newman
  • Mathematics, Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2010
This paper proposes and analyzes a class of random graph models that incorporates general subgraphs, allowing for nontreelike neighborhoods while still remaining solvable for many fundamental network properties.

Empirical comparison of algorithms for network community detection

Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have non-obvious size-dependent behavior.

FANMOD: a tool for fast network motif detection

FANMOD relies on recently developed algorithms to improve the efficiency of network motif detection by some orders of magnitude over existing tools, which facilitates the detection of larger motifs in bigger networks than previously possible.

Subgraphs in random networks.

It is found that certain subgraphs appear much more frequently than in Erdos networks, and the power exponent of the degree distribution, gamma, is used as a control parameter, and it is shown that random networks exhibit transitions between three regimes.

Motif Conservation Laws for the Configuration Model

The observation that some subgraphs, called motifs, appear more often in real networks than in their randomized counterparts has attracted much attention in the scientific community. In the prevalent

Defining and identifying communities in networks.

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.

Modularity and community structure in networks.

  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.