Networks (or graphs) are used to model the dyadic relations between entities in complex systems. Analyzing the properties of the networks reveal important characteristics of the underlying system. However, in many disciplines, including social sciences, bioinformatics, and technological systems, multiple relations exist between entities. In such cases, a simple graph is not sufficient to model these multiple relations, and a multilayer network is a more appropriate model. In this paper, we explore community detection in multilayer networks. Specifically, we propose a novel network decoupling strategy for efficiently combining the communities in the different layers using the Boolean primitives AND, OR, and NOT. Our proposed method, network decoupling, is based on analyzing the communities in each network layer individually and then aggregating the analysis results. We (i) describe our network decoupling algorithms for finding communities, (ii) present how network decoupling can be used to express different types of communities in multilayer networks, and (iii) demonstrate the effectiveness of using network decoupling for detecting communities in real-world and synthetic data sets. Compared to other algorithms for detecting communities in multilayer networks, our proposed network decoupling method requires significantly lower computation time while producing results of high accuracy. Based on these results, we anticipate that our proposed network decoupling technique will enable a more detailed analysis of multilayer networks in an efficient manner.
more »
« less
A Unified Spectral Clustering Approach for Detecting Community Structure in Multilayer Networks
Networks offer a compact representation of complex systems such as social, communication, and biological systems. Traditional network models are often inadequate to capture the diverse nature of contemporary networks, which may exhibit temporal variation and multiple types of interactions between entities. Multilayer networks (MLNs) provide a more comprehensive representation by allowing interactions between nodes to be represented by different types of links, each reflecting a distinct type of interaction. Community detection reveals meaningful structure and provides a better understanding of the overall functioning of networks. Current approaches to multilayer community detection are either limited to community detection over the aggregated network or are extensions of single-layer community detection methods with simplifying assumptions such as a common community structure across layers. Moreover, most of the existing methods are limited to multiplex networks with no inter-layer edges. In this paper, we introduce a spectral-clustering-based community detection method for two-layer MLNs. The problem of detecting the community structure is formulated as an optimization problem where the normalized cut for each layer is minimized simultaneously with the normalized cut for the bipartite network along with regularization terms that ensure the consistency of the within- and across-layer community structures. The proposed method is evaluated on both synthetic and real networks and compared to state-of-the-art methods. MLNs. The problem of detecting the community structure is formulated as an optimization problem where the normalized cut for each layer is minimized simultaneously with the normalized cut for the bipartite network along with regularization terms that ensure the consistency of the intra- and inter-layer community structures. The proposed method is evaluated on both synthetic and real networks and compared to state-of-the-art methods.
more » « less- Award ID(s):
- 2006800
- NSF-PAR ID:
- 10530542
- Publisher / Repository:
- Symmetry, MDPI
- Date Published:
- Journal Name:
- Symmetry
- Volume:
- 15
- Issue:
- 7
- ISSN:
- 2073-8994
- Page Range / eLocation ID:
- 1368
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Fu, Feng (Ed.)more » « less
With the recent availability of tissue-specific gene expression data, e.g., provided by the GTEx Consortium, there is interest in comparing gene co-expression patterns across tissues. One promising approach to this problem is to use a multilayer network analysis framework and perform multilayer community detection. Communities in gene co-expression networks reveal groups of genes similarly expressed across individuals, potentially involved in related biological processes responding to specific environmental stimuli or sharing common regulatory variations. We construct a multilayer network in which each of the four layers is an exocrine gland tissue-specific gene co-expression network. We develop methods for multilayer community detection with correlation matrix input and an appropriate null model. Our correlation matrix input method identifies five groups of genes that are similarly co-expressed in multiple tissues (a community that spans multiple layers, which we call a generalist community) and two groups of genes that are co-expressed in just one tissue (a community that lies primarily within just one layer, which we call a specialist community). We further found gene co-expression communities where the genes physically cluster across the genome significantly more than expected by chance (on chromosomes 1 and 11). This clustering hints at underlying regulatory elements determining similar expression patterns across individuals and cell types. We suggest that
KRTAP3-1 ,KRTAP3-3 , andKRTAP3-5 share regulatory elements in skin and pancreas. Furthermore, we find thatCELA3A andCELA3B share associated expression quantitative trait loci in the pancreas. The results indicate that our multilayer community detection method for correlation matrix input extracts biologically interesting communities of genes. -
Community detection, which focuses on clustering nodes or detecting communities in (mostly) a single network, is a problem of considerable practical interest and has received a great deal of attention in the research community. While being able to cluster within a network is important, there are emerging needs to be able to \emph{cluster multiple networks}. This is largely motivated by the routine collection of network data that are generated from potentially different populations. These networks may or may not have node correspondence. When node correspondence is present, we cluster networks by summarizing a network by its graphon estimate, whereas when node correspondence is not present, we propose a novel solution for clustering such networks by associating a computationally feasible feature vector to each network based on trace of powers of the adjacency matrix. We illustrate our methods using both simulated and real data sets, and theoretical justifications are provided in terms of consistency.more » « less
-
more » « less
Abstract When people are asked to recall their social networks, theoretical and empirical work tells us that they rely on shortcuts, or heuristics. Cognitive social structures (CSSs) are multilayer social networks where each layer corresponds to an individual’s perception of the network. With multiple perceptions of the same network, CSSs contain rich information about how these heuristics manifest, motivating the question,
Can we identify people who share the same heuristics? In this work, we propose a method for identifyingcognitive structure across multiple network perceptions, analogous to how community detection aims to identifysocial structure in a network. To simultaneously model the joint latent social and cognitive structure, we study CSSs as three-dimensional tensors, employing low-rank nonnegative Tucker decompositions (NNTuck) to approximate the CSS—a procedure closely related to estimating a multilayer stochastic block model (SBM) from such data. We propose the resulting latent cognitive space as an operationalization of the sociological theory ofsocial cognition by identifying individuals who sharerelational schema . In addition to modeling cognitivelyindependent ,dependent , andredundant networks, we propose a specific model instance and related statistical test for testing when there issocial-cognitive agreement in a network: when the social and cognitive structures are equivalent. We use our approach to analyze four different CSSs and give insights into the latent cognitive structures of those networks. -
Abstract Functional connectivity networks of the human brain are commonly studied using tools from complex network theory. Existing methods focus on functional connectivity within a single frequency band. However, it is well-known that higher order brain functions rely on the integration of information across oscillations at different frequencies. Therefore, there is a need to study these cross-frequency interactions. In this paper, we use multilayer networks to model functional connectivity across multiple frequencies, where each layer corresponds to a different frequency band. We then introduce the multilayer modularity metric to develop a multilayer community detection algorithm. The proposed approach is applied to electroencephalogram (EEG) data collected during a study of error monitoring in the human brain. The differences between the community structures within and across different frequency bands for two response types, i.e. error and correct, are studied. The results indicate that following an error response, the brain organizes itself to form communities across frequencies, in particular between theta and gamma bands while a similar cross-frequency community formation is not observed following the correct response.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.3390/sym15071368
