SVD entropy reveals the high complexity of ecological networks

This is a Preprint and has not been peer reviewed. The published version of this Preprint is available: This is version 2 of this Preprint.

Add a Comment

You must log in to post a comment.


There are no comments or no comments have been made public for this article.


Download Preprint

Supplementary Files

Tanya Strydom , Giulio Valentino Dalla Riva, Timothée Poisot 


Quantifying the complexity of ecological networks has remained elusive. Primarily, complexity has been defined on the basis of the structural (or behavioural) complexity of the system. These definitions ignore the notion of physical complexity, which can measure the amount of information contained in an ecological network, and how difficult it would be to compress. We present relative rank deficiency and SVD entropy as measures of external and internal complexity respectively. Using bipartite ecological networks, we find that they all show a very high, almost maximal, physical complexity. Pollination networks, in particular, are more complex when compared to other types of interactions. In addition, we find that SVD entropy relates to other structural measures of complexity (nestedness, connectance, and spectral radius), but does not inform about the resilience of a network when using simulated extinction cascades, which has previously been reported for structural measures of complexity. We argue that SVD entropy provides a fundamentally more correct measure of network complexity and should be added to the toolkit of descriptors of ecological networks moving forward.



Ecology and Evolutionary Biology, Life Sciences, Other Ecology and Evolutionary Biology


complexity, ecological networks, singular value decompsotion


Published: 2020-11-03 01:04

Last Updated: 2020-11-13 23:40

Older Versions

CC-By Attribution-ShareAlike 4.0 International