Mixing local and global information for community detection in large networks

DOI10.1016/j.jcss.2013.03.012zbMath1311.68133arXiv1303.1738OpenAlexW2130377051WikidataQ58946416 ScholiaQ58946416MaRDI QIDQ394992

Alessandro Provetti, Emilio Ferrara, Pasquale De Meo, Giacomo Fiumara

Publication date: 28 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

social networkscommunity detectioncomplex networkssocial network analysis

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Game of Thieves and WERW-Kpath: Two Novel Measures of Node and Edge Centrality for Mafia Networks, Robust non-negative matrix factorization for link prediction in complex networks using manifold regularization and sparse learning, Weighting dissimilarities to detect communities in networks, Subnetwork estimation for spatial autoregressive models in large-scale networks, Embedding-based silhouette community detection, Network community detection on metric space, Efficient modularity density heuristics for large graphs, Big networks: a survey, Compressive Sensing for Cut Improvement and Local Clustering

Cites Work

• Unnamed Item
• Approximate shortest paths in weighted graphs
• On the complexity of Newman's community finding approach for biological and social networks
• Enhancing community detection using a network weighting strategy
• A faster algorithm for betweenness centrality*
• Detecting network communities: a new systematic and efficient algorithm
• On Finding Graph Clusterings with Maximum Modularity
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Probability Inequalities for Sums of Bounded Random Variables
• A decentralized algorithm for spectral analysis