activity
20112026
most citedLimit shapes via bijections

7 citations · 26 across the 15 of their papers we have counts for

collaborators
Showing 2016Show all

5 papers · 1 filter

math.CO2016★ 7 cited

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…

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…

math.PR2016★ 3 cited

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…