Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics

We present techniques for maintaining subgraph frequencies in a dynamic graph, using data structures that are parameterized in terms of h, the h-index of the graph. Our methods extend previous results of Eppstein and Spiro for maintaining statistics for undirected subgraphs of size three to directed subgraphs and to subgraphs of size four. For the directed case, we provide a data structure to maintain counts for all 3-vertex induced subgraphs in O(h) amortized time per update. For the undirected case, we maintain the counts of size-four subgraphs in O(h^2) amortized time per update. These extensions enable a number of new applications in Bioinformatics and Social Networking research.

[1]  Friedrich Eisenbrand,et al.  On the complexity of fixed parameter clique and dominating set , 2004, Theor. Comput. Sci..

[2]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, STOC.

[3]  O. Frank.  Statistical analysis of change in networks , 1991 .

[4]  Natasa Przulj,et al.  Biological network comparison using graphlet degree distribution , 2007, Bioinform..

[5]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[6]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[7]  Raphael Yuster,et al.  Finding and counting cliques and independent sets in r-uniform hypergraphs , 2006, Inf. Process. Lett..

[8]  David Eppstein,et al.  Studying (non-planar) road networks through an algorithmic lens , 2008, GIS '08.

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

[10]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[11]  Tin Wee Tan,et al.  In silico grouping of peptide/HLA class I complexes using structural interaction characteristics , 2007, Bioinform..

[12]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for Kemeny Scores , 2008, AAIM.

[13]  P. Pattison,et al.  New Specifications for Exponential Random Graph Models , 2006 .

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

[15]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[16]  Ove Frank,et al.  http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained , 2007 .

[17]  Igor Jurisica,et al.  Efficient estimation of graphlet frequency distributions in protein-protein interaction networks , 2006, Bioinform..

[18]  S. Wasserman,et al.  Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp , 1996 .

[19]  Martina Morris,et al.  Advances in exponential random graph (p*) models , 2007, Soc. Networks.

[20]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[21]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

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

[23]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[24]  Tom A. B. Snijders,et al.  Markov Chain Monte Carlo Estimation of Exponential Random Graph Models , 2002, J. Soc. Struct..

[25]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[26]  Rolf Niedermeier,et al.  On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER , 2000, ISAAC.

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

[28]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[29]  Erik D. Demaine,et al.  Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs , 2005, TALG.

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

[31]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[32]  Ryan Williams,et al.  Finding, Minimizing, and Counting Weighted Subgraphs , 2013, SIAM J. Comput..

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

[34]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.