✦ LIBER ✦

Discrepancy of randomly sampled sequences of reals

✍ Scribed by Michel Weber

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 117 KB
Volume: 271
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.200310184

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We estimate the discrepancy of (nx) when n is sampled by a random walk and give examples involving the diophantine approximation properties of x. The proof relies upon the combination of the metric entropy method and the Erdös‐Turan inequality. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

A novel algorithm for computing autocorr

A novel algorithm for computing autocorrelation of randomly sampled sequences

✍ K. C. Lo 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 759 KB

Polynomial discrepancy of sequences

✍ Bernhard Klinger; Robert F. Tichy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 443 KB

Generalizing E. Hlawka's concept of polynomial discrepancy we introduce a similar concept for sequences in the unit cube and on the sphere. We investigate the relation of this polynomial discrepancy to the usual discrepancy and obtain lower and upper bounds. In a final section some computational res

Stability analysis of randomly sampled d

Stability analysis of randomly sampled digital control systems

✍ K.D Dannenberg; J.L Melsa 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Random sampling in digital control systems has characteristically been avoided by development of precise timing and computational cycles even though examples are known in which the randomness aids system stability. Generally, attempts to determine the effects of relaxing these rigid timing requireme

Minima of initial segments of infinite s

Minima of initial segments of infinite sequences of reals

✍ Jeffry L. Hirst 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract Suppose that 〈__x~k~__〉~__k__∈ℕ~ is a countable sequence of real numbers. Working in the usual subsystems for reverse mathematics, RCA~0~ suffices to prove the existence of a sequence of reals 〈__u~k~__〉~__k__∈ℕ~ such that for each __k__, __u~k~__ is the minimum of {__x__~0~, __x__~1~,

Fast generation of low-discrepancy seque

Fast generation of low-discrepancy sequences

✍ J. Struckmeier 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 641 KB

On the discrepancy of (0,1)-sequences

✍ Friedrich Pillichshammer 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We give bounds for the L p -discrepancy, pAN; of the van der Corput sequence in base 2. Further, we give a best possible upper bound for the star discrepancy of ð0; 1Þ-sequences and show that this bound is attained for the van der Corput sequence. Finally, we give a ð0; 1Þsequence with essentially s