Abstract
The issues of median bounds for probability distributions are addressed. A framework is presented for establishing median estimates which is strong enough to prove the two or three non-trivial median bounds. Several new median results are presented, which all use this framework. Median estimates are shown to simplify the analysis of some probabilistic processes. Application include both divide-and-conquer calculations and tail bound estimates for monotone functions of weakly dependent random variables.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
| Editors | Anon |
| Publisher | SIAM |
| Pages | 776-785 |
| Number of pages | 10 |
| State | Published - 1999 |
| Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: Jan 17 1999 → Jan 19 1999 |
Other
| Other | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Baltimore, MD, USA |
| Period | 1/17/99 → 1/19/99 |
ASJC Scopus subject areas
- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Discrete Mathematics and Combinatorics