Using permutations to reduce discrepancy
From MaRDI portal
Let us take an infinite sequence in [0,1]. The author considers some measure of discrepancies between the repartition of numbers in this sequence and an ``ideal repartition. The goal is to minimize those discrepancies. Regarding some of the considered discrepancy measures, the so called ``generalized, symmetrized van der Corput sequences give the best currently known results in one dimension. Exact formulae for discrepancies for some van der Corput sequences are given. Some asymptotic results are also presented.
Recommendations
Cites work
- A comparative study of pseudo and quasi random sequences for the solution of integral equations
- An improved low-discrepancy sequence for multidimensional quasi-Monte Carlo integration
- Discrépance de suites associées à un système de numération (en dimension s)
- Discrépances de suites associées à un système de numération (en dimension un)
- scientific article; zbMATH DE number 4134159 (Why is no real title available?)
- scientific article; zbMATH DE number 4006360 (Why is no real title available?)
- scientific article; zbMATH DE number 4067037 (Why is no real title available?)
- scientific article; zbMATH DE number 3997927 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- Low-discrepancy and low-dispersion sequences
- On the diaphony of the van der Corput-Halton sequence
- On the star-discrepancy of generalized Hammersley sequences in two dimensions
- Point sets and sequences with small discrepancy
- Symmetrization of the van der Corput generalized sequences
Cited in
(9)- Good permutations for extreme discrepancy
- Variations on \((0,s)\)-sequences
- Permutations with low discrepancy consecutive \(k\)-sums
- Quasirandom arithmetic permutations
- A good permutation for one-dimensional diaphony
- Recent progress in improvement of extreme discrepancy and star discrepancy of one-dimen\-sional sequences
- A mixed integer linear programming formulation for low discrepancy consecutive k-sums permutation
- On the intriguing search for good permutations
- Using Rademacher permutations to reduce randomness
This page was built for publication: Using permutations to reduce discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921848)