Median bounds and their application

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Editors Anon
PublisherSIAM
Pages776-785
Number of pages10
StatePublished - 1999
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Other

OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Median bounds and their application'. Together they form a unique fingerprint.

  • Cite this

    Siegel, A. (1999). Median bounds and their application. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 776-785). SIAM.