I haven't read the literature, so purely out of interest: the other Newman algorithm (non-weighted) operates on the connectivity matrix.  Is there a formulation of the weighted version that operates on the weighted connectivity matrix?  I assume the two algorithms do very similar things?