activity
20112026
most citedLimit shapes via bijections

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

collaborators

20 papers

math.PR2026

Stein's method for negative binomial and hyper-negative-binomial laws, with applications

Stephen DeSalvo

We develop Stein's method for the negative binomial law and for the hyper-negative-binomial law, the law of the smallest row total of an array of independent geometric variables gi…

math.PR2026

Two moments suffice for Bessel approximation: conditioned differences, contingency tables, and probabilistic divide-and-conquer

Stephen DeSalvo

We develop Stein's method, with explicit constants throughout, for the discrete Bessel distribution: the law of a Poisson variable given its difference from an independent Poisson…

math.HO2020★ 1 cited

Will the real Hardy-Ramanujan formula please stand up?

Stephen DeSalvo

The Hardy-Ramanujan formula for the number of integer partitions of is one of the most popular results in partition theory. While the unabridged final formula has been celebrat…

math.CO2018

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…

stat.CO2017

Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer

Stephen DeSalvo

We demonstrate a novel approach for the random sampling of Latin squares of order~ via probabilistic divide-and-conquer. The algorithm divides the entries of the table modulo po…

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…

math.PR2015

An Independent Process Approximation to Sparse Random Graphs with a Prescribed Number of Edges and Triangles

Stephen DeSalvo, M. Puck Rombach

We prove a - bound on the total variation distance between the uniform distribution over two types of undirected graphs with nodes. One distribution places a p…

math.CO2015★ 5 cited

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…

math.ST2015

Random Sampling of Contingency Tables via Probabilistic Divide-and-Conquer

Stephen DeSalvo, James Y. Zhao

We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced technique…

math.ST2015★ 1 cited

Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer

Stephen DeSalvo

We provide several algorithms for the exact, uniform random sampling of Latin squares and Sudoku matrices via probabilistic divide-and-conquer (PDC). Our approach divides the sampl…

math.PR2014

Probabilistic divide-and-conquer: deterministic second half

Stephen DeSalvo

We present a probabilistic divide-and-conquer (PDC) method for \emph{exact} sampling of conditional distributions of the form , where ${\…

math.CO2014★ 1 cited

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…

math.CO2013★ 2 cited

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…

math.PR2012

On the Random Sampling of Pairs, with Pedestrian examples

Richard Arratia, Stephen DeSalvo

Suppose one desires to randomly sample a pair of objects such as socks, hoping to get a matching pair. Even in the simplest situation for sampling, which is sampling with replaceme…

math.PR2011

Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example

Richard Arratia, Stephen DeSalvo

We propose a new method, probabilistic divide-and-conquer, for improving the success probability in rejection sampling. For the example of integer partitions, there is an ideal rec…

math.PR2011

On the singularity of random Bernoulli matrices - novel integer partitions and lower bound expansions

Richard Arratia, Stephen DeSalvo

We prove a lower bound expansion on the probability that a random matrix is singular, and conjecture that such expansions govern the actual probability of singularity. Thes…