4 citations · 6 across the 3 of their papers we have counts for
3 papers
math.CO2016★ 4 cited
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…
math.CO2016★ 2 cited
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…
math.CO2016
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…