On computing the dispersion function
From MaRDI portal
A two-dimensional analogue of the well-known bisection method for root finding is presented in order to solve the following problem, related to the dispersion function of a set of random variables: given distribution functions \(F_ 1,...,F_ n\) and a probability p, find an interval [a,b] of minimum width such that \(F_ i(b)-F_ i(a^ -)\geq p\), for \(i=1,...,n\).
Recommendations
Cites work
- A Sequential Method Seeking the Global Maximum of a Function
- A Sharper Form of the Doeblin-Lévy-Kolmogorov-Rogozin Inequality for Concentration Functions.
- An algorithm for finding the absolute extremum of a function
- scientific article; zbMATH DE number 3171472 (Why is no real title available?)
- Probability inequalities for convex sets and multidimensional concentration functions
Cited in
(2)
This page was built for publication: On computing the dispersion function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094128)