the behaviour of large metapopulations
play

The behaviour of large metapopulations Ross McVinish School of - PowerPoint PPT Presentation

The behaviour of large metapopulations Ross McVinish School of Mathematics and Physics University of Queensland 9 July 2013 Joint work with P.K. Pollett Ross McVinish The behaviour of large metapopulations Overview of metapopulations A


  1. The behaviour of large metapopulations Ross McVinish School of Mathematics and Physics University of Queensland 9 July 2013 Joint work with P.K. Pollett Ross McVinish The behaviour of large metapopulations

  2. Overview of metapopulations A “population of populations” linked by migrating individuals. Local populations are located at disjoint habitat patches. Local populations frequently go extinct. Empty habitat patches may be colonised by migrating individuals from occupied patches. The aim is to understand regional persistence/extinction. Ross McVinish The behaviour of large metapopulations

  3. Overview of metapopulations A “population of populations” linked by migrating individuals. Local populations are located at disjoint habitat patches. Local populations frequently go extinct. Empty habitat patches may be colonised by migrating individuals from occupied patches. The aim is to understand regional persistence/extinction. Ross McVinish The behaviour of large metapopulations

  4. Overview of metapopulations A “population of populations” linked by migrating individuals. Local populations are located at disjoint habitat patches. Local populations frequently go extinct. Empty habitat patches may be colonised by migrating individuals from occupied patches. The aim is to understand regional persistence/extinction. Ross McVinish The behaviour of large metapopulations

  5. Overview of metapopulations A “population of populations” linked by migrating individuals. Local populations are located at disjoint habitat patches. Local populations frequently go extinct. Empty habitat patches may be colonised by migrating individuals from occupied patches. The aim is to understand regional persistence/extinction. Ross McVinish The behaviour of large metapopulations

  6. Hanski’s metapopulation model Hanski’s 1 incidence function metapopulation model has become one of the most widely used models in metapopulation ecology. This model employs the Presence – Absence assumption. Only the occupancy status of patches in the metapopulation is modelled, not the size of the local populations. Let X n t = ( X n 1 , t , . . . , X n n , t ) denote the state of an n –patch metapopulation at time t where � 1 , if patch i is occupied at time t , X n i , t = 0 , otherwise . X n t is a discrete–time Markov chain on { 0 , 1 } n . 1 Hanski, I. (1994). A practical model of metapopulation dynamics. J. Anim. Ecol. 63, 151-162. Ross McVinish The behaviour of large metapopulations

  7. Hanski’s metapopulation model Conditional on X n t , the status of each patch at time t + 1 is independent. Patch i is described by its location z i , local extinction probability 1 − s i , and a weight related to the patch size A i . Connectivity between patches is model by the function D ( z , ˜ z ). It describes how easy it is to move from a patch at ˜ z to a patch at z . The transitional probabilities for Hanski’s model is given by   � X n i , t +1 = 1 | X n = s i X n 1 − X n A b j D ( z i , z j ) X n  , � � � � Pr i , t + f i , t j , t t j � = i where f : [0 , ∞ ) �→ [0 , 1] and b > 0. Ross McVinish The behaviour of large metapopulations

  8. Simplifying assumptions A i = n − 1 / b . z i ∈ Ω a compact subset of R d . D ( z , ˜ z ) is symmetric and defines a uniformly bounded and equicontinuous family of functions on Ω. f is increasing and twice differentiable. Ross McVinish The behaviour of large metapopulations

  9. Simplifying assumptions A i = n − 1 / b . If b < 1 then the total area decreases as n → ∞ . z i ∈ Ω a compact subset of R d . D ( z , ˜ z ) is symmetric and defines a uniformly bounded and equicontinuous family of functions on Ω. f is increasing and twice differentiable. Ross McVinish The behaviour of large metapopulations

  10. Simplifying assumptions A i = n − 1 / b . If b < 1 then the total area decreases as n → ∞ . z i ∈ Ω a compact subset of R d . A mild assumption? D ( z , ˜ z ) is symmetric and defines a uniformly bounded and equicontinuous family of functions on Ω. f is increasing and twice differentiable. Ross McVinish The behaviour of large metapopulations

  11. Simplifying assumptions A i = n − 1 / b . If b < 1 then the total area decreases as n → ∞ . z i ∈ Ω a compact subset of R d . A mild assumption? D ( z , ˜ z ) is symmetric and defines a uniformly bounded and equicontinuous family of functions on Ω. Typically, D ( z , ˜ z ) = exp( − α � z − ˜ z � ) for some α > 0 and norm � · � . f is increasing and twice differentiable. Ross McVinish The behaviour of large metapopulations

  12. Simplifying assumptions A i = n − 1 / b . If b < 1 then the total area decreases as n → ∞ . z i ∈ Ω a compact subset of R d . A mild assumption? D ( z , ˜ z ) is symmetric and defines a uniformly bounded and equicontinuous family of functions on Ω. Typically, D ( z , ˜ z ) = exp( − α � z − ˜ z � ) for some α > 0 and norm � · � . f is increasing and twice differentiable. Satisfied by many colonisation functions used in practice, e.g. f ( x ) = 1 − exp( − β x ), β > 0. Ross McVinish The behaviour of large metapopulations

  13. Random measures Define the random measure σ n on [0 , 1] × Ω by n � h ( s , z ) σ n ( ds , dz ) := n − 1 � h ( s i , z i ) , i =1 where h ∈ C + ([0 , 1] × Ω) . The sequence of random measures { σ n } ∞ n =1 converges in distribution to σ if for all h ∈ C + ([0 , 1] × Ω) � � h ( s , z ) σ n ( ds , dz ) d → h ( s , z ) σ ( ds , dz ) . d We will assume that σ n → σ for some non-random measure σ . This assumption holds if, for example, { ( s i , z i ) } ∞ n =1 is an iid sequence. Ross McVinish The behaviour of large metapopulations

  14. Point processes Define the random (counting) measure ( s i , z i ) ∈ B : X n � � µ n , t ( B ) := # i , t = 1 for any bounded Borel set B . Let V be the class of real-valued Borel functions h on R d +1 with 1 − h vanishing off some bounded set and satisfying 0 ≤ h ( s , z ) ≤ 1 for all ( s , z ) ∈ R d +1 . The probability generating functional (p.g.fl.) of µ n , t is � n � � X n i , t h ( s i , z i ) + 1 − X n � � G n , t [ h ] = E . i , t i =1 Convergence of µ n , t establish by proving convergence of the p.g.fl.s Ross McVinish The behaviour of large metapopulations

  15. Convergence Theorem d → µ 0 with p.g.fl. G 0 and for all α > 0 Assume that µ n , 0 � � �� d α � n i =1 X n sup n E exp < ∞ . Then µ n , t → µ t where µ t has i , 0 p.g.fl. given by G t +1 [ h ] = G t [ G 1 [ h | ( s , z )]] , for any h ∈ V , and G 1 [ h | ( s , z )] is given by � � � − f ′ (0) (1 − s (1 − h ( s , z ))) exp D (˜ z , z ) (1 − h (˜ s , ˜ z )) σ ( d ˜ s , d ˜ z ) . Ross McVinish The behaviour of large metapopulations

  16. Multiplicative population chains The limiting process is (marginally) a multiplicative population chain. A patch occupied at time t and located at z colonises unoccupied patches according to a Poisson process with intensity measure f ′ (0) D ( · , z ) σ at time t + 1. A patch occupied at time t remains occupied at time t + 1 with probability s . The collection of occupied patches at time t + 1 is the superposition of these point processes. Ross McVinish The behaviour of large metapopulations

  17. Multiplicative population chains The limiting process is (marginally) a multiplicative population chain. A patch occupied at time t and located at z colonises unoccupied patches according to a Poisson process with intensity measure f ′ (0) D ( · , z ) σ at time t + 1. A patch occupied at time t remains occupied at time t + 1 with probability s . The collection of occupied patches at time t + 1 is the superposition of these point processes. Ross McVinish The behaviour of large metapopulations

  18. Multiplicative population chains The limiting process is (marginally) a multiplicative population chain. A patch occupied at time t and located at z colonises unoccupied patches according to a Poisson process with intensity measure f ′ (0) D ( · , z ) σ at time t + 1. A patch occupied at time t remains occupied at time t + 1 with probability s . The collection of occupied patches at time t + 1 is the superposition of these point processes. Ross McVinish The behaviour of large metapopulations

  19. Multiplicative population chains The limiting process is (marginally) a multiplicative population chain. A patch occupied at time t and located at z colonises unoccupied patches according to a Poisson process with intensity measure f ′ (0) D ( · , z ) σ at time t + 1. A patch occupied at time t remains occupied at time t + 1 with probability s . The collection of occupied patches at time t + 1 is the superposition of these point processes. Ross McVinish The behaviour of large metapopulations

  20. Multiplicative population chains The limiting process is (marginally) a multiplicative population chain. A patch occupied at time t and located at z colonises unoccupied patches according to a Poisson process with intensity measure f ′ (0) D ( · , z ) σ at time t + 1. A patch occupied at time t remains occupied at time t + 1 with probability s . The collection of occupied patches at time t + 1 is the superposition of these point processes. Ross McVinish The behaviour of large metapopulations

Recommend


More recommend