Abstract | ||
---|---|---|
To better understand the evolution of dispersal in spatially heterogeneous landscapes, we study difference equation models of populations that reproduce and disperse in a landscape consisting of k patches. The connectivity of the patches and costs of dispersal are determined by a k x k column substochastic matrix S, where S-ij represents the fraction of dispersing individuals from patch j that end up in patch i. Given S, a dispersal strategy is a k x 1 vector whose ith entry gives the probability pi that individuals disperse from patch i. If all of the pi's are the same, then the dispersal strategy is called unconditional; otherwise it is called conditional. For two competing populations of unconditional dispersers, we prove that the slower dispersing population ( i. e., the population with the smaller dispersal probability) displaces the faster dispersing population. Alternatively, for populations of conditional dispersers without any dispersal costs ( i. e., S is column stochastic and all patches can support a population), we prove that there is a one parameter family of strategies that resists invasion attempts by all other strategies. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1137/050628933 | SIAM JOURNAL ON APPLIED MATHEMATICS |
Keywords | Field | DocType |
population dynamics,evolution of dispersal,monotone dynamics | Ecology,Population,Mathematical optimization,Biological dispersal,Mathematics | Journal |
Volume | Issue | ISSN |
66 | 4 | 0036-1399 |
Citations | PageRank | References |
1 | 0.63 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Stephen Kirkland | 1 | 12 | 2.07 |
Chi-Kwong Li | 2 | 313 | 29.81 |
Sebastian J. Schreiber | 3 | 4 | 3.48 |