Central limit theorem for coloured hard dimers (Q544472)

From MaRDI portal
Revision as of 03:38, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





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
    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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references