The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions
From MaRDI portal
Publication:1892110
DOI10.1016/0167-7152(94)00090-UzbMATH Open0819.60017OpenAlexW2060873943WikidataQ56039131 ScholiaQ56039131MaRDI QIDQ1892110FDOQ1892110
Authors: K. Hamza
Publication date: 21 August 1995
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-7152(94)00090-u
Recommendations
- Bounds for the difference between median and mean of beta and negative binomial distributions
- The total variation distance between the binomial and Poisson distributions
- Quantile‐locating functions and the distance between the mean and quantiles
- The median of the Poisson distribution
- Bounds for the total variation distance between the binomial and the Poisson distribution in case of medium-sized success probabilities
Cites Work
Cited In (17)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Network coloring and colored coin games
- A refined continuity correction for the negative binomial distribution and asymptotics of the median
- Bounds for the difference between median and mean of beta and negative binomial distributions
- Bernoulli trials of fixed parity, random and randomly oriented graphs
- Bounds for the total variation distance between the binomial and the Poisson distribution in case of medium-sized success probabilities
- On monotonicity of Ramanujan function for binomial random variables
- The median of the Poisson distribution
- The Kelly system maximizes median fortune
- Behavior of binomial distribution near its median
- Cumulative cohort design for dose-finding
- High-confidence estimation of small \(s-t\) reliabilities in directed acyclic networks
- Title not available (Why is that?)
- Scaling limit of random planar quadrangulations with a boundary
- The median of the number of simple paths on three vertices in the random graph
- Isaac Newton as a probabilist
- Successive shortest paths in complete graphs with random edge weights
This page was built for publication: The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892110)