{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T18:38:16Z","timestamp":1761763096755,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T00:00:00Z","timestamp":1633305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T00:00:00Z","timestamp":1633305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Stat"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>Community structure<\/jats:italic> is a commonly observed feature of real networks. The term refers to the presence in a network of groups of nodes (<jats:italic>communities<\/jats:italic>) that feature high internal connectivity, but are poorly connected between each other. Whereas the issue of community detection has been addressed in several works, the problem of validating a partition of nodes as a good community structure for a real network has received considerably less attention and remains an open issue. We propose a set of indices for community structure validation of network partitions that are based on an hypothesis testing procedure that assesses the distribution of links between and within communities. Using both simulations and real data, we illustrate how the proposed indices can be employed to compare the adequacy of different partitions of nodes as community structures in a given network, to assess whether two networks share the same or similar community structures, and to evaluate the performance of different network clustering algorithms.\n<\/jats:p>","DOI":"10.1007\/s00180-021-01156-6","type":"journal-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T02:20:44Z","timestamp":1633400444000},"page":"1165-1183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On community structure validation in real networks"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8102-3356","authenticated-orcid":false,"given":"Mirko","family":"Signorelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Cutillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,4]]},"reference":[{"key":"1156_CR1","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 10:P10008","journal-title":"J Stat Mech Theory Exp"},{"issue":"2","key":"1156_CR2","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1017\/nws.2015.31","volume":"4","author":"F Briatte","year":"2016","unstructured":"Briatte F (2016) Network patterns of legislative collaboration in twenty parliaments. Netw Sci 4(2):266\u2013271","journal-title":"Netw Sci"},{"key":"1156_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.csda.2017.10.006","volume":"120","author":"A Carissimo","year":"2018","unstructured":"Carissimo A, Cutillo L, Defeis I (2018) Validation of community robustness. Comput Stat Data Anal 120:1\u201324","journal-title":"Comput Stat Data Anal"},{"issue":"6","key":"1156_CR4","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","journal-title":"Phys Rev E"},{"issue":"14","key":"1156_CR5","doi-asserted-by":"publisher","first-page":"1776","DOI":"10.1093\/bioinformatics\/btt290","volume":"29","author":"G Gambardella","year":"2013","unstructured":"Gambardella G, Moretti MN, de Cegli R, Cardone L, Peron A, di Bernardo D (2013) Differential network analysis for the identification of condition-specific pathway activity and regulation. Bioinformatics 29(14):1776\u20131785","journal-title":"Bioinformatics"},{"issue":"99","key":"1156_CR6","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"12","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. PNAS 12(99):7821\u20137826","journal-title":"PNAS"},{"key":"1156_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/9789814329804_0003","volume-title":"Recent advances in biostatistics: false discovery rates, survival analysis, and related topics","author":"JF Heyse","year":"2011","unstructured":"Heyse JF (2011) A false discovery rate procedure for categorical data. In: Bhattacharjee M et al (eds) Recent advances in biostatistics: false discovery rates, survival analysis, and related topics. World Scientific, Singapore, pp 43\u201358"},{"issue":"2","key":"1156_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Soc Netw 5(2):109\u2013137","journal-title":"Soc Netw"},{"issue":"1","key":"1156_CR9","doi-asserted-by":"publisher","first-page":"016107","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer B, Newman ME (2011) Stochastic blockmodels and community structure in networks. Phys Rev E 83(1):016107","journal-title":"Phys Rev E"},{"issue":"3","key":"1156_CR10","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104","journal-title":"Phys Rev E"},{"issue":"2","key":"1156_CR11","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"key":"1156_CR12","doi-asserted-by":"publisher","first-page":"11863","DOI":"10.1038\/ncomms11863","volume":"7","author":"MEJ Newman","year":"2016","unstructured":"Newman MEJ, Clauset A (2016) Structure and inference in annotated networks. Nat Commun 7:11863","journal-title":"Nat Commun"},{"issue":"5","key":"1156_CR13","doi-asserted-by":"publisher","first-page":"e1602548","DOI":"10.1126\/sciadv.1602548","volume":"3","author":"L Peel","year":"2017","unstructured":"Peel L, Larremore DB, Caluset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):e1602548","journal-title":"Sci Adv"},{"key":"1156_CR14","doi-asserted-by":"crossref","unstructured":"Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: International symposium on computer and information sciences. Springer, pp 284\u2013293","DOI":"10.1007\/11569596_31"},{"key":"1156_CR15","volume-title":"R: a language and environment for statistical computing","author":"R Core Team","year":"2020","unstructured":"R Core Team (2020) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna"},{"issue":"352","key":"1156_CR16","first-page":"1","volume":"17","author":"M Signorelli","year":"2016","unstructured":"Signorelli M, Vinciotti V, Wit E (2016) NEAT: an efficient network enrichment analysis test. BMC Bioinform 17(352):1\u201317","journal-title":"BMC Bioinform"},{"issue":"2","key":"1156_CR17","first-page":"335","volume":"67","author":"M Signorelli","year":"2018","unstructured":"Signorelli M, Wit E (2018) A penalized inference approach to stochastic block modelling of community structure in the Italian parliament. J R Stat Soc Ser C (Appl Stat) 67(2):335\u2013369","journal-title":"J R Stat Soc Ser C (Appl Stat)"},{"issue":"397","key":"1156_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1080\/01621459.1987.10478385","volume":"82","author":"YJ Wang","year":"1987","unstructured":"Wang YJ, Wong GY (1987) Stochastic blockmodels for directed graphs. J Am Stat Assoc 82(397):8\u201319","journal-title":"J Am Stat Assoc"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-021-01156-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00180-021-01156-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-021-01156-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T20:07:54Z","timestamp":1655150874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00180-021-01156-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,4]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1156"],"URL":"https:\/\/doi.org\/10.1007\/s00180-021-01156-6","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"type":"print","value":"0943-4062"},{"type":"electronic","value":"1613-9658"}],"subject":[],"published":{"date-parts":[[2021,10,4]]},"assertion":[{"value":"2 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The <tt>R<\/tt> code used to implement the CSV approach, for the simulations and the data analyses is available at <tt>github.com\/mirkosignorelli\/csv<\/tt>.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}