Central limit theorem for coloured hard dimers (Q544472): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 60F05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 60C05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 60E10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5907951 / rank | |||
Normal rank | |||
Revision as of 11:05, 1 July 2023
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
