Journal of Probability and Statistics
Volume 2010 (2010), Article ID 781681, 13 pages
doi:10.1155/2010/781681
Research Article

Central Limit Theorem for Coloured Hard Dimers

Department of Mathematics and Informatics, University of Camerino, Via Madonna delle Carceri 9, 62032 Camerino, MC, Italy

Received 26 August 2010; Accepted 22 December 2010

Academic Editor: Shein-chung Chow

Copyright © 2010 Maria Simonetta Bernabei and Horst 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.

Abstract

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.