Discovering link communities in complex networks by exploiting link dynamics

DOI10.1088/1742-5468/2012/10/P10015zbMATH Open1456.91094arXiv1303.4699OpenAlexW3105983964MaRDI QIDQ3301281FDOQ3301281

Authors: Dongxiao He, Dayou Liu, Weixiong Zhang, Di Jin, Bo Yang 

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: Discovery of communities in complex networks is a fundamental data analysis problem with applications in various domains. Most of the existing approaches have focused on discovering communities of nodes, while recent studies have shown great advantages and utilities of the knowledge of communities of links in networks. From this new perspective, we propose a link dynamics based algorithm, called UELC, for identifying link communities of networks. In UELC, the stochastic process of a link-node-link random walk is employed to unfold an embedded bipartition structure of links in a network. The local mixing properties of the Markov chain underlying the random walk are then utilized to extract two emerged link communities. Further, the random walk and the bipartitioning processes are wrapped in an iterative subdivision strategy to recursively identify link partitions that segregate the network links into multiple subdivisions. We evaluate the performance of the new method on synthetic benchmarks and demonstrate its utility on real-world networks. Our experimental results show that our method is highly effective for discovering link communities in complex networks. As a comparison, we also extend UELC to extracting communities of node, and show that it is effective for node community identification.

Full work available at URL: https://arxiv.org/abs/1303.4699

Recommendations

• Link community detection based on line graphs with a novel link similarity measure
• A community detection algorithm for dynamic networks using link clustering
• A deep stochastic model for detecting community in complex networks
• An adaptive dynamic community detection algorithm based on incremental spectral clustering
• A link-based similarity for improving community detection based on label propagation algorithm

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Social networks; opinion dynamics (91D30)

Cites Work

• Title not available (Why is that?)
• Community structure in social and biological networks
• Fast unfolding of communities in large networks

Cited In (3)

• Scalability analysis of the synchronizability for ring or chain networks with dense clusters
• Quantitative function and algorithm for community detection in bipartite networks
• On Detection of Community Structure in Dynamic Social Networks

Uses Software

• GraphBase
• Cytoscape

This page was built for publication: Discovering link communities in complex networks by exploiting link dynamics

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