Central limit theorem for coloured hard dimers (Q544472): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5179036 / rank | |||
Normal rank | |||
Latest revision as of 03:38, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Central limit theorem for coloured hard dimers |
scientific article |
Statements
Central limit theorem for coloured hard dimers (English)
0 references
15 June 2011
0 references
Summary: 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 to arrive at this result comprise combinatorics, generating functions, and conditional expectations.
0 references
