activity
20132023
most citedSingularity of random symmetric matrices -- a combinatorial approach to improved bounds

25 citations · 70 across the 30 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

math.PR2019★ 5 cited

Quantitative invertibility of random matrices: a combinatorial perspective

Vishesh Jain

We study the lower tail behavior of the least singular value of an random matrix , where is a fixed complex matrix with operator norm at most $\exp(n^…

cs.IT2019★ 3 cited

Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation

Vishesh Jain, Frederic Koehler, Jingbo Liu +1

The analysis of Belief Propagation and other algorithms for the {\em reconstruction problem} plays a key role in the analysis of community detection in inference on graphs, phyloge…

math.PR2019★ 2 cited

Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices

Vishesh Jain

An approximate Spielman-Teng theorem for the least singular value of a random square matrix is a statement of the following form: there exist constants…

math.CO2019

On the counting problem in inverse Littlewood--Offord theory

Asaf Ferber, Vishesh Jain, Kyle Luh +1

Let be i.i.d. Rademacher random variables taking values with probability each. Given an integer vector , its c…

math.CO2019★ 3 cited

Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs

Asaf Ferber, Vishesh Jain

In this note, we prove that there exists a universal constant such that for every and every , every -uniform hypergraph on vertice…

math.PR2019

The strong circular law: a combinatorial view

Vishesh Jain

Let be an complex random matrix, each of whose entries is an independent copy of a centered complex random variable with finite non-zero variance . The…