Influence of assortativity and degree-preserving rewiring on the spectra of networks

Newman’s measure for (dis)assortativity, the linear degree correlation coefficient ?D, is reformulated in terms of the total number Nk of walks in the graph with k hops. This reformulation allows us to derive a new formula from which a degree-preserving rewiring algorithm is deduced, that, in each rewiring step, either increases or decreases ?D...

Influence of assortativity and degree-preserving rewiring on the spectra of networks