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

by Anatol E. Wegner

Released as a article .

2014  

Abstract

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 subgraph cover is defined to be a set of subgraphs such that every edge of the graph is contained in at least one of the subgraphs in the cover. Some recently introduced random graph models that can incorporate significant densities of motifs have natural formulations in terms of subgraph covers and the presented approach can be used to match networks with such models. To prove the practical value of our approach we also present a heuristic for the resulting NP-hard optimization problem and give results for several real world networks.
In text/plain format

Archived Files and Locations

application/pdf  1.3 MB
file_7cpoo4ywuvho7bdr47zr6tbru4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2014-10-01
Version   v2
Language   en ?
arXiv  1406.1414v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 33845124-fd59-4a54-9df3-57c269a41122
API URL: JSON