Limit Theorems for Combinatorial Structures via Discrete Process Approximations (Q4014642): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.3240030310 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103268360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brownian bridge asymptotics for random mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cycle structure of random permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson process approximations for the Ewens sampling formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random permutations and Brownian motion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank

Latest revision as of 13:34, 16 May 2024

scientific article
Language Label Description Also known as
English
Limit Theorems for Combinatorial Structures via Discrete Process Approximations
scientific article

    Statements

    Limit Theorems for Combinatorial Structures via Discrete Process Approximations (English)
    0 references
    0 references
    0 references
    18 October 1992
    0 references
    functional limit theorems
    0 references
    cycle counts of a random permutation
    0 references
    component counts of a random mapping
    0 references
    Erdős-Turán law
    0 references
    random permutation
    0 references
    random mapping
    0 references

    Identifiers

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