Tight Probability Bounds with Pairwise Independence (Q6158360)

scientific article; zbMATH DE number 7690453

Language	Label	Description	Also known as
English	Tight Probability Bounds with Pairwise Independence	scientific article; zbMATH DE number 7690453

Statements

instance of

scholarly article

0 references

title

Tight Probability Bounds with Pairwise Independence (English)

0 references

0 references

0 references

SIAM Journal on Discrete Mathematics

0 references

publication date

31 May 2023

0 references

full work available at URL

https://arxiv.org/abs/2006.00516

0 references

zbMATH Keywords

pairwise independence

0 references

bounds

0 references

linear programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Price of Correlations in Stochastic Optimization

0 references

Q5595594

0 references

Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur

0 references

Polynomially Computable Bounds for the Probability of the Union of Events

0 references

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

0 references

Range of correlation matrices for dependent Bernoulli random variables

0 references

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

0 references

An Inequality for Probabilities

0 references

A lower bound on the probability of a union

0 references

Improved Bonferroni Inequalities and Binomially Bounded Functions

0 references

Bottleneck extrema

0 references

Non-Markovian Processes with the Semigroup Property

0 references

Q5538132

0 references

Methods for Proving Bonferroni Type Inequalities

0 references

Bonferroni inequalities

0 references

Small deviations of sums of independent random variables

0 references

On the joint entropy of $d$-wise-independent variables

0 references

Pairwise Independence of Jointly Dependent Variables

0 references

Best Possible Inequalities for the Probability of a Logical Function of Events

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

An upper bound for the probability of a union

0 references

On a set of almost deterministic k-independent random variables

0 references

On construction of k-wise independent random variables

0 references

Constructing Small Sample Spaces Satisfying Given Constraints

0 references

Bounds for the Probability of a Union, with Applications

0 references

Best Linear Bonferroni Bounds

0 references

A lower bound on the probability of a finite union of events

0 references

Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems

0 references

Pairwise Statistical Independence

0 references

Miscellanea. A note on generating correlated binary variables

0 references

Bivalent trees and forests or upper bounds for the probability of a union revisited

0 references

A note on the background of several Bonferroni–Galambos-type inequalities

0 references

Pairwise independent random variables

0 references

On Khintchine type inequalities for $k$-wise independent Rademacher random variables

0 references

The maximal probability that k‐wise independent bits are all 1

0 references

EXACT LOWER BOUND ON AN ‘EXACTLY ONE’ PROBABILITY

0 references

Correlation polytopes: Their geometry and complexity

0 references

A sharp upper probability bound for the occurrence of at least m out of n events

0 references

Boole-Bonferroni Inequalities and Linear Programming

0 references

Sharp Bounds on Probabilities Using Linear Programming

0 references

Bounding the probability of the union of events by aggregation and disaggregation in linear programs

0 references

A family of multivariate binary distributions for simulating correlated binary variables with specified marginal means and correlations

0 references

Strengthened bounds for the probability of $k$-out-of-$n$ events

0 references

Das maximale Signifikanzniveau des Tests: ''Lehne $H_0$ ab, wenn $k$ unter $n$ gegebenen Tests zur Ablehnung führen''

0 references

Inequalities for the probability of the occurrence of at least m out of n events

0 references

Chernoff–Hoeffding Bounds for Applications with Limited Independence

0 references

Q5388761

0 references

Graph-based upper bounds for the probability of the union of events

0 references

Optimality conditions for Hunter's bound

0 references

New upper bounds on the probability of events based on graph structures

0 references

An improved Bonferroni inequality and applications

0 references

Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

0 references

Lower Bounds on the Probability of a Finite Union of Events

0 references

Improved bounds on the probability of the union of events some of whose intersections are empty

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6158360