Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Jeong, H., Barabasi, A.-L.: The diameter of the world wide web. Nature 401, 130–131 (1999)
Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209–223 (1997)
Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)
Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1), 33–47 (2005)
Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness i: Basic results. SIAM J. Comput. 24(4), 873–921 (1995)
Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms & Applications 3(3), 1–27 (1999)
Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275–291 (2000)
Eppstein, D., Goodrich, M.T.: Studying (non-planar) road networks through an algorithmic lens. In: GIS 2008: Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 1–10. ACM, New York (2008)
Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 278–289. Springer, Heidelberg (2009)
Eppstein, D., Spiro, E.S.: The h-index of a graph and its application to dynamic subgraph statistics. arXiv:0904.3741 (2009)
Frank, O.: Statistical analysis of change in networks. Statistica Neerlandica 45, 283–293 (1991)
Frank, O., Strauss, D.: Markov graphs. J. Amer. Statistical Assoc. 81, 832–842 (1986)
Hirsch, J.E.: An index to quantify an individual’s scientific research output. Proc. National Academy of Sciences 102(46), 16569–16572 (2005)
Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413–423 (1978)
Milenković, T., Pržulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Informatics 6, 257–273 (2008)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)
Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2), 63–77 (2003)
Price, D.J.d.S.: Networks of scientific papers. Science 149(3683), 510–515 (1965)
Pržulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177–e183 (2007)
Pržulj, N., Corneil, D.G., Jurisica, I.: Efficient estimation of graphlet frequency distributions in protein–protein interaction networks. Bioinformatics 22(8), 974–980 (2006)
Snijders, T.A.B.: Markov chain Monte Carlo estimation of exponential random graph models. Journal of Social Structure 3(2), 1–40 (2002)
Snijders, T.A.B., Pattison, P.E., Robins, G., Handcock, M.S.: New specifications for exponential random graph models. Sociological Methodology 36(1), 99–153 (2006)
Wasserman, S., Pattison, P.E.: Logit models and logistic regression for social networks, I: an introduction to Markov graphs and p *. Psychometrika 61, 401–425 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eppstein, D., Goodrich, M.T., Strash, D., Trott, L. (2010). Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-17458-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17457-5
Online ISBN: 978-3-642-17458-2
eBook Packages: Computer ScienceComputer Science (R0)