Constrained Randomisation of Weighted Networks

Gerrit Ansmann, Klaus Lehnertz

We propose a Markov chain method to efficiently generate 'surrogate networks' that are random under the constraint of given vertex strengths. With these strength-preserving surrogates and with edge-weight-preserving surrogates we investigate the clustering coefficient and the average shortest path length of functional networks of the human brain as well as of the International Trade Networks. We demonstrate that surrogate networks can provide additional information about network-specific characteristics and thus help interpreting empirical weighted networks.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment