Results 1 
4 of
4
PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES
, 1962
"... Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges of the s ..."
Abstract

Cited by 2150 (2 self)
 Add to MetaCart
Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges of the smumands and the mean, or the mean and the variance of S. These results are then used to obtain analogous inequalities for certain sums of dependent random variables such as U statistics and the sum of a random sample without replacement from a finite population.
Branching processes in the analysis of the heights of trees
 Acta Informatica
, 1987
"... Summary. It is shown how the theory of branching processes can be applied in the analysis of the expected height of random trees. In particular, we will study the height of random binary search trees, random kd trees, quadtrees and unionend trees under various models of randomization. For example, ..."
Abstract

Cited by 71 (22 self)
 Add to MetaCart
(Show Context)
Summary. It is shown how the theory of branching processes can be applied in the analysis of the expected height of random trees. In particular, we will study the height of random binary search trees, random kd trees, quadtrees and unionend trees under various models of randomization. For example, for the random binary search tree constructed from a random permutation of 1,..., n, it is shown that H„/(c log (n)) tends to 1 in probability and in the mean as n oo, where H „ is the height of the tree, and c =4.31107... is a solution of the equation c log (2e / = 1. In addition, we ~c ~ show that H „clog (n) = O (/log (n) loglog (n)) in probability.
CALCULATING UPPER CONFIDENCE LIMITS FOR EXPOSURE POINT CONCENTRATIONS AT HAZARDOUS WASTE SITES
, 2002
"... This document provides guidance to EPA Regions concerning how the Agency intends to exercise its discretion in implementing one aspect of the CERCLA remedy selection process. The guidance is designed to implement national policy on these issues. The statutory provisions and EPA regulations described ..."
Abstract
 Add to MetaCart
(Show Context)
This document provides guidance to EPA Regions concerning how the Agency intends to exercise its discretion in implementing one aspect of the CERCLA remedy selection process. The guidance is designed to implement national policy on these issues. The statutory provisions and EPA regulations described in this document contain legally binding requirements. However, this document does not substitute for those provisions or regulations, nor is it a regulation itself. Thus, it cannot impose legallybinding requirements on EPA, States, or the regulated community, and may not apply to a particular situation based upon the circumstances. Any decisions regarding a particular remedy selection decision will be made based on the statute and regulations, and EPA decisionmakers retain the discretion to adopt approaches on a casebycase basis that differ from this guidance where appropriate. EPA may change this guidance in the future.
Constructing Probability Boxes and . . .
, 2003
"... This report summarizes a variety of the most useful and commonly applied methods for obtaining DempsterShafer structures, and their mathematical kin probability boxes, from empirical information or theoretical knowledge. The report includes a review of the aggregation methods for handling agreement ..."
Abstract
 Add to MetaCart
This report summarizes a variety of the most useful and commonly applied methods for obtaining DempsterShafer structures, and their mathematical kin probability boxes, from empirical information or theoretical knowledge. The report includes a review of the aggregation methods for handling agreement and conflict when multiple such objects are obtained from different sources.