Efficient orbit-aware triad and quad census in directed and undirected graphs

The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed repeatedly in MCMC sampling and estimation algorithms. We present a new approach to count all induced and non-induced four-node subgraphs (the quad census) on a per-node and per-edge basis, complete with a separation into their non-automorphic roles in these subgraphs. It is the first approach to do so in a unified manner, and is based on only a clique-listing subroutine. Computational experiments indicate that, despite its simplicity, the approach outperforms previous, less general approaches.By way of the more presentable triad census, we additionally show how to extend the quad census to directed graphs. As a byproduct we obtain the asymptotically fastest triad census algorithm to date.

[1]  Derek Doran,et al.  Triad-Based Role Discovery for Large Social Systems , 2014, SocInfo Workshops.

[2]  Guy Melançon,et al.  Multiscale visualization of small world networks , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).

[3]  Katherine Faust,et al.  7. Very Local Structure in Social Networks , 2007 .

[4]  Tijana Milenkovic,et al.  GraphCrunch: A tool for large network analyses , 2008, BMC Bioinformatics.

[5]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[6]  J. E. Hirsch,et al.  An index to quantify an individual's scientific research output , 2005, Proc. Natl. Acad. Sci. USA.

[7]  Katherine Faust,et al.  Very Local Structure in Social Networks , 2006 .

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

[9]  P. Holland,et al.  Local Structure in Social Networks , 1976 .

[10]  Vladimir Batagelj,et al.  A subquadratic triad census algorithm for large sparse networks with small maximum degree , 2001, Soc. Networks.

[11]  Jayme Luiz Szwarcfiter,et al.  Arboricity, h-index, and dynamic algorithms , 2010, Theor. Comput. Sci..

[12]  Tijana Milenkovic,et al.  Graphlet-based edge clustering reveals pathogen-interacting proteins , 2012, Bioinform..

[13]  Guy Melançon,et al.  Edge Metrics for Visual Graph Analytics: A Comparative Study , 2008, 2008 12th International Conference Information Visualisation.

[14]  P. Holland,et al.  A Method for Detecting Structure in Sociometric Data , 1970, American Journal of Sociology.

[15]  Igor Jurisica,et al.  Modeling interactome: scale-free or geometric? , 2004, Bioinform..

[16]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[17]  David Eppstein,et al.  Journal of Graph Algorithms and Applications the H-index of a Graph and Its Application to Dynamic Subgraph Statistics , 2022 .

[18]  Yuval Shavitt,et al.  RAGE - A rapid graphlet enumerator for large networks , 2012, Comput. Networks.

[19]  Ulrik Brandes,et al.  Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks , 2015, J. Graph Algorithms Appl..

[20]  Mason A. Porter,et al.  Comparing Community Structure to Characteristics in Online Collegiate Social Networks , 2008, SIAM Rev..

[21]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[22]  Tijana Milenkoviæ,et al.  Uncovering Biological Network Function via Graphlet Degree Signatures , 2008, Cancer informatics.

[23]  Andrzej Lingas,et al.  Counting and detecting small subgraphs via equations and matrix multiplication , 2011, SODA '11.

[24]  James Moody,et al.  Matrix methods for calculating the triad census , 1998 .

[25]  Janez Demsar,et al.  A combinatorial approach to graphlet counting , 2014, Bioinform..

[26]  Dieter Kratsch,et al.  Finding and Counting Small Induced Subgraphs Efficiently , 1995, WG.

[27]  Ulrik Brandes,et al.  Simmelian backbones: Amplifying hidden homophily in Facebook networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[28]  Ulrik Brandes,et al.  Triangle Listing Algorithms: Back from the Diversion , 2014, ALENEX.

[29]  Ulrik Brandes,et al.  Quad Census Computation: Simple, Efficient, and Orbit-Aware , 2016, NetSci-X.

[30]  David Eppstein,et al.  Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics , 2010, ArXiv.

[31]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[32]  Takao Nishizeki,et al.  Edge-Coloring and f-Coloring for Various Classes of Graphs , 1994, J. Graph Algorithms Appl..

[33]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[34]  Robert L. Davis.  The number of structures of finite relations , 1953 .

[35]  Garry Robins,et al.  An introduction to exponential random graph (p*) models for social networks , 2007, Soc. Networks.