V. Vu

most citedRandom symmetric matrices are almost surely non-singular

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

collaborators

5 papers

math.NT2005★ 4 cited

Olson's theorem for cyclic groups

V. Vu

Let $n$ be a large number. A subset $A$ of $Z_{n}$ is complete if $S_{A} = Z_{n}$ , where $S_{A}$ is the collection of the subset sums of $A$ . Olson proved that if $n$ is a prime and $|A|>…

math.PR2005★ 9 cited

Random symmetric matrices are almost surely non-singular

Kevin Costello, Terence Tao, Van Vu

Let $Q_{n}$ denote a random symmetric $n$ by $n$ 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 $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, de…

math-ph2000

On the concentration of eigenvalues of random symmetric matrices

Michael Krivelevich, Van H. Vu

We prove that few largest (and most important) eigenvalues of random symmetric matrices of various kinds are very strongly concentrated. This strong concentration enables us to com…

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…