An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

BRS-inequality is the short name for Bruss-Robertson-Steele inequality. This inequality gives a convenient upper bound for the expected maximum number of non-negative random variables one can sum up without exceeding a given upper bound .

Property Value
dbo:abstract
  • BRS-inequality is the short name for Bruss-Robertson-Steele inequality. This inequality gives a convenient upper bound for the expected maximum number of non-negative random variables one can sum up without exceeding a given upper bound . For example, suppose 100 random variables are all uniformly distributed on , not necessarily independent, and let , say. Let be the maximum number of one can select in such that their sum does not exceed . is a random variable, so what can one say about bounds for its expectation? How would an upper bound for behave, if one changes the size of the sample and keeps fixed, or alternatively, if one keeps fixed but varies ? What can one say about , if the uniform distribution is replaced by another continuous distribution? In all generality, what can one say if each may have its own continuous distribution function ? (en)
dbo:wikiPageID
  • 41658713 (xsd:integer)
dbo:wikiPageLength
  • 8089 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1124546002 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdfs:comment
  • BRS-inequality is the short name for Bruss-Robertson-Steele inequality. This inequality gives a convenient upper bound for the expected maximum number of non-negative random variables one can sum up without exceeding a given upper bound . (en)
rdfs:label
  • BRS-inequality (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License