Random set partitions: Asymptotics of subset counts

DOI10.1006/JCTA.1997.2791zbMATH Open0895.60008OpenAlexW2343552869MaRDI QIDQ1364237FDOQ1364237

Authors: Boris Pittel 

Publication date: 8 September 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/378408c04d2ab8d957c00f10813acb05623a1f7e

Recommendations

• Random partitions with restricted part sizes
• Random partitions of a set with given number of blocks
• Asymptotics of random partitions of a set
• Part sizes of random integer partitions
• A convergence theorem for symmetric functionals of random partitions

zbMATH Keywords

integral functionalsrandom partitionBrownian bridge processsubset counts for the uniformly random partition

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Stirling Behavior is Asymptotically Normal
• The Number of Partitions of a Set
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ordered Cycle Lengths in a Random Permutation
• On a likely shape of the random Ferrers diagram
• Independent process approximations for random combinatorial structures
• Title not available (Why is that?)
• The Structure of Random Partitions of Large Integers
• Gap‐Free Set Partitions
• Title not available (Why is that?)
• Random Partitions of Sets
• On the number of distinct block sizes in partitions of a set
• Large antichains in the partition lattice
• Counting subsets of the random partition and the 'Brownian bridge' process

Cited In (21)

• Random Set Partitions
• Random preorders and alignments
• Probabilistic divide-and-conquer: deterministic second half
• Title not available (Why is that?)
• Random partitions of a set with given number of blocks
• Convergence in distribution for subset counts between random sets
• Properties of the structure of random partitions of a finite set in parametric model;Свойства структуры случайных разбиений конечного множества в параметрической модели
• Rado Partition Theorem for Random Subsets of Integers
• Size of the largest cluster under zero-range invariant measures
• Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
• Where the typical set partitions meet and join
• On comparability of bigrassmannian permutations
• Random combinatorial structures: the convergent case
• Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
• The size of the largest antichain in the partition lattice
• Random perfect graphs
• Set partition asymptotics and a conjecture of Gould and Quaintance
• Random partitions with parts in the range of a polynomial
• How often are two permutations comparable?
• Asymptotics of random partitions of a set
• Erratum to ``Limiting distributions for the number of distinct component sizes in relational structures

This page was built for publication: Random set partitions: Asymptotics of subset counts

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