Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
From MaRDI portal
Publication:950408
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuous-time Markov processes on discrete state spaces (60J27) Interacting particle systems in time-dependent statistical mechanics (82C22) Dynamic and nonequilibrium phase transitions (general) in statistical mechanics (82C26)
Abstract: We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the resulting version of the theorem to other two classis types of decomposable combinatorial structures, which are called assemblies and selections. The results obtained are based on combining Meinardus' analytical approach with probabilistic method of Khitchine.
Recommendations
- Limit theorems for the number of parts in a random weighted partition
- A spectral analogue of the Meinardus theorem on asymptotics of the number of partitions
- New weighted partition theorems with the emphasis on the smallest part of partitions
- scientific article; zbMATH DE number 5166045
- On the poset of weighted partitions
- On a Certain Weighted Partition Function
- A weighted version of the Erdős-Kac theorem
- Refining Jensen's integral inequality for partitions of weights
- The asymptotic number of weighted partitions with a given number of parts
- The Size of the Largest Part of Random Weighted Partitions of Large Integers
Cites work
- scientific article; zbMATH DE number 3146726 (Why is no real title available?)
- scientific article; zbMATH DE number 4068961 (Why is no real title available?)
- scientific article; zbMATH DE number 1231233 (Why is no real title available?)
- scientific article; zbMATH DE number 1557173 (Why is no real title available?)
- scientific article; zbMATH DE number 5067693 (Why is no real title available?)
- A General Asymptotic Formula for Partition Functions
- A century of complex Tauberian theory
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
- ASYMPTOTIC ENUMERATION AND LOGICAL LIMIT LAWS FOR EXPANSIVE MULTISETS AND SELECTIONS
- Asymptotic formula for a partition function of reversible coagulation-fragmentation processes
- Asymptotische Aussagen über Partitionen
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Gibbs distributions for random partitions generated by a fragmentation process
- Independent process approximations for random combinatorial structures
- Limit theorems for the number of summands in integer partitions
- Limits of logarithmic combinatorial structures.
- Partitions of \(n\) into \(t\sqrt n\) parts
- Random combinatorial structures: the convergent case
- Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups
- Statistical mechanics of combinatorial partitions, and their limit shapes
- The Riemann zeta-function. Transl. from the Russian by Neal Koblitz
Cited in
(20)- A short note on integral transformations and conversion formulas for sequence generating functions
- Limit shape of minimal difference partitions and fractional statistics
- Sampling part sizes of random integer partitions
- The asymptotic number of weighted partitions with a given number of parts
- scientific article; zbMATH DE number 5166045 (Why is no real title available?)
- The Size of the Largest Part of Random Weighted Partitions of Large Integers
- The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram
- Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration
- Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts
- Ergodicity of multiplicative statistics
- A unified treatment of families of partition functions
- Khinchin families and Hayman class
- Asymptotic enumeration by Khintchine-Meinardus probabilistic method: necessary and sufficient conditions for sub-exponential growth
- A polynomial variation of Meinardus' theorem
- Asymptotic enumeration and limit laws for multisets: the subexponential case
- Growing integer partitions with uniform marginals and the equivalence of partition ensembles
- A Meinardus theorem with multiple singularities
- Asymptotic analysis of expectations of plane partition statistics
- Limit shapes via bijections
- Super-polynomial accuracy of multidimensional randomized nets using the median-of-means
This page was built for publication: Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950408)