Lugo, Michael T
Email Address
ORCID
Disciplines
Search Results
Now showing 1 - 1 of 1
Publication Profiles of Large Combinatorial Structures(2010-05-01) Lugo, Michael TWe derive limit laws for random combinatorial structures using singularity analysis of generating functions. We begin with a study of the Boltzmann samplers of Flajolet and collaborators, a useful method for generating large discrete structures at random which is useful both for providing intuition and conjecture and as a possible proof technique. We then apply generating functions and Boltzmann samplers to three main classes of objects: permutations with weighted cycles, involutions, and integer partitions. Random permutations in which each cycle carries a multiplicative weight $\sigma$ have probability $(1-\gamma)^\sigma$ of having a random element be in a cycle of length longer than $\gamma n$; this limit law also holds for cycles carrying multiplicative weights depending on their length and averaging $\sigma$. Such permutations have number of cycles asymptotically normally distributed with mean and variance $\sim \sigma \log n$. For permutations with weights $\sigma_k = 1/k$ or $\sigma_k = k$, other limit laws are found; the prior have finitely many cycles in expectation, the latter around $\sqrt{n}$. Compositions of uniformly chosen involutions of $[n]$, on the other hand, have about $\sqrt{n}$ cycles on average. These can be modeled as modified 2-regular graphs. A composition of two random involutions in $S_n$ typically has about $n^{1/2}$ cycles, characteristically of length $n^{1/2}$. The number of factorizations of a random permutation into two involutions appears to be asymptotically lognormally distributed, which we prove for a closely related probabilistic model. We also consider connections to pattern avoidance, in particular to the distribution of the number of inversions in involutions. Last, we consider integer partitions. Various results on the shape of random partitions are simple to prove in the Boltzmann model. We give a (conjecturally tight) asymptotic bound on the number of partitions $p_M(n)$ in which all part multiplicities lie in some fixed set $n$, and explore when that asymptotic form satisfies $\log p_M(n) \sim \pi\sqrt{Cn}$ for rational $C$. Finally we give probabilistic interpretations of various pairs of partition identities and study the Boltzmann model of a family of random objects interpolating between partitions and overpartitions.