IDEAS home Printed from https://ideas.repec.org/a/spr/sankha/v84y2022i1d10.1007_s13171-020-00240-1.html
   My bibliography  Save this article

Improvements on SCORE, Especially for Weak Signals

Author

Listed:
  • Jiashun Jin

    (Carnegie Mellon University)

  • Zheng Tracy Ke

    (Harvard University)

  • Shengming Luo

    (Carnegie Mellon University)

Abstract

A network may have weak signals and severe degree heterogeneity, and may be very sparse in one occurrence but very dense in another. SCORE (Ann. Statist. 43, 57–89, 2015) is a recent approach to network community detection. It accommodates severe degree heterogeneity and is adaptive to different levels of sparsity, but its performance for networks with weak signals is unclear. In this paper, we show that in a broad class of network settings where we allow for weak signals, severe degree heterogeneity, and a wide range of network sparsity, SCORE achieves prefect clustering and has the so-called “exponential rate” in Hamming clustering errors. The proof uses the most recent advancement on entry-wise bounds for the leading eigenvectors of the network adjacency matrix. The theoretical analysis assures us that SCORE continues to work well in the weak signal settings, but it does not rule out the possibility that SCORE may be further improved to have better performance in real applications, especially for networks with weak signals. As a second contribution of the paper, we propose SCORE+ as an improved version of SCORE. We investigate SCORE+ with 8 network data sets and found that it outperforms several representative approaches. In particular, for the 6 data sets with relatively strong signals, SCORE+ has similar performance as that of SCORE, but for the 2 data sets (Simmons, Caltech) with possibly weak signals, SCORE+ has much lower error rates. SCORE+ proposes several changes to SCORE. We carefully explain the rationale underlying each of these changes, using a mixture of theoretical and numerical study.

Suggested Citation

  • Jiashun Jin & Zheng Tracy Ke & Shengming Luo, 2022. "Improvements on SCORE, Especially for Weak Signals," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 84(1), pages 127-162, June.
  • Handle: RePEc:spr:sankha:v:84:y:2022:i:1:d:10.1007_s13171-020-00240-1
    DOI: 10.1007/s13171-020-00240-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13171-020-00240-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13171-020-00240-1?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Traud, Amanda L. & Mucha, Peter J. & Porter, Mason A., 2012. "Social structure of Facebook networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(16), pages 4165-4180.
    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. Huan Qing & Jingli Wang, 2024. "Applications of dual regularized Laplacian matrix for community detection," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 18(4), pages 1001-1043, December.

    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. Xin Xu & Yang Lu & Yupeng Zhou & Zhiguo Fu & Yanjie Fu & Minghao Yin, 2021. "An Information-Explainable Random Walk Based Unsupervised Network Representation Learning Framework on Node Classification Tasks," Mathematics, MDPI, vol. 9(15), pages 1-14, July.
    2. Han, Kevin & Basse, Guillaume & Bojinov, Iavor, 2024. "Population interference in panel experiments," Journal of Econometrics, Elsevier, vol. 238(1).
    3. Saxena, Rakhi & Kaur, Sharanjit & Bhatnagar, Vasudha, 2019. "Identifying similar networks using structural hierarchy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    4. Ma, Shujie & Su, Liangjun & Zhang, Yichong, 2020. "Detecting Latent Communities in Network Formation Models," Economics and Statistics Working Papers 12-2020, Singapore Management University, School of Economics.
    5. Luca Braghieri & Ro'ee Levy & Alexey Makarin, 2022. "Social Media and Mental Health," American Economic Review, American Economic Association, vol. 112(11), pages 3660-3693, November.
    6. Yuan, Wei-Guo & Liu, Yun, 2015. "A mixing evolution model for bidirectional microblog user networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 432(C), pages 167-179.
    7. Karimi, Fariba & Ramenzoni, Verónica C. & Holme, Petter, 2014. "Structural differences between open and direct communication in an online community," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 414(C), pages 263-273.
    8. Yakir Berchenko & Jonathan D. Rosenblatt & Simon D. W. Frost, 2017. "Modeling and analyzing respondent‐driven sampling as a counting process," Biometrics, The International Biometric Society, vol. 73(4), pages 1189-1198, December.
    9. Hanbaek Lyu & Yacoub H. Kureh & Joshua Vendrow & Mason A. Porter, 2024. "Learning low-rank latent mesoscale structures in networks," Nature Communications, Nature, vol. 15(1), pages 1-15, December.
    10. Drago, Carlo & Amidani Aliberti, Livia & Carbonai, Davide, 2014. "Measuring Gender Differences in Information Sharing Using Network Analysis: the Case of the Austrian Interlocking Directorship Network in 2009," Climate Change and Sustainable Development 178241, Fondazione Eni Enrico Mattei (FEEM).
    11. He, Dongxiao & Wang, Hongcui & Jin, Di & Liu, Baolin, 2016. "A model framework for the enhancement of community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 602-612.
    12. Yang, Xu-Hua & Chen, Guang & Chen, Sheng-Yong & Wang, Wan-Liang & Wang, Lei, 2014. "Study on some bus transport networks in China with considering spatial characteristics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 69(C), pages 1-10.
    13. Wang, Benyu & Gu, Yijun & Zheng, Diwen, 2022. "Community detection in error-prone environments based on particle cooperation and competition with distance dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 607(C).
    14. Leifeld, Philip, 2018. "Polarization in the social sciences: Assortative mixing in social science collaboration networks is resilient to interventions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 507(C), pages 510-523.
    15. Robert Lunde & Purnamrita Sarkar, 2023. "Subsampling sparse graphons under minimal assumptions," Biometrika, Biometrika Trust, vol. 110(1), pages 15-32.
    16. Valero, Jordi & Pérez-Casany, Marta & Duarte-López, Ariel, 2022. "The Zipf-Polylog distribution: Modeling human interactions through social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 603(C).
    17. Shakeri, Heman & Moradi-Jamei, Behnaz & Poggi-Corradini, Pietro & Albin, Nathan & Scoglio, Caterina, 2018. "Generalization of effective conductance centrality for egonetworks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 511(C), pages 127-138.
    18. Botte, Nina & Ryckebusch, Jan & Rocha, Luis E.C., 2022. "Clustering and stubbornness regulate the formation of echo chambers in personalised opinion dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 599(C).
    19. Saxena, Chandni & Doja, M.N. & Ahmad, Tanvir, 2020. "Entropy based flow transfer for influence dissemination in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).
    20. Ciotti, Valerio & Bianconi, Ginestra & Capocci, Andrea & Colaiori, Francesca & Panzarasa, Pietro, 2015. "Degree correlations in signed social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 422(C), pages 25-39.

    More about this item

    Keywords

    Primary: 62H30; 91C20; Secondary: 62P25;
    All these keywords.

    JEL classification:

    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:spr:sankha:v:84:y:2022:i:1:d:10.1007_s13171-020-00240-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.