Central limit theorem for coloured hard dimers (Q544472): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
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
Property / Wikidata QID
 
Property / Wikidata QID: Q58652708 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135023958 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0906.3652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5179036 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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