IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v120y2018icp1-24.html

Validation of community robustness

Author

Listed:
  • Carissimo, Annamaria
  • Cutillo, Luisa
  • Feis, Italia De

Abstract

The large amount of work on community detection and its applications leaves unaddressed one important question: the statistical validation of the results. A methodology is presented that is able to clearly detect if the community structure found by some algorithms is statistically significant or is a result of chance, merely due to edge positions in the network. Given a community detection method and a network of interest, the proposal examines the stability of the partition recovered against random perturbations of the original graph structure. To address this issue, a perturbation strategy and a null model graph, which matches the original in some of its structural properties, but is otherwise a random graph, is specified. A set of procedures is built based on a special measure of clustering distance, namely Variation of Information, using tools set up for functional data analysis. The procedures determine whether the obtained clustering departs significantly from the null model. This strongly supports the robustness against perturbation of the algorithm used to identify the community structure. Results obtained with the proposed technique on simulated and real datasets are shown and discussed.

Suggested Citation

  • Carissimo, Annamaria & Cutillo, Luisa & Feis, Italia De, 2018. "Validation of community robustness," Computational Statistics & Data Analysis, Elsevier, vol. 120(C), pages 1-24.
    • Handle: RePEc:eee:csdana:v:120:y:2018:i:c:p:1-24
    DOI: 10.1016/j.csda.2017.10.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947317302347
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2017.10.006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Martin Rosvall & Carl T Bergstrom, 2010. "Mapping Change in Large Networks," PLOS ONE, Public Library of Science, vol. 5(1), pages 1-7, January.
    2. Gina-Maria Pomann & Ana-Maria Staicu & Sujit Ghosh, 2016. "A two-sample distribution-free test for functional data with application to a diffusion tensor imaging study of multiple sclerosis," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 65(3), pages 395-414, April.
    3. Alessia Pini & Simone Vantini, 2016. "The interval testing procedure: A general framework for inference in functional data analysis," Biometrics, The International Biometric Society, vol. 72(3), pages 835-845, September.
    4. Luisa Cutillo & Annamaria Carissimo & Silvia Figini, 2012. "Network Selection: A Method for Ranked Lists Selection," PLOS ONE, Public Library of Science, vol. 7(8), pages 1-13, August.
    5. Andrea Lancichinetti & Filippo Radicchi & José J Ramasco & Santo Fortunato, 2011. "Finding Statistically Significant Communities in Networks," PLOS ONE, Public Library of Science, vol. 6(4), pages 1-18, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tian, Yahui & Gel, Yulia R., 2019. "Fusing data depth with complex networks: Community detection with prior information," Computational Statistics & Data Analysis, Elsevier, vol. 139(C), pages 99-116.
    2. Mirko Signorelli & Luisa Cutillo, 2022. "On community structure validation in real networks," Computational Statistics, Springer, vol. 37(3), pages 1165-1183, July.
    3. Alexei Kireyev & Andrey Leonidov & Stanislav Radionov & Ekaterina Vasilyeva, 2022. "Communities in world input-output network: Robustness and rankings," PLOS ONE, Public Library of Science, vol. 17(4), pages 1-18, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lovro Šubelj & Nees Jan van Eck & Ludo Waltman, 2016. "Clustering Scientific Publications Based on Citation Relations: A Systematic Comparison of Different Methods," PLOS ONE, Public Library of Science, vol. 11(4), pages 1-23, April.
    2. Wu, Ke & Liu, Xueming, 2021. "Community detection in directed acyclic graphs of adversary interactions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    3. Pini, Alessia & Stamm, Aymeric & Vantini, Simone, 2018. "Hotelling’s T2 in separable Hilbert spaces," Journal of Multivariate Analysis, Elsevier, vol. 167(C), pages 284-305.
    4. Wu, Jianshe & Zhang, Long & Li, Yong & Jiao, Yang, 2016. "Partition signed social networks via clustering dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 568-582.
    5. Gregory, Steve, 2012. "Ordered community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2752-2763.
    6. Shiji Chen & Clément Arsenault & Yves Gingras & Vincent Larivière, 2015. "Exploring the interdisciplinary evolution of a discipline: the case of Biochemistry and Molecular Biology," Scientometrics, Springer;Akadémiai Kiadó, vol. 102(2), pages 1307-1323, February.
    7. de Arruda, Guilherme F. & Costa, Luciano da Fontoura & Rodrigues, Francisco A., 2012. "A complex networks approach for data clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(23), pages 6174-6183.
    8. Daniel Pélissier, 2022. "Le temps dans le discours, expérimentation d’un protocole d’observation des caractéristiques temporelles d’un corpus d’avis de salariés," Post-Print hal-04554013, HAL.
    9. Eustace, Justine & Wang, Xingyuan & Cui, Yaozu, 2015. "Overlapping community detection using neighborhood ratio matrix," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 510-521.
    10. Kirsten Martinus & Thomas Sigler & Iacopo Iacopini & Ben Derudder, 2021. "The brokerage role of small states and territories in global corporate networks," Growth and Change, Wiley Blackwell, vol. 52(1), pages 12-28, March.
    11. Martin Rosvall & Carl T Bergstrom, 2011. "Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems," PLOS ONE, Public Library of Science, vol. 6(4), pages 1-10, April.
    12. Ivan Blekanov & Svetlana S. Bodrunova & Askar Akhmetov, 2021. "Detection of Hidden Communities in Twitter Discussions of Varying Volumes," Future Internet, MDPI, vol. 13(11), pages 1-17, November.
    13. Thang N. Dinh & Nam P. Nguyen & Md Abdul Alim & My T. Thai, 2015. "A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 747-767, October.
    14. Xiaoguang Wang & Qikai Cheng & Wei Lu, 2014. "Analyzing evolution of research topics with NEViewer: a new method based on dynamic co-word networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 101(2), pages 1253-1271, November.
    15. Fang, Wenyi & Wang, Xin & Liu, Longzhao & Wu, Zhaole & Tang, Shaoting & Zheng, Zhiming, 2022. "Community detection through vector-label propagation algorithms," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    16. Codazzi, Laura & Colombi, Alessandro & Gianella, Matteo & Argiento, Raffaele & Paci, Lucia & Pini, Alessia, 2022. "Gaussian graphical modeling for spectrometric data analysis," Computational Statistics & Data Analysis, Elsevier, vol. 174(C).
    17. Jesús Arroyo & Elizaveta Levina, 2022. "Overlapping Community Detection in Networks via Sparse Spectral Decomposition," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 84(1), pages 1-35, June.
    18. Qiu, Zhiping & Chen, Jianwei & Zhang, Jin-Ting, 2021. "Two-sample tests for multivariate functional data with applications," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    19. Ali Najmi & Taha H. Rashidi & Alireza Abbasi & S. Travis Waller, 2017. "Reviewing the transport domain: an evolutionary bibliometrics and network analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 110(2), pages 843-865, February.
    20. Garza, Sara E. & Schaeffer, Satu Elisa, 2019. "Community detection with the Label Propagation Algorithm: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 534(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:120:y:2018:i:c:p:1-24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.