7 citations · 26 across the 15 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…