Approximation of the difference of two Poisson-like counts by Skellam
From MaRDI portal
Publication:4684949
DOI10.1017/jpr.2018.27zbMath1401.62024arXiv1708.04018OpenAlexW2963682894MaRDI QIDQ4684949
No author found.
Publication date: 26 September 2018
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.04018
Central limit and other weak theorems (60F05) Approximations to statistical distributions (nonasymptotic) (62E17) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (2)
Estimation of Subgraph Densities in Noisy Networks ⋮ Computing (Bivariate) Poisson Moments Using Stein–Chen Identities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical analysis of network data. Methods and models
- Applied mathematics meets signal processing.
- A central limit theorem for decomposable random variables with applications to random graphs
- Stein's method and birth-death processes
- On Stein-Chen factors for Poisson approximation
- Poisson convergence and random graphs
- Skellam Shrinkage: Wavelet-Based Intensity Estimation for Inhomogeneous Poisson Data
- On the Propagation of Low-Rate Measurement Error to Subgraph Counts in Large Networks
- The Frequency Distribution of the Difference Between Two Poisson Variates Belonging to Different Populations
- Networks
This page was built for publication: Approximation of the difference of two Poisson-like counts by Skellam