Journal of Graph Algorithms and Applications the H-index of a Graph and Its Application to Dynamic Subgraph Statistics

We describe a data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices. More generally it can be used to maintain the number of copies of each possible three-vertex subgraph in time O(h) per update, where h is the h-index of the graph, the maximum number such that the graph contains $h$ vertices of degree at least h. We also show how to maintain the h-index itself, and a collection of h high-degree vertices in the graph, in constant time per update. Our data structure has applications in social network analysis using the exponential random graph model (ERGM); its bound of O(h) time per edge is never worse than the Theta(sqrt m) time per edge necessary to list all triangles in a static graph, and is strictly better for graphs obeying a power law degree distribution. In order to better understand the behavior of the h-index statistic and its implications for the performance of our algorithms, we also study the behavior of the h-index on a set of 136 real-world networks.

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

[2]  David Eppstein,et al.  Connectivity, graph minors, and subgraph multiplicity , 1993, J. Graph Theory.

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

[4]  Vojtech Rödl,et al.  A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph , 1995, SIAM J. Comput..

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

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

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

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

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

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

[11]  Kazuo Iwama,et al.  CONNECTIVITY , 1996, Graph Theory and Its Applications.

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

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

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

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

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

[17]  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 .

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

[19]  Mikkel Thorup,et al.  Dynamic Graph Algorithms with Applications , 2000, SWAT.

[20]  David Eppstein,et al.  Dynamic graph algorithms , 2010 .

[21]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[22]  Jeffrey Xu Yu,et al.  Finding maximal cliques in massive networks , 2011, TODS.

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

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

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

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

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

[28]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

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

[30]  David Eppstein,et al.  Arboricity and Bipartite Subgraph Listing Algorithms , 1994, Inf. Process. Lett..

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

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

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

[34]  Kenneth H. Rosen.  Handbook of Discrete and Combinatorial Mathematics , 1999 .