{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:06:22Z","timestamp":1743127582978,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031211300"},{"type":"electronic","value":"9783031211317"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21131-7_23","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:04:15Z","timestamp":1674669855000},"page":"297-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconstructing Degree Distribution and\u00a0Triangle Counts from\u00a0Edge-Sampled Graphs"],"prefix":"10.1007","author":[{"given":"Naomi A.","family":"Arnold","sequence":"first","affiliation":[]},{"given":"Ra\u00fal J.","family":"Mondrag\u00f3n","sequence":"additional","affiliation":[]},{"given":"Richard G.","family":"Clegg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Kompella, R.: Network sampling: From static to streaming graphs. ACM Trans. Knowl. Discov. Data (2013)","key":"23_CR1","DOI":"10.1145\/2601438"},{"doi-asserted-by":"crossref","unstructured":"Antunes, N., Guo, T., Pipiras, V.: Sampling methods and estimation of triangle count distributions in large networks. Netw. Sci. (2021)","key":"23_CR2","DOI":"10.1017\/nws.2021.2"},{"unstructured":"Arnold, N.: Studying evolving complex networks. Ph.D. thesis, Queen Mary University of London (2021)","key":"23_CR3"},{"doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science (1999)","key":"23_CR4","DOI":"10.1126\/science.286.5439.509"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1214\/21-AOS2134","volume":"50","author":"BB Bhattacharya","year":"2022","unstructured":"Bhattacharya, B.B., Das, S., Mukherjee, S.: Motif estimation via subgraph sampling: the fourth-moment phenomenon. Annals Stat. 50(2), 987\u20131011 (2022)","journal-title":"Annals Stat."},{"doi-asserted-by":"crossref","unstructured":"Bianconi, G.: Grand canonical ensembles of sparse networks and Bayesian inference. Entropy (2022)","key":"23_CR6","DOI":"10.3390\/e24050633"},{"unstructured":"Chen, Q., Chang, H., Govindan, R., Jamin, S.: The origin of power laws in internet topologies revisited. In: Proceedings of IEEE Computing and Communication Societies (2002)","key":"23_CR7"},{"unstructured":"Erd\u0151s, P., R\u00e9nyi, A., et al.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. (1960)","key":"23_CR8"},{"doi-asserted-by":"crossref","unstructured":"Feld, S.L.: Why your friends have more friends than you do. Am. J. Sociol. (1991)","key":"23_CR9","DOI":"10.1086\/229693"},{"unstructured":"Frank, O.: Statistical inference in graphs. Ph.D. thesis, Foa Repro Stockholm (1971)","key":"23_CR10"},{"doi-asserted-by":"crossref","unstructured":"Ganguly, A., Kolaczyk, E.D.: Estimation of vertex degrees in a sampled network. In: Asilomar Conference on Signals, Systems, and Computers (2017)","key":"23_CR11","DOI":"10.1109\/ACSSC.2017.8335492"},{"doi-asserted-by":"crossref","unstructured":"Katzir, L., Liberty, E., Somekh, O.: Estimating sizes of social networks via biased sampling. In: Proceedings on International Conference on World Wide Web (2011)","key":"23_CR12","DOI":"10.1145\/1963405.1963489"},{"unstructured":"Klusowski JM, Wu, J.: Counting motifs with graph sampling. In: Conference on Learning Theory, pp. 1966\u20132011. PMLR (2018)","key":"23_CR13"},{"doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining (2006)","key":"23_CR14","DOI":"10.1145\/1150402.1150479"},{"unstructured":"Morstatter, F., Pfeffer, J., Liu, H., Carley, K.: Is the sample good enough? comparing data from Twitter\u2019s streaming API with Twitter\u2019s firehose. In: Proceedings of the International AAAI Conference on Web and Social Media (2013)","key":"23_CR15"},{"doi-asserted-by":"crossref","unstructured":"Newman, M.E.: The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences (2001)","key":"23_CR16","DOI":"10.1073\/pnas.98.2.404"},{"issue":"6","key":"23_CR17","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1038\/s41567-018-0076-1","volume":"14","author":"ME Newman","year":"2018","unstructured":"Newman, M.E.: Network structure from rich but noisy data. Nat. Phys. 14(6), 542\u2013545 (2018)","journal-title":"Nat. Phys."},{"doi-asserted-by":"crossref","unstructured":"Stefani, L.D., Epasto, A., Riondato, M., Upfal, E.: Triest: counting local and global triangles in fully dynamic streams with fixed memory size. ACM Trans. Knowl. Discov. Data (TKDD) (2017)","key":"23_CR18","DOI":"10.1145\/3059194"},{"doi-asserted-by":"crossref","unstructured":"Stumpf, M.P., Wiuf, C., May, R.M.: Subnets of scale-free networks are not scale-free: sampling properties of networks. PNAS (2005)","key":"23_CR19","DOI":"10.1073\/pnas.0501179102"},{"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: Proceedings International Conference on Knowledge Discovery and Data Mining (2009)","key":"23_CR20","DOI":"10.1145\/1557019.1557111"},{"unstructured":"Twitter: Stream Tweets in real-time: developer documentation (2022). https:\/\/developer.twitter.com\/en\/docs\/tutorials\/stream-tweets-in-real-time","key":"23_CR21"},{"doi-asserted-by":"crossref","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature (1998)","key":"23_CR22","DOI":"10.1038\/30918"},{"doi-asserted-by":"crossref","unstructured":"Young, J.-G., Cantwell, G.T., Newman, M.: Bayesian inference of network structure from unreliable data. J. Complex Netw. (2020)","key":"23_CR23","DOI":"10.1093\/comnet\/cnaa046"},{"doi-asserted-by":"crossref","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. Annals Appl. Stat. (2015)","key":"23_CR24","DOI":"10.1214\/14-AOAS800"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21131-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:07:08Z","timestamp":1674670028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21131-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031211300","9783031211317"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21131-7_23","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2016","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":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2022","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"}}]}}