An L^1 ergodic theorem for sparse random subsequences
From MaRDI portal
Abstract: We prove an L^1 subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L^1-good sequences nearly as sparse as the set of squares. In the process, we prove that a certain deterministic condition implies a weak maximal inequality for a sequence of ell^1 convolution operators.
Recommendations
- A Multiparameter, Zero Density Subsequence Ergodic Theorem
- Subsequence Ergodic Theorems for L p Contractions
- On mixing and sparse ergodic theorems
- On Etemadi's subsequences and the strong law of large numbers for random fields
- On the Erdös-Rényi theorem for random fields and sequences and its relationships with the theory of runs and spacings
- Ergodic theorems for individual random sequences
- scientific article; zbMATH DE number 1159069
- Weighted ergodic theorems along subsequences of density zero
- Limit theorems for subsequences of arbitrarily-dependent sequences of random variables
Cited in
(8)- scientific article; zbMATH DE number 1159069 (Why is no real title available?)
- On convergence of oscillatory ergodic Hilbert transforms
- Integer sequences with big gaps and the pointwise ergodic theorem
- Weak type \((1,1)\) inequalities for discrete rough maximal functions
- Multivariable averaging on sparse sets
- A random pointwise ergodic theorem with Hardy field weights
- Sublacunary sequences that are strong sweeping out
- On maximal function of discrete rough truncated Hilbert transforms
This page was built for publication: An \(L^1\) ergodic theorem for sparse random subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971482)
