IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v212y2025ics0167947325001069.html
   My bibliography  Save this article

Privacy-preserving communication-efficient spectral clustering for distributed multiple networks

Author

Listed:
  • Wu, Shanghao
  • Guo, Xiao
  • Zhang, Hai

Abstract

Multi-layer networks arise naturally in various scientific domains including social sciences, biology, neuroscience, among others. The network layers of a given multi-layer network are commonly stored in a local and distributed fashion because of the privacy, ownership, and communication costs. The literature on community detection based on these data is still limited. This paper proposes a new distributed spectral clustering-based algorithm for consensus community detection of the locally stored multi-layer network. The algorithm is based on the power method. It is communication-efficient by allowing multiple local power iterations before aggregation; and privacy-preserving by incorporating the notion of differential privacy. The convergence rate of the proposed algorithm is studied under the assumption that the multi-layer networks are generated from the multi-layer stochastic block models. Numerical studies show the superior performance of the proposed algorithm over competitive algorithms.

Suggested Citation

  • Wu, Shanghao & Guo, Xiao & Zhang, Hai, 2025. "Privacy-preserving communication-efficient spectral clustering for distributed multiple networks," Computational Statistics & Data Analysis, Elsevier, vol. 212(C).
  • Handle: RePEc:eee:csdana:v:212:y:2025:i:c:s0167947325001069
    DOI: 10.1016/j.csda.2025.108230
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947325001069
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2025.108230?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.

    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:212:y:2025:i:c:s0167947325001069. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.