Normal approximations for discrete-time occupancy processes

@article{Hodgkinson2018NormalAF,
  title={Normal approximations for discrete-time occupancy processes},
  author={Liam Hodgkinson and R. McVinish and P. Pollett},
  journal={Stochastic Processes and their Applications},
  year={2018},
  volume={130},
  pages={6414-6444}
}
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… Expand
Refinements of Mean Field Approximation
Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average
  • D. Gamarnik
  • Mathematics, Physics
  • 2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020

References

SHOWING 1-10 OF 52 REFERENCES
A Generic Mean Field Convergence Result for Systems of Interacting Objects
A refined mean field approximation of synchronous discrete-time population models
Laws of large numbers for epidemic models with countably many types
Connecting deterministic and stochastic metapopulation models
Stein's Method for Mean-Field Approximations in Light and Heavy Traffic Regimes
  • Lei Ying
  • Mathematics, Computer Science
  • SIGMETRICS
  • 2017
On the Approximation Error of Mean-Field Models
  • Lei Ying
  • Computer Science, Mathematics
  • SIGMETRICS
  • 2016
The limiting behaviour of a stochastic patch occupancy model
...
1
2
3
4
5
...