Sökning: id:"swepub:oai:DiVA.org:umu-58970" >
Food-web structure ...
Food-web structure in low- and high-dimensional trophic niche spaces
-
Rossberg, Axel G (författare)
-
- Brännström, Åke (författare)
- Umeå universitet,Institutionen för matematik och matematisk statistik
-
Dieckmann, Ulf (författare)
-
(creator_code:org_t)
- 2010-05-12
- 2010
- Engelska.
-
Ingår i: Journal of the Royal Society Interface. - : Royal Society Publishing. - 1742-5689 .- 1742-5662. ; 7:53, s. 1735-1743
- Relaterad länk:
-
https://europepmc.or...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- A question central to modelling and, ultimately, managing food webs concerns the dimensionality of trophic niche space, that is, the number of independent traits relevant for determining consumer-resource links. Food-web topologies can often be interpreted by assuming resource traits to be specified by points along a line and each consumer's diet to be given by resources contained in an interval on this line. This phenomenon, called intervality, has been known for 30 years and is widely acknowledged to indicate that trophic niche space is close to one-dimensional. We show that the degrees of intervality observed in nature can be reproduced in arbitrary-dimensional trophic niche spaces, provided that the processes of evolutionary diversification and adaptation are taken into account. Contrary to expectations, intervality is least pronounced at intermediate dimensions and steadily improves towards lower- and higher-dimensional trophic niche spaces.
Ämnesord
- NATURVETENSKAP -- Matematik -- Annan matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Other Mathematics (hsv//eng)
- NATURVETENSKAP -- Biologi -- Ekologi (hsv//swe)
- NATURAL SCIENCES -- Biological Sciences -- Ecology (hsv//eng)
Nyckelord
- intervality
- evolution
- Ornstein–Uhlenbeck process
- Moran process
- trait matching
- phylogenetic correlations
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas