Random partition of a finite set by cycles of permutation

DOI10.1007/BF03167203zbMATH Open0781.60012MaRDI QIDQ689906FDOQ689906

Authors: Masaaki Sibuya 

Publication date: 17 February 1994

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3844715
• A random clustering process
• scientific article; zbMATH DE number 1140612
• On permutations with cycle lengths in a random set
• Some nonequiprobable models of random permutations

zbMATH Keywords

cluster analysisBell polynomialrandom partition

Mathematics Subject Classification ID

Point estimation (62F10) Order statistics; empirical distribution functions (62G30) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A random clustering process
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functionals of random mappings: exact and asymptotic results
• Title not available (Why is that?)

Cited In (9)

• Ordered and unordered random partitions of an integer and the GEM distribution
• A random clustering process
• Title not available (Why is that?)
• Fragmenting random permutations
• Characterization of some random partitions
• Counting and computing the Rand and block distances of pairs of set partitions
• Random permutations of countable sets
• Extended stirling family of discrete probability distributions
• Random permutations with cycle lengths in a given finite set

This page was built for publication: Random partition of a finite set by cycles of permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689906)