|
|
|
Item Details
Title:
|
UNIFORM CENTRAL LIMIT THEOREMS
|
By: |
R. M. Dudley |
Format: |
Paperback |
List price:
|
£46.99 |
Our price: |
£41.12 |
Discount: |
|
You save:
|
£5.87 |
|
|
|
|
ISBN 10: |
0521738415 |
ISBN 13: |
9780521738415 |
Availability: |
Usually dispatched within 1-3 weeks.
Delivery
rates
|
Stock: |
Currently 0 available |
Publisher: |
CAMBRIDGE UNIVERSITY PRESS |
Pub. date: |
24 February, 2014 |
Edition: |
2nd Revised edition |
Series: |
Cambridge Studies in Advanced Mathematics 142 |
Pages: |
482 |
Description: |
This expanded edition of the classic work on empirical processes now boasts several new proved theorems not in the first. |
Synopsis: |
In this new edition of a classic work on empirical processes the author, an acknowledged expert, gives a thorough treatment of the subject with the addition of several proved theorems not included in the first edition, including the Bretagnolle-Massart theorem giving constants in the Komlos-Major-Tusnady rate of convergence for the classical empirical process, Massart's form of the Dvoretzky-Kiefer-Wolfowitz inequality with precise constant, Talagrand's generic chaining approach to boundedness of Gaussian processes, a characterization of uniform Glivenko-Cantelli classes of functions, Gine and Zinn's characterization of uniform Donsker classes, and the Bousquet-Koltchinskii-Panchenko theorem that the convex hull of a uniform Donsker class is uniform Donsker. The book will be an essential reference for mathematicians working in infinite-dimensional central limit theorems, mathematical statisticians, and computer scientists working in computer learning theory. Problems are included at the end of each chapter so the book can also be used as an advanced text. |
Publication: |
UK |
Imprint: |
Cambridge University Press |
Returns: |
Returnable |
|
|
|
|
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|