7 citations · 26 across the 15 of their papers we have counts for
8 papers · 1 filter
Attacks and alignments: rooks, set partitions, and permutations
Richard Arratia, Stephen DeSalvo
We consider uniformly random set partitions of size with exactly blocks, and uniformly random permutations of size with exactly cycles, under the regime where $n-k…
Limit shapes via bijections
Stephen DeSalvo, Igor Pak
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 ut…
A robust quantitative local central limit theorem with applications to enumerative combinatorics and random combinatorial structures
Stephen DeSalvo, Georg Menz
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 comp…
The probability of avoiding consecutive patterns in the Mallows distribution
Harry Crane, Stephen DeSalvo, Sergi Elizalde
We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patte…
Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method
Stephen DeSalvo
We demonstrate an approach for exact sampling of certain discrete combinatorial distributions, which is a hybrid of exact Boltzmann sampling and the recursive method, using probabi…
Pattern Avoidance for Random Permutations
Harry Crane, Stephen DeSalvo
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation dista…
Completely effective error bounds for Stirling Numbers of the first and second kind via Poisson Approximation
Richard Arratia, Stephen DeSalvo
We provide completely effective error estimates for Stirling numbers of the first and second kind, denoted by and , respectively. These bounds are useful for value…
Log-Concavity of the Partition Function
Stephen DeSalvo, Igor Pak
We prove that the partition function is log-concave for all . We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's e…