Communities in Large Networks: Identification and Ranking

DOI10.1007/978-3-540-78808-9_8MaRDI QIDQ3520033zbMATH OpenOpenAlexFDO

Authors Martin Olsen

Publication date 19 August 2008

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78808-9_8

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• Community identification algorithm using relative edge density measure
• Fast unfolding of communities in large networks
• Community structure in large complex networks
• Community structure in social and biological networks
• scientific article; zbMATH DE number 5533285

Cited in

(15)

• How to identify experts in a community?
• Chain of influencers: multipartite intra-community ranking
• An axiomatic approach to community detection
• Community shell's effect on the disintegration of social networks
• Community identification algorithm using relative edge density measure
• Identify implicit communities by graph clustering
• CO-OCCURRENCE NETWORK OF REUTERS NEWS
• Community structure in large complex networks
• scientific article; zbMATH DE number 2019640 (Why is no real title available?)
• A general view on computing communities
• scientific article; zbMATH DE number 2084843 (Why is no real title available?)
• Algorithms and Models for the Web-Graph
• Formal Concept Analysis
• scientific article; zbMATH DE number 5663542 (Why is no real title available?)
• Competitivity groups on social network sites

This page was built for publication: Communities in Large Networks: Identification and Ranking

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