An axiomatic approach to community detection

DOI10.1145/2840728.2840748zbMATH Open1334.91061OpenAlexW2296646434MaRDI QIDQ2800560FDOQ2800560

Authors: Adrian Marple, Christian Borgs, Jennifer T. Chayes, Shang-Hua Teng 

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2840728.2840748

Recommendations

• Finding endogenously formed communities
• Communities in Large Networks: Identification and Ranking
• Graph aggregation
• scientific article; zbMATH DE number 1143643
• Axioms for graph clustering quality functions

zbMATH Keywords

network analysissocial choice theoryaxiomatic frameworksocial and information networkscommunity identificationtaxonomy of community rules

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30)

Cited In (6)

• Computing exact \(p\)-values for community detection
• How to identify experts in a community?
• Network essence: PageRank completion and centrality-conforming Markov chains
• Finding endogenously formed communities
• The axiomatic approach and the Internet
• Detecting communities is hard (and counting them is even harder)

This page was built for publication: An axiomatic approach to community detection

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