Spectral tripartitioning of networks

Understand

We formulate a spectral graph-partitioning algorithm that uses the two leading eigenvectors of the matrix corresponding to a selected quality function to split a network into three communities in a single step.

• In so doing, we extend the recursive bipartitioning methods developed by Newman [Proc.
• Nat.
• Acad.