A. Sah

activity

20242026

collaborators

6 papers

math.CO2026

A tight bound for affine-linearity, via universal ballot matrices

Apoorva Khare, Ashwin Sah

Based on work with Greenfeld and with Ziegler, Tao showed a concatenation result that if a map $f : F^{2} \to F$ is affine-linear on every line parallel to the coor…

math.PR2025

The limiting spectral law for sparse iid matrices

Ashwin Sah, Julian Sahasrabudhe, Mehtaab Sawhney

Let $A$ be an $n \times n$ matrix with iid entries where $A_{ij} \sim Ber (p)$ is a Bernoulli random variable with parameter $p = d / n$ . We show that the empirical measure of…

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…

math.PR2025

On the Spielman-Teng Conjecture

Ashwin Sah, Julian Sahasrabudhe, Mehtaab Sawhney

Let $M$ be an $n \times n$ matrix with iid subgaussian entries with mean $0$ and variance $1$ and let $I ¨ _{n} (M)$ denote the least singular value of $M$ . We prove that \[\mathbb{P}\bi…

math.PR2025

The sparse circular law, revisited

Ashwin Sah, Julian Sahasrabudhe, Mehtaab Sawhney

Let $A_{n}$ be an $n \times n$ matrix with iid entries distributed as Bernoulli random variables with parameter $p = p_{n}$ . Rudelson and Tikhomirov, in a beautiful and celebrated paper…

math.PR2024

Local limit theorem for joint subgraph counts

Ashwin Sah, Mehtaab Sawhney, Daniel G. Zhu

Extending a previous result of the first two authors, we prove a local limit theorem for the joint distribution of subgraph counts in the ErdÅs-RÃ©nyi random graph $G (n, p)$ . This…