{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T20:10:09Z","timestamp":1755893409813,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Horizon Europe research and innovation program of the European Union","award":["101093202"],"award-info":[{"award-number":["101093202"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,7]]},"DOI":"10.1145\/3629527.3652899","type":"proceedings-article","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T12:19:06Z","timestamp":1715084346000},"page":"135-140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["An Extensive Characterization of Graph Sampling Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5886-9636","authenticated-orcid":false,"given":"S. Haleh","family":"S. Dizaji","sequence":"first","affiliation":[{"name":"University of Klagenfurt, Klagenfurt, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3665-639X","authenticated-orcid":false,"given":"Joze M.","family":"Rozanec","sequence":"additional","affiliation":[{"name":"Jozef Stefan Institute, Ljubljana, Slovenia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2376-5802","authenticated-orcid":false,"given":"Reza","family":"Farahani","sequence":"additional","affiliation":[{"name":"University of Klagenfurt, Klagenfurt, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6397-3705","authenticated-orcid":false,"given":"Dumitru","family":"Roman","sequence":"additional","affiliation":[{"name":"SINTEF, Oslo, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8247-5426","authenticated-orcid":false,"given":"Radu","family":"Prodan","sequence":"additional","affiliation":[{"name":"University of Klagenfurt, Klagenfurt, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Sami Abu-El-Haija et al. 2023. SubMix: learning to mix graph sampling heuristics. In Uncertainty in Artificial Intelligence. PMLR."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Nesreen K Ahmed et al. 2013. Network sampling: From static to streaming graphs. ACM Transactions on Knowledge Discovery from Data (TKDD) 8 (2013) 1--56.","DOI":"10.1145\/2601438"},{"key":"e_1_3_2_1_3_1","first-page":"7637","article-title":"Robustness of graph neural networks at scale","volume":"34","author":"Simon Geisler","year":"2021","unstructured":"Simon Geisler et al. 2021. Robustness of graph neural networks at scale. Advances in Neural Information Processing Systems 34 (2021), 7637--7649.","journal-title":"Advances in Neural Information Processing Systems"},{"volume-title":"2010 Proceedings IEEE Infocom. Ieee, 1--9.","author":"Minas","key":"e_1_3_2_1_4_1","unstructured":"Minas Gjoka et al. 2010. Walking in facebook: A case study of unbiased sampling of osns. In 2010 Proceedings IEEE Infocom. Ieee, 1--9."},{"key":"e_1_3_2_1_5_1","volume-title":"Snowball sampling. The annals of mathematical statistics","author":"Goodman Leo A","year":"1961","unstructured":"Leo A Goodman. 1961. Snowball sampling. The annals of mathematical statistics (1961), 148--170."},{"key":"e_1_3_2_1_6_1","volume-title":"A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865","author":"Hu Pili","year":"2013","unstructured":"Pili Hu and Wing Cheong Lau. 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865 (2013)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2012.09.001"},{"key":"e_1_3_2_1_8_1","unstructured":"Kshitijaa Jaglan et al. 2023. Tight Sampling in Unbounded Networks. arXiv preprint arXiv:2310.02859 (2023)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Sang Hoon Lee et al. 2006. Statistical properties of sampled networks. Physical review E 73 1 (2006) 016102.","DOI":"10.1103\/PhysRevE.73.016102"},{"volume-title":"Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. 177--187","author":"Jure","key":"e_1_3_2_1_10_1","unstructured":"Jure Leskovec et al. 2005. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. 177--187."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec et al. 2007. Graph evolution: Densification and shrinking diameters. ACM transactions on Knowledge Discovery from Data (TKDD) 1 1 (2007) 2--es.","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772762"},{"key":"e_1_3_2_1_14_1","unstructured":"Anna Myakushina. [n. d.]. Exploring Sampling Techniques in Large Graphs and Networks. ([n. d.])."},{"volume-title":"Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. 81--90","author":"Christopher","key":"e_1_3_2_1_15_1","unstructured":"Christopher R Palmer et al. 2002. ANF: A fast and scalable tool for data mining in massive graphs. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. 81--90."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Karl Pearson. 1896. VII. Mathematical contributions to the theory of evolution.- III. Regression heredity and panmixia. Philosophical Transactions of the Royal Society of London. Series A containing papers of a mathematical or physical character 187 (1896) 253--318.","DOI":"10.1098\/rsta.1896.0007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6425857"},{"key":"e_1_3_2_1_19_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. https: \/\/networkrepository.com"},{"volume-title":"Proceedings of the 29th ACM international conference on information & knowledge management. 3125--3132","author":"Benedek","key":"e_1_3_2_1_20_1","unstructured":"Benedek Rozemberczki et al. 2020. Karate Club: an API oriented open-source python framework for unsupervised learning on graphs. In Proceedings of the 29th ACM international conference on information & knowledge management. 3125--3132."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0501179102"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"E Upfal and M Mitzenmacher. 2005. Probability and computing.","DOI":"10.1017\/CBO9780511813603"},{"volume-title":"2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 120--129","author":"Elli","key":"e_1_3_2_1_24_1","unstructured":"Elli Voudigari et al. 2016. Rank degree: An efficient algorithm for graph sampling. In 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 120--129."},{"key":"e_1_3_2_1_25_1","unstructured":"Yanhong Wu et al. 2016. Evaluation of graph sampling: A visualization perspective. IEEE transactions on visualization and computer graphics (2016)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.75.046114"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-023-01060-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-163319"},{"key":"e_1_3_2_1_29_1","unstructured":"Fangyan Zhang et al. 2015. A visual and statistical benchmark for graph sampling methods. In Exploring Graphs at Scale Workshop Vol. 3."}],"event":{"name":"ICPE '24: 15th ACM\/SPEC International Conference on Performance Engineering","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"London United Kingdom","acronym":"ICPE '24"},"container-title":["Companion of the 15th ACM\/SPEC International Conference on Performance Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3629527.3652899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3629527.3652899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T19:50:00Z","timestamp":1755892200000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3629527.3652899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,7]]},"references-count":29,"alternative-id":["10.1145\/3629527.3652899","10.1145\/3629527"],"URL":"https:\/\/doi.org\/10.1145\/3629527.3652899","relation":{},"subject":[],"published":{"date-parts":[[2024,5,7]]},"assertion":[{"value":"2024-05-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}