Premium
Complex networks: two ways to be robust?
Author(s) -
Melián Carlos J.,
Bascompte Jordi
Publication year - 2002
Publication title -
ecology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 6.852
H-Index - 265
eISSN - 1461-0248
pISSN - 1461-023X
DOI - 10.1046/j.1461-0248.2002.00386.x
Subject(s) - robustness (evolution) , null model , biological network , complex network , ecology , computer science , ecological network , relation (database) , perturbation (astronomy) , topology (electrical circuits) , biology , mathematics , data mining , computational biology , physics , combinatorics , biochemistry , ecosystem , world wide web , gene , quantum mechanics
Recent studies of biological networks have focused on the distribution of the number of links per node. However, the connectivity distribution does not uncover all the complexity of their topology. Here, we analyse the relation between the connectivity of a species and the average connectivity of its nearest neighbours in three of the most resolved community food webs. We compare the pattern arising with the one recently reported for protein networks and for a simple null model of a random network. Whereas two highly connected nodes are unlikely to be connected between each other in protein networks, the reverse happens in food webs. We discuss this difference in organization in relation to the robustness of biological networks to different types of perturbation.