English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/40459
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

The smallest of all worlds: Pollination networks

AuthorsOlesen, Jens M.; Bascompte, Jordi ; Dupont, Yoko L.; Jordano, Pedro
KeywordsSmall world
Food web
Network
Path length
Issue DateMay-2006
PublisherElsevier
CitationJournal of Theoretical Biology 240 (2006) 270–276
AbstractA pollination network may be either 2-mode, describing trophic and reproductive interactions between communities of flowering plants and pollinator species within a well-defined habitat, or 1-mode, describing interactions between either plants or pollinators. In a 1- mode pollinator network, two pollinator species are linked to each other if they both visit the same plant species, and vice versa for plants. Properties of 2-mode networks and their derived 1-mode networks are highly correlated and so are properties of 1-mode pollinator and 1-mode plant networks. Most network properties are scale-dependent, i.e. they are dependent upon network size. Pollination networks have the strongest small-world properties of any networks yet studied, i.e. all species are close to each other (short average path length) and species are highly clustered. Species in pollination networks are much more densely linked than species in traditional food webs, i.e. they have a higher density of links, a shorter distance between species, and species are more clustered.
Publisher version (URL)http://dx.doi.org/10.1016/j.jtbi.2005.09.014
URIhttp://hdl.handle.net/10261/40459
DOI10.1016/j.jtbi.2005.09.014
Appears in Collections:(EBD) Artículos
Files in This Item:
File Description SizeFormat 
olesen_etal_2006_jtheorbiol.doc773,5 kBMicrosoft WordView/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.