7 citations · 26 across the 15 of their papers we have counts for
5 papers · 1 filter
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…
Poisson and independent process approximation for random combinatorial structures with a given number of components, and near-universal behavior for low rank assemblies
Richard Arratia, Stephen DeSalvo
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number of components is specified, in addition to the…