Kevin P. Costello

Random symmetric matrices are almost surely nonsingular

Let

Concentration of Random Determinants and Permanent Estimators

Q_n

Stochastic matching with commitment

denote a random symmetric

Finding Patterns Avoiding Many Monochromatic Constellations

n

On the rank of random sparse matrices

by

Information Gathering in Ad-Hoc Radio Networks with Tree Topology

n

Faster Information Gathering in Ad-Hoc Radio Tree Networks

matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that

Information gathering in ad-hoc radio networks with tree topology

Q_n

The rank of random graphs

is non-singular with probability

Bilinear and quadratic variants on the Littlewood-Offord problem

1-O(n^{-1/8+\delta})