Community detection by spectral methods in multi-layer networks
- URL: http://arxiv.org/abs/2403.12540v1
- Date: Tue, 19 Mar 2024 08:29:47 GMT
- Title: Community detection by spectral methods in multi-layer networks
- Authors: Huan Qing,
- Abstract summary: Community detection in multi-layer networks is a crucial problem in network analysis.
One algorithm is based on the sum of adjacency matrices, while the other utilizes the debiased sum of squared adjacency matrices.
Numerical simulations confirm that our algorithm, employing the debiased sum of squared adjacency matrices, surpasses existing methods for community detection in multi-layer networks.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Community detection in multi-layer networks is a crucial problem in network analysis. In this paper, we analyze the performance of two spectral clustering algorithms for community detection within the multi-layer degree-corrected stochastic block model (MLDCSBM) framework. One algorithm is based on the sum of adjacency matrices, while the other utilizes the debiased sum of squared adjacency matrices. We establish consistency results for community detection using these methods under MLDCSBM as the size of the network and/or the number of layers increases. Our theorems demonstrate the advantages of utilizing multiple layers for community detection. Moreover, our analysis indicates that spectral clustering with the debiased sum of squared adjacency matrices is generally superior to spectral clustering with the sum of adjacency matrices. Numerical simulations confirm that our algorithm, employing the debiased sum of squared adjacency matrices, surpasses existing methods for community detection in multi-layer networks. Finally, the analysis of several real-world multi-layer networks yields meaningful insights.
Related papers
- Scalable spectral representations for network multiagent control [53.631272539560435]
A popular model for multi-agent control, Network Markov Decision Processes (MDPs) pose a significant challenge to efficient learning.
We first derive scalable spectral local representations for network MDPs, which induces a network linear subspace for the local $Q$-function of each agent.
We design a scalable algorithmic framework for continuous state-action network MDPs, and provide end-to-end guarantees for the convergence of our algorithm.
arXiv Detail & Related papers (2024-10-22T17:45:45Z) - Estimating mixed memberships in multi-layer networks [0.0]
Community detection in multi-layer networks has emerged as a crucial area of modern network analysis.
We propose novel methods to estimate the common mixed memberships in the multi-layer mixed membership block model.
arXiv Detail & Related papers (2024-04-05T07:02:10Z) - Rethinking Clustered Federated Learning in NOMA Enhanced Wireless
Networks [60.09912912343705]
This study explores the benefits of integrating the novel clustered federated learning (CFL) approach with non-independent and identically distributed (non-IID) datasets.
A detailed theoretical analysis of the generalization gap that measures the degree of non-IID in the data distribution is presented.
Solutions to address the challenges posed by non-IID conditions are proposed with the analysis of the properties.
arXiv Detail & Related papers (2024-03-05T17:49:09Z) - Perfect Spectral Clustering with Discrete Covariates [68.8204255655161]
We propose a spectral algorithm that achieves perfect clustering with high probability on a class of large, sparse networks.
Our method is the first to offer a guarantee of consistent latent structure recovery using spectral clustering.
arXiv Detail & Related papers (2022-05-17T01:41:06Z) - Community detection in multiplex networks based on orthogonal
nonnegative matrix tri-factorization [26.53951886710295]
We introduce a new multiplex community detection approach that can identify communities that are common across layers as well as those that are unique to each layer.
The proposed algorithm is evaluated on both synthetic and real multiplex networks and compared to state-of-the-art techniques.
arXiv Detail & Related papers (2022-05-02T02:33:15Z) - Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals.
We propose a general graph estimator based on a novel structured fusion regularization.
We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
arXiv Detail & Related papers (2021-03-05T04:42:32Z) - Spectral clustering via adaptive layer aggregation for multi-layer
networks [6.0073653636512585]
We propose integrative spectral clustering approaches based on effective convex layer aggregations.
We show that our methods are remarkably competitive compared to several popularly used methods.
arXiv Detail & Related papers (2020-12-07T21:58:18Z) - Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from
Cross View and Each View [68.88732535086338]
This paper proposes a new multi-view clustering method, low-rank subspace multi-view clustering based on adaptive graph regularization.
Experimental results for five widely used multi-view benchmarks show that our proposed algorithm surpasses other state-of-the-art methods by a clear margin.
arXiv Detail & Related papers (2020-08-23T08:25:06Z) - Motif-Based Spectral Clustering of Weighted Directed Networks [6.1448102196124195]
Clustering is an essential technique for network analysis, with applications in a diverse range of fields.
One approach is to capture and cluster higher-order structures using motif adjacency matrices.
We present new and computationally useful matrix formulae for motif adjacency matrices on weighted networks.
arXiv Detail & Related papers (2020-04-02T22:45:28Z) - A unified framework for spectral clustering in sparse graphs [47.82639003096941]
We show that a conveniently parametrized form of regularized Laplacian matrix can be used to perform spectral clustering in sparse networks.
We also exhibit important connections between this proposed matrix and the now popular non-backtracking matrix, the Bethe-Hessian matrix.
arXiv Detail & Related papers (2020-03-20T10:58:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.