Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 19 August 2019

Abstract and Keywords

This article discusses some results on Bernstein type and maximal inequalities for partial sums of dependent random vectors taking their values in separable Hilbert or Banach spaces of finite or infinite dimension. Two types of measure of dependence are considered: strong mixing coefficients (α-mixing) and absolutely regular mixing coefficients (β-mixing). These inequalities, which are similar to those in the dependent real case, are used to derive the strong law of large numbers (SLLN) and the bounded law of the iterated logarithm (LIL) for absolutely regular Hilbert- or Banach-valued processes under minimal mixing conditions. The article first introduces the relevant notation and definitions before presenting the maximal inequalities in the strong mixing case, followed by the absolutely regular mixing case. It concludes with some applications to the SLLN, the bounded LIL for Hilbertian or Banachian absolutely regular processes, the recursive estimation of probability density, and the covariance operator estimations.

Keywords: maximal inequalities, random vectors, Hilbert spaces, Banach spaces, strong mixing, absolutely regular mixing, strong law of large numbers, bounded law of the iterated logarithm, recursive estimation, covariance operator estimation

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.