Margalit Glasgow

activity

20202026

most citedApproximate Gradient Coding with Optimal Decoding

15 citations · 30 across the 16 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2024

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…

math.CO2023

The Exact Rank of Sparse Random Graphs

Margalit Glasgow, Matthew Kwan, Ashwin Sah +1

Two landmark results in combinatorial random matrix theory, due to Komlós and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typical…

math.CO2021★ 1 cited

Invertibility of the 3-core of Erdos Renyi Graphs with Growing Degree

Margalit Glasgow

Let $A \in R^{n \times n}$ be the adjacency matrix of an Erdős Rényi graph $G (n, d / n)$ for $d = ω (1)$ and $d \leq 3 lo g (n)$ . We show that as $n$ goes to infinity, with pro…

math.CO2021

On the Rank, Kernel, and Core of Sparse Random Graphs

Patrick DeMichele, Margalit Glasgow, Alexander Moreira

We study the rank of the adjacency matrix $A$ of a random Erdos Renyi graph $G \sim G (n, p)$ . It is well known that when $p = (lo g (n) - ω (1)) / n$ , with high probability, $A$ …