836 citations · 1.4k across the 37 of their papers we have counts for
40 papers
Large Growth Happens: Gaussian Elimination with Partial Pivoting on Random Matrices
Daniel A. Spielman, Xifan Yu
We prove that the probability that Gaussian elimination with partial pivoting on random matrices has growth is at least inverse quasi-polynomial: $Ω(\exp(-c \log^2…
Inequalities for rank-two permanents and finite free convolutions
Dmitriy Kunisky, Daniel A. Spielman, Xifan Yu
Bang (1976) proved the inequality for matrix permanents , where is the all-ones matrix and is any…
First Proof
Mohammed Abouzaid, Andrew J. Blumberg, Martin Hairer +8
To assess the ability of current AI systems to correctly answer research-level mathematics questions, we share a set of ten math questions which have arisen naturally in the resear…
Statistical inference of a ranked community in a directed graph
Dmitriy Kunisky, Daniel A. Spielman, Alexander S. Wein +1
We study the problem of detecting or recovering a planted ranked subgraph from a directed graph, an analog for directed graphs of the well-studied planted dense subgraph model. We…
Inference of rankings planted in random tournaments
Dmitriy Kunisky, Daniel A. Spielman, Xifan Yu
We consider the problem of inferring an unknown ranking of items from a random tournament on vertices whose edge directions are correlated with the ranking. We establish, i…
Robust and Practical Solution of Laplacian Equations by Approximate Elimination
Yuan Gao, Rasmus Kyng, Daniel A. Spielman
We introduce a new algorithm and software for solving linear equations in symmetric diagonally dominant matrices with non-positive off-diagonal entries (SDDM matrices), including L…