Journal article icon

Journal article

Simulating eco-evolutionary processes in an obligate pollination model with a genetic algorithm

Abstract:
Pollination interactions are common, and their maintenance is critical for many food crops upon which human populations depend. Pollination is a mutualism interaction; together with predation and competition, mutualism makes up the triumvirate of fundamental interactions that control population dynamics. Here we examine pollination interactions (nectar reward for gamete transport service) using a simple heuristic model similar to the Lotka–Volterra models that have underpinned our understanding of predation and competition so effectively since the 1920s. We use a genetic algorithm to simulate the eco-evolutionary interactions of the plant and pollinator populations and examine the distributions of the parameter values and zero isoclines to infer the relative ubiquity of the various eco-evolutionary outcomes possible in the model. Our results suggest that trade-offs between costs and benefits for the pollinator may be a key component of obligate pollination systems in achieving adaptive success creating and stably occupying mutualist niches.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/s11538-018-0508-1

Authors


More by this author
Role:
Author
ORCID:
0000-0001-9582-857X
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Lincoln College
Role:
Author


Publisher:
Springer Nature
Journal:
Bulletin of Mathematical Biology More from this journal
Volume:
81
Issue:
2019
Pages:
4803–4820
Publication date:
2018-09-12
Acceptance date:
2018-09-06
DOI:
EISSN:
1522-9602
ISSN:
0092-8240
Pmid:
30209744


Language:
English
Keywords:
Pubs id:
pubs:920329
UUID:
uuid:d788b780-925e-4de3-a661-88c326fff098
Local pid:
pubs:920329
Source identifiers:
920329
Deposit date:
2019-04-05

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP