Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events (Q505450): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Prékopa, András / rank
Normal rank
 
Property / author
 
Property / author: Prékopa, András / rank
 
Normal rank
Property / review text
 
The authors consider the following problem. Given function \(f\) of \(n\) variables and a random sample \(X = (X_1, \dots, X_n)\) find lower an upper bounds, \(l\) and \(u\), such that \(P(l \leq f(X) \leq u) \simeq 1\). They note that these numbers might be obtained by solving two optimization problems: \(\min f(x)\) subject to \(x \in \Omega\), \(\max f(x)\) subject to \(x \in \Omega\), where \(\Omega\) is the set of all possible realizations of \(X\). Them they show a method to deal with them based on the binomial moments to construct a systematic mathematical form, and Boolean logic.
Property / review text: The authors consider the following problem. Given function \(f\) of \(n\) variables and a random sample \(X = (X_1, \dots, X_n)\) find lower an upper bounds, \(l\) and \(u\), such that \(P(l \leq f(X) \leq u) \simeq 1\). They note that these numbers might be obtained by solving two optimization problems: \(\min f(x)\) subject to \(x \in \Omega\), \(\max f(x)\) subject to \(x \in \Omega\), where \(\Omega\) is the set of all possible realizations of \(X\). Them they show a method to deal with them based on the binomial moments to construct a systematic mathematical form, and Boolean logic. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jerzy Ombach / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60E05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6676777 / rank
 
Normal rank
Property / zbMATH Keywords
 
function of a random sample
Property / zbMATH Keywords: function of a random sample / rank
 
Normal rank
Property / zbMATH Keywords
 
binomial moments scheme
Property / zbMATH Keywords: binomial moments scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
Boolean functions of events
Property / zbMATH Keywords: Boolean functions of events / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.11.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560035350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed Form Two-Sided Bounds for Probabilities that At Least <i>r</i> and Exactly <i>r</i> Out of <i>n</i> Events Occur / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boole-Bonferroni Inequalities and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830009 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:30, 13 July 2024

scientific article
Language Label Description Also known as
English
Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events
scientific article

    Statements

    Extreme value estimation for a function of a random sample using binomial moments scheme and Boolean functions of events (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    The authors consider the following problem. Given function \(f\) of \(n\) variables and a random sample \(X = (X_1, \dots, X_n)\) find lower an upper bounds, \(l\) and \(u\), such that \(P(l \leq f(X) \leq u) \simeq 1\). They note that these numbers might be obtained by solving two optimization problems: \(\min f(x)\) subject to \(x \in \Omega\), \(\max f(x)\) subject to \(x \in \Omega\), where \(\Omega\) is the set of all possible realizations of \(X\). Them they show a method to deal with them based on the binomial moments to construct a systematic mathematical form, and Boolean logic.
    0 references
    0 references
    0 references
    function of a random sample
    0 references
    binomial moments scheme
    0 references
    Boolean functions of events
    0 references
    0 references