Limit theorems for discrete-time metapopulation models

From MaRDI portal
Publication:980786


DOI10.1214/10-PS158zbMath1194.60024OpenAlexW2127171542MaRDI QIDQ980786

F. M. Buckley, Philip K. Pollett

Publication date: 29 June 2010

Published in: Probability Surveys (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/224800



Related Items

A Central Limit Theorem for a Discrete-Time SIS Model with Individual Variation, On extinction time of a generalized endemic chain-binomial model, Binomial AR(1) processes: moments, cumulants, and estimation, The One-Out-of-k Retrieval Problem and Linear Network Coding, Asymptotics of quasi-stationary distributions of small noise stochastic dynamical systems in unbounded domains, Parameter estimation for binomial \(\mathrm{AR}(1)\) models with applications in finance and industry, BINOMIAL AUTOREGRESSIVE PROCESSES WITH DENSITY-DEPENDENT THINNING, The limiting behaviour of a stochastic patch occupancy model, An INAR(1) model based on the Pegram and thinning operators with serially dependent innovation, Extinction scenarios in evolutionary processes: a multinomial Wright-Fisher approach, Moran-type bounds for the fixation probability in a frequency-dependent Wright-Fisher model, A model for a spatially structured metapopulation accounting for within patch dynamics, Fully observed INAR(1) processes, The limiting behaviour of a mainland-island metapopulation, Quasi-stationary distributions for randomly perturbed dynamical systems, A Poisson INAR(1) model with serially dependent innovations, Avalanches in a short-memory excitable network, Chain Binomial Models and Binomial Autoregressive Processes, The Limiting Behaviour of Hanski's Incidence Function Metapopulation Model, Limits of large metapopulations with patch-dependent extinction probabilities, A Mechanistic Stochastic Ricker Model: Analytical and Numerical Investigations, Laws of large numbers for the frog model on the complete graph, A new binomial autoregressive process with explanatory variables, The one-out-of-\(k\) retrieval problem and linear network coding