activity
20112026
most citedLimit shapes via bijections

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

collaborators
Showing math.PRShow all

8 papers · 1 filter

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.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.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.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…