{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:15:33Z","timestamp":1726060533792},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366827"},{"type":"electronic","value":"9783030366834"}],"license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36683-4_17","type":"book-chapter","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T22:08:15Z","timestamp":1574806095000},"page":"203-215","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Induced Edge Samplings and Triangle Count Distributions in Large Networks"],"prefix":"10.1007","author":[{"given":"Nelson","family":"Antunes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianjian","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladas","family":"Pipiras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"e1226","DOI":"10.1002\/widm.1226","volume":"8","author":"M Al Hasan","year":"2018","unstructured":"Al Hasan, M., Dave, V.S.: Triangle counting in large networks: a review. WIREs Data Mining Knowl. Discov. 8(2), e1226 (2018)","journal-title":"WIREs Data Mining Knowl. Discov."},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2891106","volume":"1","author":"N Antunes","year":"2016","unstructured":"Antunes, N., Pipiras, V.: Estimation of flow distributions from sampled traffic. ACM Trans. Model Perform. Eval. Comput. Syst. 1(3), 11:1\u201311:28 (2016)","journal-title":"ACM Trans. Model Perform. Eval. Comput. Syst."},{"key":"17_CR3","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the 13th Annual ACM-SIAM SODA, pp.\u00a0623\u2013632 (2002)"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1326561.1326563","volume":"2","author":"L Becchetti","year":"2008","unstructured":"Becchetti, L., Castillo, C., Donato, D., Baeza-YATES, R., Leonardi, S.: Link analysis for web spam detection. ACM Trans. Web 2(1), 2:1\u20132:42 (2008)","journal-title":"ACM Trans. Web"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART PODS, pp.\u00a0253\u2013262 (2006)","DOI":"10.1145\/1142351.1142388"},{"issue":"9","key":"17_CR6","doi-asserted-by":"publisher","first-page":"5825","DOI":"10.1073\/pnas.032093399","volume":"99","author":"J-P Eckmann","year":"2002","unstructured":"Eckmann, J.-P., Moses, E.: Curvature of co-links uncovers hidden thematic layers in the world wide web. Proc. Natl. Acad. Sci. 99(9), 5825\u20135829 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TSP.2008.2008212","volume":"57","author":"YC Eldar","year":"2009","unstructured":"Eldar, Y.C.: Generalized SURE for exponential families: applications to regularization. IEEE Trans. Signal Process. 57(2), 471\u2013481 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2700395","volume":"9","author":"M Jha","year":"2015","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox. ACM Trans. Knowl. Discov. Data 9(3), 15:1\u201315:21 (2015)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88146-1","volume-title":"Statistical Analysis of Network Data","author":"ED Kolaczyk","year":"2009","unstructured":"Kolaczyk, E.D.: Statistical Analysis of Network Data. Springer, New York (2009). \nhttps:\/\/doi.org\/10.1007\/978-0-387-88146-1"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/3022186","volume":"12","author":"Y Lim","year":"2018","unstructured":"Lim, Y., Jung, M., Kang, U.: Memory-efficient and accurate sampling for counting local triangles in graph streams: from simple to multigraphs. ACM Trans. Knowl. Discov. Data 12(1), 4:1\u20134:28 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"17_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2018","unstructured":"Newman, M.: Networks: An Introduction, 2nd edn. Oxford University Press Inc., New York (2018)","edition":"2"},{"issue":"7043","key":"17_CR12","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/3059194","volume":"11","author":"LD Stefani","year":"2017","unstructured":"Stefani, L.D., Epasto, A., Riondato, M., Upfal, E.: Tri\u00c8st: counting local and global triangles in fully dynamic streams with fixed memory size. ACM Trans. Knowl. Discov. Data 11(4), 43:1\u201343:50 (2017)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"10","key":"17_CR14","doi-asserted-by":"publisher","first-page":"7011","DOI":"10.1109\/TIT.2011.2165150","volume":"57","author":"P Tune","year":"2011","unstructured":"Tune, P., Veitch, D.: Fisher information in flow size distribution estimation. IEEE Trans. Info. Theory 57(10), 7011\u20137035 (2011)","journal-title":"IEEE Trans. Info. Theory"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"1","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 1(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1214\/14-AOAS800","volume":"9","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y., Kolaczyk, E.D., Spencer, B.D.: Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks. Ann. Appl. Stat. 9(1), 166\u2013199 (2015)","journal-title":"Ann. Appl. Stat."}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36683-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T22:11:10Z","timestamp":1574806270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36683-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"ISBN":["9783030366827","9783030366834"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36683-4_17","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}