2017
DOI: 10.1007/s10618-017-0525-y
|View full text |Cite
|
Sign up to set email alerts
|

Local community detection in multilayer networks

Abstract: The problem of local community detection in graphs refers to the identification of a community that is specific to a query node and relies on limited information about the network structure. Existing approaches for this problem are defined to work in dynamic network scenarios, however they are not designed to deal with complex real-world networks, in which multiple types of connectivity might be considered. In this work, we fill this gap in the literature by introducing the first framework for local community … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 51 publications
(28 citation statements)
references
References 27 publications
0
28
0
Order By: Relevance
“…We executed some community-detection algorithms across the Twitter event networks, Noordin terrorist relationship networks, student-cooperation social networks and global terrorism networks. These algorithms are BGLL for multiplex networks (BGLLMN) 61 , 62 , bridge detection (BD) 63 ,tensor decomposition for multiplex networks (TD) 64 , Modularity-driven Ensemble-Based Community Detection (M-EMCD) 65 , Multidimensional Label Propagation Algorithm (MDLPA) 66 , Multilayer Local Community Detection (ML-LCD) 67 and our modularity function for multiplex networks (see Supplementary Note 2 ). Figure 3 shows the results of this quantitative comparison (see Supplementary Note 3 ) on three of the tested networks and indicates that the modularity function for multiplex networks results in higher-quality communities than do the other tested methods (see Supplementary Note 3 ).…”
Section: Resultsmentioning
confidence: 99%
“…We executed some community-detection algorithms across the Twitter event networks, Noordin terrorist relationship networks, student-cooperation social networks and global terrorism networks. These algorithms are BGLL for multiplex networks (BGLLMN) 61 , 62 , bridge detection (BD) 63 ,tensor decomposition for multiplex networks (TD) 64 , Modularity-driven Ensemble-Based Community Detection (M-EMCD) 65 , Multidimensional Label Propagation Algorithm (MDLPA) 66 , Multilayer Local Community Detection (ML-LCD) 67 and our modularity function for multiplex networks (see Supplementary Note 2 ). Figure 3 shows the results of this quantitative comparison (see Supplementary Note 3 ) on three of the tested networks and indicates that the modularity function for multiplex networks results in higher-quality communities than do the other tested methods (see Supplementary Note 3 ).…”
Section: Resultsmentioning
confidence: 99%
“…In addition to the above-mentioned directions, quite a part of algorithms focus on overlapping community detection (Liu et al 2018) and local community detection (Interdonato et al 2017;Jeub et al 2015;Li et al 2019). On the one hand, The complexity of ABACUS depends on the complexity of the employed monolayer algorithms, e.g., O(n) from LPA (Raghavan et al 2007) and with total complexity of The complexity of MLMaOP depends on an uncertain convergence process, thereby marked with "-".…”
Section: Discussionmentioning
confidence: 99%
“…If a path between any two nodes in the multilayer network can be found, then the network is connected; otherwise, it is not connected. However, different types of network connectivity may occur if the edges in different network layers are considered [29].…”
Section: ) Indirect Influence Of Multi-layer Network Nodesmentioning
confidence: 99%