Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts

  title={Unified derivation of the limit shape for multiplicative ensembles of random integer partitions with equiweighted parts},
  author={Leonid V. Bogachev},
  journal={Random Structures \& Algorithms},
  • L. Bogachev
  • Published 14 November 2011
  • Mathematics
  • Random Structures & Algorithms
We derive the limit shape of Young diagrams, associated with growing integer partitions, with respect to multiplicative probability measures underpinned by the generating functions of the form ℱ(z)=∏ℓ=1∞ℱ0(zℓ) (which entails equal weighting among possible parts ℓ∈ℕ ). Under mild technical assumptions on the function H0(u)=ln(ℱ0(u)) , we show that the limit shape ω*(x) exists and is given by the equation y=γ−1H0(e−γx) , where γ2=∫01u−1H0(u) du . The wide class of partition measures covered by… 
The limit shape of random permutations with polynomially growing cycle weights
In this work we are considering the behaviour of the limit shape of Young diagrams associated to random permutations on the set {1, . . . , n} under a particular class of multiplicative measures with
A robust quantitative local central limit theorem with applications to enumerative combinatorics and random combinatorial structures
A useful heuristic in the understanding of large random combinatorial structures is the Arratia-Tavare principle, which describes an approximation to the joint distribution of component-sizes using
Limit Shape of Minimal Difference Partitions and Fractional Statistics
The class of minimal difference partitions $$\text {MDP}(q)$$ MDP ( q ) (with gap q ) is defined by the condition that successive parts in an integer partition differ from one another by at least
Limit Shapes via Bijections
We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain
Asymptotic enumeration by Khintchine–Meinardus probabilistic method: necessary and sufficient conditions for sub-exponential growth
In this paper, we prove the necessity of the main sufficient condition of Meinardus for sub-exponential rate of growth of the number of structures, having multiplicative generating functions of a
Summer projects 2014 – 2015 Hirsch ’ s Citation Index and Limit Shape of Random Partitions
Hirsch [3] introduced his h-index to measure the quality of a researcher’s output, defined as the largest integer n such that the person has n papers with at least n citations each. The h-index has
Asymptotic enumeration by Khintchine-Meinardus method: Necessary and sufficient conditions for sub exponential growth
In this paper we prove the necessity of the main sufficient condition of Meinardus for sub exponential rate of growth of the number of structures, having multiplicative generating functions of a
Finite set statistics on manifolds for space object tracking
This project aims to investigate how the imposition of probability distributions affects the logical structure ofCP-nets, investigate the effect of missing information on this structure, and develop a formal semantics for a much richer class of probabilistic CP-nets than is currently available.
Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method
  • S. Desalvo
  • Computer Science
    Electron. Notes Discret. Math.
  • 2017
An approach for exact sampling of certain discrete combinatorial distributions is demonstrated, which is a hybrid of exact Boltzmann sampling and the recursive method, using probabilistic divide-and-conquer (PDC).


The Limit Shape and Fluctuations of Random Partitions of Naturals with Fixed Number of Summands
We consider the uniform distribution on the set of partitions of integer n with c √ n numbers of summands, c > 0 is a positive constant. We calculate the limit shape of such partitions, assuming c is
On a Likely Shape of the Random Ferrers Diagram
We study the random partitions of a large integern, under the assumption that all such partitions are equally likely. We use Fristedt's conditioning device which connects the parts (summands)
Independent Process Approximations for Random Combinatorial Structures
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted
Logarithmic Combinatorial Structures: A Probabilistic Approach
The elements of many classical combinatorial structures can be naturally decomposed into components. Permutations can be decomposed into cycles, polynomials over a finite field into irreducible
Asymptotic analysis of random partitions ∗
In this paper we aim to review some works on the asymptotic behaviors of random partitions. The focus is upon two basic probability models— uniform partitions and Plancherel partitions. One of
Random partitions with restricted part sizes
The limiting density of the (suitably normalized) random variable Mn is determined for sets that are sufficiently regular for specific choices of Q to be covered.
Integer partitions and exclusion statistics: limit shapes and the largest parts of Young diagrams
We compute the limit shapes of the Young diagrams of the minimal difference p partitions and provide a simple physical interpretation for the limit shapes. We also calculate the asymptotic
Large deviations for integer partitions
We consider deviations from limit shape induced by uniformly distributed partitions (and strict partitions) of an integer n on the associated Young diagrams. We prove a full large deviation
Enumerative combinatorics
This review of 3 Enumerative Combinatorics, by Charalambos A.good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations.