Bipartite communities via spectral partitioning

DOI10.1007/s10878-020-00574-4zbMath1499.91082OpenAlexW4236531528MaRDI QIDQ5918521

Matthew P. Yancey, Kelly B. Yancey

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00574-4

zbMATH Keywords

network analysisspectral graph theorycommunity detection

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90)

Uses Software

• SNAP

Cites Work

• Multi-way dual Cheeger constants and spectral bounds of graphs
• Spectral clustering and the high-dimensional stochastic blockmodel
• Spectral methods for graph clustering - a survey
• Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
• Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplace operator
• Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
• Authoritative sources in a hyperlinked environment
• Subexponential Algorithms for Unique Games and Related Problems
• A Note On Spectral Clustering
• Max Cut and the Smallest Eigenvalue
• L ¹ ‐SMOOTHING FOR THE ORNSTEIN–UHLENBECK SEMIGROUP
• Analysis of Boolean Functions
• Partitioning into Expanders
• Multi-way spectral partitioning and higher-order cheeger inequalities
• Many sparse cuts via higher eigenvalues
• Partitioning Well-Clustered Graphs: Spectral Clustering Works!

This page was built for publication: Bipartite communities via spectral partitioning