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

Fingerprint

Random variables
Probability distributions
Estimate
Dependent Random Variables
Divide and conquer
Monotone Function
Tail
Simplify
Probability Distribution
Framework

ASJC Scopus subject areas

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

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.

Median bounds and their application. / Siegel, Alan.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. SIAM, 1999. p. 776-785.

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

Siegel, A 1999, Median bounds and their application. in Anon (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 776-785, Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 1/17/99.
Siegel A. Median bounds and their application. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 1999. p. 776-785
Siegel, Alan. / Median bounds and their application. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. SIAM, 1999. pp. 776-785
@inproceedings{69014844b38b4fe98ca9eaeb6dfea614,
title = "Median bounds and their application",
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.",
author = "Alan Siegel",
year = "1999",
language = "English (US)",
pages = "776--785",
editor = "Anon",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "SIAM",

}

TY - GEN

T1 - Median bounds and their application

AU - Siegel, Alan

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032762440&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032762440&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0032762440

SP - 776

EP - 785

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Anon, null

PB - SIAM

ER -