{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:46:22Z","timestamp":1725745582266},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402845"},{"type":"electronic","value":"9783642402852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40285-2_29","type":"book-chapter","created":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T12:02:58Z","timestamp":1376740978000},"page":"327-341","source":"Crossref","is-referenced-by-count":2,"title":["Incremental Algorithms for Sampling Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Xuesong","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuan Quang","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"http:\/\/blog.twitter.com\/2011\/03\/numbers.html"},{"key":"29_CR2","unstructured":"http:\/\/snap.stanford.edu"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Kompella, R.: Space-efficient sampling from social activity streams. In: BigMine, pp. 53\u201360 (2012)","DOI":"10.1145\/2351316.2351324"},{"issue":"5439","key":"29_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.-L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Berg, B.A.: Markov Chain Monte Carlo Simulations and Their Statistical Analysis: With Web-based Fortran Code. World Scientific Publishing Company (2004)","DOI":"10.1142\/5602"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Desikan, P.K., Pathak, N., Srivastava, J., Kumar, V.: Incremental page rank computation on evolving graphs. In: WWW (Special Interest Tracks and Posters), pp. 1094\u20131095 (2005)","DOI":"10.1145\/1062745.1062885"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Luo, J., Tan, Z., Wang, X., Wu, Y.: Incremental graph pattern matching. In: SIGMOD Conference, pp. 925\u2013936 (2011)","DOI":"10.1145\/1989323.1989420"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Geweke, J.: Evaluating the accuracy of sampling-based approaches to the calculation of posterior moments. In: Bayesian Statistics, pp. 169\u2013193 (1992)","DOI":"10.21034\/sr.148"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Gionis, A., Mannila, H., Mielik\u00e4inen, T., Tsaparas, P.: Assessing data mining results via swap randomization. In: KDD, pp. 167\u2013176 (2006)","DOI":"10.1145\/1150402.1150424"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in facebook: A case study of unbiased sampling of osns. In: INFOCOM, pp. 2498\u20132506 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"W.K. Hastings","year":"1970","unstructured":"Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika\u00a057(1), 97\u2013109 (1970)","journal-title":"Biometrika"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"H\u00fcbler, C., Kriegel, H.-P., Borgwardt, K.M., Ghahramani, Z.: Metropolis algorithms for representative subgraph sampling. In: ICDM, pp. 283\u2013292 (2008)","DOI":"10.1109\/ICDM.2008.124"},{"issue":"11","key":"29_CR13","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N. Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics\u00a020(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: KDD, pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. TKDD\u00a01(1) (2007)","DOI":"10.1145\/1217299.1217301"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-31235-9_13","volume-title":"Scientific and Statistical Database Management","author":"X. Lu","year":"2012","unstructured":"Lu, X., Bressan, S.: Sampling connected induced subgraphs uniformly at random. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol.\u00a07338, pp. 195\u2013212. Springer, Heidelberg (2012)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Sampling community structure. In: WWW, pp. 701\u2013710 (2010)","DOI":"10.1145\/1772690.1772762"},{"issue":"6","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of State Calculations by Fast Computing Machines. The Journal of Chemical Physics\u00a021(6), 1087\u20131092 (1953)","journal-title":"The Journal of Chemical Physics"},{"issue":"5594","key":"29_CR19","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Blocks of Complex Networks. Science\u00a0298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Ribeiro, B.F., Towsley, D.F.: Estimating and sampling graphs with multidimensional random walks. In: Internet Measurement Conference, pp. 390\u2013403 (2010)","DOI":"10.1145\/1879141.1879192"},{"issue":"2","key":"29_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00453-010-9401-5","volume":"61","author":"L. Roditty","year":"2011","unstructured":"Roditty, L., Zwick, U.: On dynamic shortest paths problems. Algorithmica\u00a061(2), 389\u2013401 (2011)","journal-title":"Algorithmica"},{"key":"29_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science)","author":"A. Sinclair","year":"1993","unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach (Progress in Theoretical Computer Science). Birkh\u00e4user, Boston (1993)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40285-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T04:24:19Z","timestamp":1596342259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40285-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402845","9783642402852"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40285-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}