Permanent URL to this publication: http://dx.doi.org/10.5167/uzh23585
Barbour, A D; Janson, S (2009). A functional combinatorial central limit theorem. Electronic Journal of Probability, 14:23522370.

PDF (VerlagsPDF)
1MB  
 Accepted Version 223kB 
Abstract
The paper establishes a functional version of the Hoeffding combinatorial central limit theorem. First, a prelimiting Gaussian process approximation is defined, and is shown to be at a distance of the order of the Lyapounov ratio from the original random process. Distance is measured by comparison of expectations of smooth functionals of the processes, and the argument is by way of Stein's method. The prelimiting process is then shown, under weak conditions, to converge to a Gaussian limit process. The theorem is used to describe the shape of random permutation tableaux.
Item Type:  Journal Article, refereed, original work 

Communities & Collections:  07 Faculty of Science > Institute of Mathematics 
DDC:  510 Mathematics 
Language:  English 
Date:  October 2009 
Deposited On:  06 Jan 2010 10:18 
Last Modified:  27 Nov 2013 20:13 
Publisher:  Institute of Mathematical Statistics 
Series Name:  Adv. Texts Basler Lehrbucher 
Number of Pages:  288 
ISSN:  10836489 
ISBN:  9783764399818 
Official URL:  http://www.math.washington.edu/~ejpecp/viewarticle.php?id=2022&layout=abstract 
Related URLs:  http://arxiv.org/abs/0907.0347 
Citations:  Web of Science®. Times Cited: 1 Google Scholar™ Scopus®. Citation Count: 1 
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page