Ashwin Sah

activity

20182026

most citedThe number of independent sets in an irregular graph

14 citations · 74 across the 54 of their papers we have counts for

collaborators

70 papers

math.PR2026

Majority dynamics on sparse random graphs

Gopal Goel, Ashwin Sah

Consider a simple undirected graph $G$ on $N$ vertices, with each vertex holding an opinion from one of two options. Starting from the initial opinions on day 1, we run majority dy…

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.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 li…

math.PR2024

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 $σ_{n} (M)$ denote the least singular value of $M$ . We prove that \[\mathbb{P}\big…

math.CO2024

Improved Bounds for Szemerédi's Theorem

James Leng, Ashwin Sah, Mehtaab Sawhney

Let $r_{k} (N)$ denote the size of the largest subset of $[N] = {1, \dots, N}$ with no $k$ -term arithmetic progression. We show that for $k \geq 5$ , there exists $c_{k} > 0$ such that \[r_…