Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Food web networks: Scaling relation revisited Stefano Allesina a,*, Antonio Bodini b
 

Summary: View point
Food web networks: Scaling relation revisited
Stefano Allesina a,*, Antonio Bodini b
a
Dipartimento di Scienze Ambientali, Universita` di Parma, Department of Fisheries and Wildlife,
Michigan State University, 13 Natural Resources Building, East Lansing, MI 8824, USA
b
Dipartimento di Scienze Ambientali, Universita` di Parma
Received 15 January 2005; received in revised form 27 April 2005; accepted 9 May 2005
Available online 17 October 2005
Abstract
Food webs seem to possess scale invariant attributes among which efficiency has been recently included. Considering food
webs as transportation networks it has been shown that minimum spanning trees, topologies that minimize cost for delivering
medium, satisfy a universal scaling relation. It is not clear, however, whether resource distribution follows the criterion of
minimum cost, because longer, less efficient routes are used as well. Because of this, instead of focusing on minimum length
spanning trees (MLST) we consider directed acyclic graphs (DAGs) as better descriptors of food web hierarchies. Twenty well
known empirical food webs have been transformed into DAGs and a scaling relation has been observed between number of
nodes and their level of effective connectivity. Although we derived the scaling relation for DAGs using topological arguments,
the exponent of the equation C / Ah
shows same mathematical properties than its functional counterpart computed through flow

  

Source: Allesina, Stefano - Department of Ecology and Evolution, University of Chicago

 

Collections: Environmental Sciences and Ecology; Biology and Medicine