{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T03:49:31Z","timestamp":1770349771909,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030386283","type":"print"},{"value":"9783030386290","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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-38629-0_2","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T14:05:05Z","timestamp":1579615505000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Statistical Test of Heterogeneous Subgraph Densities to Assess Clusterability"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Miasnikof","sequence":"first","affiliation":[]},{"given":"Liudmila","family":"Prokhorenkova","sequence":"additional","affiliation":[]},{"given":"Alexander Y.","family":"Shestopaloff","sequence":"additional","affiliation":[]},{"given":"Andrei","family":"Raigorodskii","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"2_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-0742-7","volume-title":"Clusters, Orders, and Trees: Methods and Applications","author":"F Aleskerov","year":"2014","unstructured":"Aleskerov, F., Goldengorin, B., Pardalos, P.: Clusters, Orders, and Trees: Methods and Applications. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-1-4939-0742-7 . Incorporated"},{"issue":"6","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1137\/06064888X","volume":"37","author":"N Alon","year":"2008","unstructured":"Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with one-sided error. SIAM J. Comput. 37(6), 1703\u20131727 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1214\/14-AOS1208","volume":"42","author":"E Arias-Castro","year":"2014","unstructured":"Arias-Castro, E., Verzelen, N.: Community detection in dense random networks. Ann. Statist. 42(3), 940\u2013969 (2014). https:\/\/doi.org\/10.1214\/14-AOS1208","journal-title":"Ann. Statist."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"Barrat, A., Barth\u00e9lemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. Proc. Natl. Acad. Sci. 101, 3747\u20133752 (2004)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1111\/rssb.12117","volume":"78","author":"PJ Bickel","year":"2016","unstructured":"Bickel, P.J., Sarkar, P.: Hypothesis testing for automated community detection in networks. J. R. Stat. Soc.: Ser. B (Stat. Methodol.) 78(1), 253\u2013273 (2016). https:\/\/doi.org\/10.1111\/rssb.12117","journal-title":"J. R. Stat. Soc.: Ser. B (Stat. Methodol.)"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/6602","volume-title":"Clustering Challenges in Biological Networks","author":"Sergiy Butenko","year":"2009","unstructured":"Butenko, S., Chaovalitwongse, W.A., Pardalos, P.M.: Clustering Challenges in Biological Networks. World Scientific, Singapore (2009). https:\/\/doi.org\/10.1142\/6602"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chiplunkar, A., Kapralov, M., Khanna, S., Mousavifar, A., Peres, Y.: Testing graph clusterability: algorithms and lower bounds. ArXiv e-prints, August 2018","DOI":"10.1109\/FOCS.2018.00054"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Peng, P., Sohler, C.: Testing cluster structure of graphs. ArXiv e-prints, April 2015","DOI":"10.1145\/2746539.2746618"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Eden, T., Ron, D., Seshadhri, C.: On Approximating the number of $$k$$-cliques in sublinear time. ArXiv e-prints, March 2018","DOI":"10.1145\/3188745.3188810"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Elenberg, E.R., Shanmugam, K., Borokhovich, M., Dimakis, A.G.: Beyond triangles: a distributed framework for estimating 3-profiles of large graphs. ArXiv e-prints, June 2015","DOI":"10.1145\/2783258.2783413"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. Debr. 6, 290 (1959)","journal-title":"Publ. Math. Debr."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"Santo Fortunato","year":"2016","unstructured":"Fortunato, S., Hric, D.: Community detection in networks: a user guide. ArXiv e-prints, November 2016","journal-title":"Physics Reports"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/S0378-4371(02)01336-5","volume":"316","author":"A Fronczak","year":"2002","unstructured":"Fronczak, A., Ho\u0142yst, J.A., Jedynak, M., Sienkiewicz, J.: Higher order clustering coefficients in Barab\u00e1si-Albert networks. Phys. Stat. Mech. Its Appl. 316, 688\u2013694 (2002)","journal-title":"Phys. Stat. Mech. Its Appl."},{"key":"2_CR17","unstructured":"Gao, C., Lafferty, J.: Testing for global network structure using small subgraph statistics. ArXiv e-prints (Oct 2017)"},{"key":"2_CR18","unstructured":"Gao, C., Lafferty, J.: Testing network structure using relations between small subgraph probabilities. ArXiv e-prints, April 2017"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Gishboliner, L., Shapira, A.: Deterministic vs non-deterministic graph property testing. ArXiv e-prints, April 2013","DOI":"10.1007\/s11856-014-1096-x"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/090749621","volume":"40","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O., Ron, D.: Algorithmic aspects of property testing in the dense graphs model. SIAM J. Comput. 40(2), 376\u2013445 (2011)","journal-title":"SIAM J. Comput."},{"key":"2_CR21","unstructured":"Hagberg, A., Schult, D., Swart, P.: Exploring network structure, dynamics, and function using network. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, Pasadena, CA USA, pp. 11\u201315 (2008)"},{"key":"2_CR22","unstructured":"He, Z., Liang, H., Chen, Z., Zhao, C.: Detecting statistically significant communities. CoRR abs\/1806.05602 (2018). http:\/\/arxiv.org\/abs\/1806.05602"},{"key":"2_CR23","unstructured":"Jin, J., Ke, Z.T., Luo, S.: Network global testing by counting graphlets. ArXiv e-prints, July 2018"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1017\/S0963548313000205","volume":"22","author":"L Lov\u00e1sz","year":"2013","unstructured":"Lov\u00e1sz, L., Vesztergombi, K.: Nondeterministic graph property testing. Comb. Probab. Comput. 22, 749\u2013762 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-92871-5_11","volume-title":"Algorithms and Models for the Web Graph","author":"P Miasnikof","year":"2018","unstructured":"Miasnikof, P., Shestopaloff, A.Y., Bonner, A.J., Lawryshyn, Y.: A statistical performance analysis of graph clustering algorithms. In: Bonato, A., Pra\u0142at, P., Raigorodskii, A. (eds.) WAW 2018. LNCS, vol. 10836, pp. 170\u2013184. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92871-5_11"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-49787-7_10","volume-title":"Algorithms and Models for the Web Graph","author":"L Ostroumova Prokhorenkova","year":"2016","unstructured":"Ostroumova Prokhorenkova, L., Pra\u0142at, P., Raigorodskii, A.: Modularity of complex networks models. In: Bonato, A., Graham, F.C., Pra\u0142at, P. (eds.) WAW 2016. LNCS, vol. 10088, pp. 115\u2013126. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49787-7_10"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Prokhorenkova, L.O., Pra\u0142at, P., Raigorodskii, A.: Modularity in several random graph models. Electron. Notes Discret. Math. 61, 947\u2013953 (2017). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065317302238 . The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2017)","DOI":"10.1016\/j.endm.2017.07.058"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Prokhorenkova, L., Tikhonov, A.: Community detection through likelihood optimization: in search of a sound model. In: Proceedings of the 2019 World Wide Web Conference (WWW 2019) (2019)","DOI":"10.1145\/3308558.3313429"},{"issue":"1","key":"2_CR30","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Survey: graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). https:\/\/doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Comput. Sci. Rev."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Ugander, J., Backstrom, L., Kleinberg, J.: Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. ArXiv e-prints, April 2013","DOI":"10.1145\/2488388.2488502"},{"issue":"6","key":"2_CR32","doi-asserted-by":"publisher","first-page":"3465","DOI":"10.1214\/14-AAP1080","volume":"25","author":"N Verzelen","year":"2015","unstructured":"Verzelen, N., Arias-Castro, E.: Community detection in sparse random networks. Ann. Appl. Probab. 25(6), 3465\u20133510 (2015). https:\/\/doi.org\/10.1214\/14-AAP1080","journal-title":"Ann. Appl. Probab."},{"key":"2_CR33","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on Ground-truth. CoRR abs\/1205.6233 (2012). http:\/\/arxiv.org\/abs\/1205.6233"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J.: Higher-order clustering in networks. ArXiv e-prints (2018)","DOI":"10.1103\/PhysRevE.97.052306"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A., Leskovec, J.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2017 (2017)","DOI":"10.1145\/3097983.3098069"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T12:18:19Z","timestamp":1695644299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}