4 papers
On random matrices with large corank
Zach Hunter, Matthew Kwan, Lisa Sauermann +1
Let and be a random matrix with independent uniformly random -entries. We show that there exists an absolute constant such that \[\…
Parities in random Latin squares
Matthew Kwan, Kalina Petrova, Mehtaab Sawhney
In a Latin square, every row can be interpreted as a permutation, and therefore has a parity (even or odd). We prove that in a uniformly random Latin square, the ro…
A central limit theorem for the matching number of a sparse random graph
Margalit Glasgow, Matthew Kwan, Ashwin Sah +1
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erdős-Rényi random graph, in an influential paper pioneering the so-called differential e…
The inertia bound is far from tight
Matthew Kwan, Yuval Wigderson
The inertia bound and ratio bound (also known as the Cvetković bound and Hoffman bound) are two fundamental inequalities in spectral graph theory, giving upper bounds on the indepe…