Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient

DOI10.1016/J.PHYSA.2014.03.027zbMath1402.91620OpenAlexW2065117992MaRDI QIDQ1782802

Junqiu Li, Yaozu Cui, Xing-Yuan Wang

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2014.03.027

zbMATH Keywords

complex networkclustering coefficientcommunity structuresmaximal sub-graph

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (4)

Moderate tolerance promotes tag-mediated cooperation in spatial prisoner's dilemma game ⋮ Clinical-decision support based on medical literature: A complex network approach ⋮ Incorporating affiliation preference into overlapping community detection ⋮ A new measure of the resilience for networks of funds with applications to socially responsible investments

Cites Work

• Unnamed Item
• Adaptive robust fuzzy control for a class of uncertain chaotic systems
• DFT calculation for the \(\{2\}\)-inverse of a polynomial matrix with prescribed image and kernel
• From the Cover: The structure of scientific collaboration networks
• Statistical mechanics of complex networks
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Exploring complex networks

This page was built for publication: Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient