{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:14:02Z","timestamp":1743149642578,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319635781"},{"type":"electronic","value":"9783319635798"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63579-8_27","type":"book-chapter","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T01:02:42Z","timestamp":1501635762000},"page":"346-361","source":"Crossref","is-referenced-by-count":1,"title":["Counting Edges and Triangles in Online Social Networks via Random Walk"],"prefix":"10.1007","author":[{"given":"Yang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Cheng","family":"Long","sequence":"additional","affiliation":[]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Zitong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,3]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Katzir, L., Liberty, E., Somekh, O.: Estimating sizes of social networks via biased sampling. In: WWW, pp. 597\u2013606 (2011)","DOI":"10.1145\/1963405.1963489"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Hardiman, S.J., Katzir, L.: Estimating clustering coefficients and size of social networks via random walk. In: WWW, pp. 539\u2013550 (2013)","DOI":"10.1145\/2488388.2488436"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: Path sampling: a fast and provable method for estimating 4-vertex subgraph counts. In: WWW, pp. 495\u2013505 (2015)","DOI":"10.1145\/2736277.2741101"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Lee, C.-H., Xu, X., Eun, D.Y.: Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling. In: SIGMETRICS, pp. 319\u2013330 (2012)","DOI":"10.1145\/2254756.2254795"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Yu, J., Qin, L., Mao, R., Jin, T.: On random walk based graph sampling. In: ICDE, pp. 927\u2013938 (2015)","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Wang, P., Lui, J.C.S., Ribeiro, B., Towsley, D., Zhao, J., Guan, X.: Efficiently estimating motif statistics of large networks. In: ICDE, pp. 8:1\u20138:27 (2014)","DOI":"10.1145\/2629564"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Bhuiyan, M., Rahman, M., Al Hasan, M.: Guise: uniform sampling of graphlets for large graph analysis. In: ICDM, pp. 91\u2013100 (2012)","DOI":"10.1109\/ICDM.2012.87"},{"issue":"4","key":"27_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/sam.11224","volume":"7","author":"C Seshadhri","year":"2014","unstructured":"Seshadhri, C., Pinar, A., KoldaWedge, T.G.: Sampling for computing clustering coefficients and triangle counts on large graphs. Stat. Anal. Data Mining 7(4), 233\u2013235 (2014)","journal-title":"Stat. Anal. Data Mining"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T.: Walking in Facebook: a case study of unbiased sampling of OSNs. In: INFOCOM, pp. 1\u20139 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: KDD, pp. 16\u201324 (2008)","DOI":"10.1145\/1401890.1401898"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Eckmann, J.-P., Moses, E.: Curvature of co-links uncovers hidden thematic layers in the World Wide Web. In: PNAS, pp. 5825\u20135829 (2002)","DOI":"10.1073\/pnas.032093399"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14, 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"27_CR13","unstructured":"Berry, J.W., Fosvedt, L., Nordman, D., Phillips, C.A., Wilson, A.G.: Listing triangles in expected linear time on power law graphs with exponent at least 7\/3. Technical report SAND 2010\u20134474C (2011)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks and its applications. In: KDD, pp. 672\u2013680 (2011)","DOI":"10.1145\/2020408.2020513"},{"key":"27_CR15","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoret. Comput. Sci. 407, 458\u2013473 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: Doulion: counting triangles in massive graphs with a coin. In: KDD, pp. 837\u2013846 (2009)","DOI":"10.1145\/1557019.1557111"},{"key":"27_CR17","unstructured":"Chen, X., Li, Y., Wang, G.P., Lui, J.C.S.: A general framework for estimating graphlet statistics via random walk. CoRR abs\/1603.07504 (2016)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Silvestri, F., Kang, U., Pagh, R.: MapReduce triangle enumeration with guarantees. In: ACM Conference Information Knowledge Manage, pp. 1739\u20131748 (2014)","DOI":"10.1145\/2661829.2662017"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW, pp. 607\u2013614 (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-642-24082-9_83","volume-title":"Convergence and Hybrid Information Technology","author":"J-H Yoon","year":"2011","unstructured":"Yoon, J.-H., Kim, S.-R.: Improved sampling for triangle counting with mapreduce. In: Lee, G., Howard, D., \u015al\u0119zak, D. (eds.) ICHIT 2011. LNCS, vol. 6935, pp. 685\u2013689. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24082-9_83"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.-W.: Massive graph triangulation. In: SIGMOD, pp. 325\u2013336 (2013)","DOI":"10.1145\/2463676.2463704"},{"issue":"4","key":"27_CR22","first-page":"17","volume":"6","author":"S Chu","year":"2012","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. ACM Trans. Knowl. Discov. Data 6(4), 17 (2012)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Pagh, R., Silvestri, F.: The input\/output complexity of triangle enumeration. In: ACM Symposium Principles Database System, pp. 224\u2013233 (2014)","DOI":"10.1145\/2594538.2594552"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Pinar, A., Kold, T.G.: Triadic measures on graphs: the power of wedge sampling. In: SDM (2013)","DOI":"10.1137\/1.9781611972832.2"},{"key":"27_CR25","doi-asserted-by":"crossref","first-page":"056119","DOI":"10.1103\/PhysRevE.83.056119","volume":"83","author":"JW Berry","year":"2011","unstructured":"Berry, J.W., Hendrickson, B., LaViolette, R.A., Phillips, C.A.: Tolerating the community detection resolutionlimit with edge weighting. Phys. Rev. E 83, 056119 (2011)","journal-title":"Phys. Rev. E"},{"key":"27_CR26","unstructured":"Counting Edges and Triangles in Online Social Networks via Random Walk. https:\/\/www.dropbox.com\/sh\/228dpiup7qgp6mw\/AAA4ijK6jsVUosKNz2OHSlUba?dl=0"},{"key":"27_CR27","unstructured":"SNAP Datasets: Standford large network dataset collection. http:\/\/snap.standford.edu\/data"},{"key":"27_CR28","unstructured":"KONECT Datasets: The koblenz network collection. http:\/\/konect.uni-koblenz.de"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63579-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T19:06:56Z","timestamp":1569956816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63579-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319635781","9783319635798"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63579-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}