central limit theorem for coloured hard dimers中心极限定理的彩色二聚体.pdfVIP

Hindawi Publishing Corporation Journal of Probability and Statistics Volume 2010, Article ID 781681, 13 pages doi:10.1155/2010/781681 Research Article Central Limit Theorem for Coloured Hard Dimers Maria Simonetta Bernabei and Horst Thaler Department of Mathematics and Informatics, University of Camerino, Via Madonna delle Carceri 9, 62032 Camerino, MC, Italy Correspondence should be addressed to Horst Thaler, horst.thaler@unicam.it Received 26 August 2010; Accepted 22 December 2010 Academic Editor: Shein-chung Chow Copyright q 2010 M. S. Bernabei and H. Thaler. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We study the central limit theorem for a class of coloured graphs. This means that we investigate the limit behavior of certain random variables whose values are combinatorial parameters associated to these graphs. The techniques used at arriving this result comprise combinatorics, generating functions, and conditional expectations. 1. Introduction In this paper we want to verify the central limit theorem CLT in the context of a combinatorial problem for coloured hard dimer configurations, which comprise a certain class of labeled graphs on R. We will consider two combinatorial parameters that characterize our hard dimers and will therefore investigate a bivariate mass function. The problem is interesting as far as it is difficult to reformulate the task in such a manner that a general CLT becomes applicable. The proof here is based on the explicit knowledge of the bivariate mass function and is a generalization of the original De Moivre-Laplace the