SuperNoder: a tool to discover over-represented modular structures in networks

BackgroundNetworks whose nodes have labels can seem complex. Fortunately, many have substructures that occur often (“motifs”). A societal example of a motif might be a household. Replacing such motifs by named supernodes reduces the complexity of the network and can bring out insightful features. Doing so repeatedly may give hints about higher level structures of the network. We call this recursive process Recursive Supernode Extraction.ResultsThis paper describes algorithms and a tool to discover disjoint (i.e. non-overlapping) motifs in a network, replacing those motifs by new nodes, and then recursing. We show applications in food-web and protein-protein interaction (PPI) networks where our methods reduce the complexity of the network and yield insights.ConclusionsSuperNoder is a web-based and standalone tool which enables the simplification of big graphs based on the reduction of high frequency motifs. It applies various strategies for identifying disjoint motifs with the goal of enhancing the understandability of networks.

[1]  Jon M. Kleinberg,et al.  Detecting Strong Ties Using Network Motifs , 2017, WWW.

[2]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

[3]  Falk Schreiber,et al.  Frequency Concepts and Pattern Detection for the Analysis of Motifs in Networks , 2005, Trans. Comp. Sys. Biology.

[4]  Jonathan D. G. Jones,et al.  Evidence for Network Evolution in an Arabidopsis Interactome Map , 2011, Science.

[5]  Roger Guimerà,et al.  Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences.

[6]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[7]  Sebastian Wernicke,et al.  FANMOD: a tool for fast network motif detection , 2006, Bioinform..

[8]  Lawrence B. Holder,et al.  Substucture Discovery in the SUBDUE System , 1994, KDD Workshop.

[9]  Béatrice Duval,et al.  Differential Functional Analysis and Change Motifs in Gene Networks to Explore the Role of Anti-sense Transcription , 2016, ISBRA.

[10]  Falk Schreiber,et al.  MAVisto: a tool for the exploration of network motifs , 2005, Bioinform..

[11]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[12]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[13]  A Masoudi-Nejad,et al.  Building blocks of biological networks: a review on major network motif discovery algorithms. , 2012, IET systems biology.

[14]  Mong-Li Lee,et al.  NeMoFinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs , 2006, KDD '06.

[15]  Hongtao Lu,et al.  Adaptive Overlapping Community Detection with Bayesian NonNegative Matrix Factorization , 2017, DASFAA.

[16]  R. Carter.  11 – IT and society , 1991 .

[17]  Jure Leskovec,et al.  Local Higher-Order Graph Clustering , 2017, KDD.

[18]  Jure Leskovec,et al.  Overlapping Communities Explain Core–Periphery Organization of Networks , 2014, Proceedings of the IEEE.

[19]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Xiaofei Wang,et al.  Large Scale Measurement and Analytics on Social Groups of Device-to-Device Sharing in Mobile Social Networks , 2018, Mob. Networks Appl..

[21]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[22]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[23]  Sergio Gómez,et al.  Hierarchical Multiresolution Method to Overcome the Resolution Limit in Complex Networks , 2012, Int. J. Bifurc. Chaos.

[24]  Sahar Asadi,et al.  Kavosh: a new algorithm for finding network motifs , 2009, BMC Bioinformatics.

[25]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[26]  Zhao Yang,et al.  A Comparative Analysis of Community Detection Algorithms on Artificial Networks , 2016, Scientific Reports.

[27]  Tamer Kahveci,et al.  Motifs in the assembly of food web networks , 2015 .

[28]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[29]  D. Bu,et al.  Topological structure analysis of the protein-protein interaction network in budding yeast. , 2003, Nucleic acids research.

[30]  Mark E. J. Newman,et al.  An efficient and principled method for detecting communities in networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[32]  E McDonald-Madden,et al.  Using food-web theory to conserve ecosystems , 2016, Nature Communications.

[33]  Tamer Kahveci,et al.  Identification of large disjoint motifs in biological networks , 2016, BMC Bioinformatics.

[34]  Angelo Monteiro,et al.  The interplay between population stability and food-web topology predicts the occurrence of motifs in complex food-webs. , 2016, Journal of theoretical biology.

[35]  R. Lambiotte,et al.  Line graphs, link partitions, and overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Stefan Wuchty,et al.  Peeling the yeast protein network , 2005, Proteomics.

[37]  F. Schreiber,et al.  MODA: an efficient algorithm for network motif discovery in biological networks. , 2009, Genes & genetic systems.