The Spectral algorithm [15], [49] optimises modularity (Eq. (11)) by utilising the eigenvalues and eigenvectors associated with the modularity matrix with elements defined as(12)The graph is split into two modules by setting an indicator vector such that if the vertex Vi is located in the module and otherwise.
![[This page as RDF]](http://data.gesis.org/somesci/static/rdf-icon.gif){kind=icon}