Clustering Social Networks

DOI10.1007/978-3-540-77004-6_5MaRDI QIDQ5458300zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

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

Cited in

(17)

• Efficient clustering of large uncertain graphs using neighborhood information
• Equality of opportunity and integration in social networks
• Clustering communities using interval K-means
• A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices
• Finding disjoint dense clubs in a social network
• Finding strongly knit clusters in social networks
• Clustering in complex networks
• Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
• Detecting communities is hard (and counting them is even harder)
• Arbitrary overlap constraints in graph packing problems
• On the advantage of overlapping clusters for minimizing conductance
• Clustering of links and clustering of nodes: fusion of knowledge in social networks
• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Clustering of sparse data via network communities -- a prototype study of a large online market
• Finding endogenously formed communities
• Graph Drawing
• Linear constrained Rayleigh quotient optimization: theory and algorithms

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)