3 papers
math.PR2025
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 \[\…
math.PR2025
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…
math.CO2025
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…