most citedRandom symmetric matrices are almost surely non-singular

9 citations · 13 across the 3 of their papers we have counts for

collaborators
Showing math.PRShow all

3 papers · 1 filter

math.PR2005★ 9 cited

Random symmetric matrices are almost surely non-singular

Kevin Costello, Terence Tao, Van Vu

Let denote a random symmetric by matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove…

math.PR2005

Central limit theorems for random polytopes in a smooth convex set

Van Vu

Let be a smooth convex set with volume one in $\BBR^d$. Choose random points in independently according to the uniform distribution. The convex hull of these points, de…

math.PR2000

The cover time, the blanket time, and the Matthews bound

J. Kahn, J. H. Kim, L. Lovasz +1

The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time t…