Normal approximations for discrete-time occupancy processes
Preprint
Abstract
We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks literature, including stochastic patch occupancy models in ecology, network models in epidemiology, and a variety of dynamic random graph models. Bounds on the rate of convergence for a central limit theorem are obtained using Stein's method and moment inequalities on the deviation from an analogous deterministic model. As a consequence, our work also implies a uniform law of large numbers for a subclass of these processes.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Rapid simulation of spatial epidemics: A spectral methodJournal of Theoretical Biology, 2015
- Connecting deterministic and stochastic metapopulation modelsJournal of Mathematical Biology, 2015
- The limiting behaviour of a stochastic patch occupancy modelJournal of Mathematical Biology, 2012
- The limiting behaviour of a mainland-island metapopulationJournal of Mathematical Biology, 2011
- Metapopulation theory for fragmented landscapesTheoretical Population Biology, 2003
- Agent-based modeling: Methods and techniques for simulating human systemsProceedings of the National Academy of Sciences, 2002
- Spatially Structured Metapopulation Models: Global and Local Assessment of Metapopulation CapacityTheoretical Population Biology, 2001
- Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimensionJournal of Combinatorial Theory, Series A, 1995
- The Domany-Kinzel cellular automaton phase diagramJournal of Statistical Physics, 1994
- Cooperative systems of differential equations with concave nonlinearitiesNonlinear Analysis, 1986