COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY

DOI10.1142/S0217984909020242MaRDI QIDQ3638745zbMATH OpenFDO

Authors Zhongmin Xiong, Wei Wang

Publication date 28 October 2009

Published in Modern Physics Letters B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217984909020242

zbMATH Keywords

community detectioncommunity structuresocial networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)

Recommendations

• Community detection with dependent connectivity
• Algorithms and Models for the Web-Graph
• COMMUNITY FINDING IN COMPLEX NETWORKS
• Community detection based on network communicability
• Community detection in node-attributed social networks: a survey
• Efficient community detection in heterogeneous social networks

Cites work

• An Efficient Heuristic Procedure for Partitioning Graphs
• Community structure in social and biological networks
• scientific article; zbMATH DE number 437527 (Why is no real title available?)

Cited in

(2)

• Community detection algorithm based on effective resistance of network
• LeaDCD: leadership concept-based method for community detection in social networks

Describes a project that uses

Uses Software

• GraphBase

This page was built for publication: COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638745)