#### Filter Results:

- Full text PDF available (70)

#### Publication Year

1996

2018

- This year (3)
- Last 5 years (15)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jeong Han Kim, Van H. Vu
- Combinatorica
- 2000

Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in tiâ€™s with positive coefficients. We give a condition which guarantees thatâ€¦ (More)

- Van H. Vu
- STOC
- 2005

In this paper, we present a new upper bound for the spectral norm of symmetric random matrices with independent (but not necessarily identical) entries. Our results improve an earlier result ofâ€¦ (More)

- Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
- Random Struct. Algorithms
- 2001

Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d-regular graph when d = d n growsâ€¦ (More)

- Van H. Vu
- Random Struct. Algorithms
- 2002

Strong concentration results play a fundamental role in probabilistic combinatorics and theoretical computer science. In this paper, we present several new concentration results developed recently byâ€¦ (More)

- Anders Johansson, Jeff Kahn, Van H. Vu
- Random Struct. Algorithms
- 2008

Let H be a fixed graph on v vertices. For an n-vertex graph G with n divisible by v, an H-factor of G is a collection of n/v copies of H whose vertex sets partition V (G). In this paper we considerâ€¦ (More)

- Peter Chin, Anup Rao, Van H. Vu
- ArXiv
- 2015

In this paper, we present and analyze a simple and robust spectral algorithm for the stochastic block model with k blocks, for any k fixed. Our algorithm works with graphs having constant edgeâ€¦ (More)

Let Ï‡1(n) denote the maximum possible absolute value of an entry of the inverse of an n by n invertible matrix with 0, 1 entries. It is proved that Ï‡1(n) = n 1 2. This solves a problem of Graham andâ€¦ (More)

- Jin Hong Kim, Van H. Vu
- 2002

The goal of this paper is to establish a connection between two classical models of random graphs: the random graph G(n, p) and the random regular graph Gd(n). This connection appears to be veryâ€¦ (More)

- Christian Borgs, Jennifer T. Chayes, +4 authors Van H. Vu
- FOCS
- 1999

We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice Z. We prove that under certain circumstances, the mixing timeâ€¦ (More)

- Van H. Vu
- 2008

We prove that key functionals (such as the volume and the number of vertices) of a random polytope is strongly concentrated, using a martingale method. As applications, we derive new estimates forâ€¦ (More)