Clustering Social Networks

DOI10.1007/978-3-540-77004-6_5zbMATH Open1136.91590OpenAlexW1664520935MaRDI QIDQ5458300FDOQ5458300

Authors: Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert E. Tarjan 

Publication date: 11 April 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-77004-6_5

Recommendations

• Finding strongly knit clusters in social networks
• Finding endogenously formed communities
• Spectral clustering and the high-dimensional stochastic blockmodel
• On the statistical detection of clusters in undirected networks
• Clustering in complex networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cited In (12)

• Graph Drawing
• Clustering in complex networks
• Finding strongly knit clusters in social networks
• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Arbitrary Overlap Constraints in Graph Packing Problems
• Title not available (Why is that?)
• On the advantage of overlapping clusters for minimizing conductance
• Equality of opportunity and integration in social networks
• Finding disjoint dense clubs in a social network
• A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices
• Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation
• Efficient clustering of large uncertain graphs using neighborhood information

This page was built for publication: Clustering Social Networks

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