Normal approximations for discrete-time occupancy processes

DOI10.1016/J.SPA.2020.05.016MaRDI QIDQ2196554zbMATH OpenOpenAlexFDO

Authors Liam Hodgkinson, Ross S. McVinish, P. K. Pollett

Publication date 3 September 2020

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.00542

zbMATH Keywords

central limit theoremnetwork modelsquantitative law of large numbersspreading processesStein's methodstochastic patch occupancy models

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) (L^p)-limit theorems (60F25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Epidemiology (92D30) Ecology (92D40)

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.

Recommendations

• Dominating occupancy processes by the independent site approximation
• Local Limit Approximations for Markov Population Processes
• Discretized normal approximation by Stein's method
• Translated Poisson approximation to equilibrium distributions of Markov population processes
• Limit theorems for discrete-time metapopulation models

Cites work

• A generalization of the Lindeberg principle
• Almost sure weak convergence of random probability measures
• An Introduction to Stein's Method
• Best constants in moment inequalities for linear combinations of independent and exchangeable random variables
• Complex graphs and networks
• Concentration inequalities. A nonasymptotic theory of independence
• Connecting deterministic and stochastic metapopulation models
• Cooperative systems of differential equations with concave nonlinearities
• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 3134565 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 2208228 (Why is no real title available?)
• scientific article; zbMATH DE number 2207720 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• Interacting particle systems. With a new postface.
• Large networks and graph limits
• Laws of large numbers for epidemic models with countably many types
• Limit theorems for Markov processes indexed by continuous time Galton-Watson trees
• Markov chains and stochastic stability
• Metapopulation theory for fragmented landscapes
• Normal Approximation by Stein’s Method
• Normal approximation for hierarchical structures
• On Stein's method for multivariate normal approximation
• Random graph dynamics
• Random graphs.
• Rapid simulation of spatial epidemics: a spectral method
• Rescaled voter models converge to super-Brownian motion.
• Reversing the Berry-Esseen Inequality
• Spatially structured metapopulation models: Global and local assessment of metapopulation capacity.
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Statistical mechanics of cellular automata
• Stochastic Dynamics and Irreversibility
• Strong approximation theorems for density dependent Markov chains
• The 1996 Wald memorial lectures. Stochastic models of interacting systems
• The limiting behaviour of a mainland-island metapopulation
• The limiting behaviour of a stochastic patch occupancy model
• The Limiting Behaviour of Hanski's Incidence Function Metapopulation Model
• Understanding machine learning. From theory to algorithms

Cited in

(3)

• Dominating occupancy processes by the independent site approximation
• Fast approximate simulation of finite long-range spin systems
• Large-Deviation Approximations for General Occupancy Models

This page was built for publication: Normal approximations for discrete-time occupancy processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196554)