|
2016-present
2011-2015
2006-2010
Back to top
2001-2005
Back to top
-
A spectral Turán theorem,
Combinatorics, Probability and Computing 14 (2005), 755--767.
-
Coupling online and offline analyses for random power law graphs,
Internet Mathematics, 1 (2004), 409--461,
(with Lincoln Lu).
-
Discrete isoperimetric inequalities,
Surveys in Differential Geometry IX, International Press, (2004), 53--82.
-
The small world phenomenon in hybrid power law graphs,
Complex Networks, (Eds. E. Ben-Naim et. al.), Springer-Verlag, (2004), 89--104,
(with Lincoln Lu).
-
Generalizations of Polya's urn problem,
Annals of Combinatorics 7 (2003), 141--153,
(with Shirin Handjani and Doug Jungreis).
- Finding Favorites,
Electronic Colloquium on Computational Complexity, Report No. 78 (2003),
(with Ron Graham, Jia Mao and Andrew Yao).
-
Eigenvalues of random power law graphs,
Annals of Combinatorics 7 (2003), 21--33,
(with Lincoln Lu and Van Vu).
-
The spectra of random graphs with given expected degrees,
short version,
Proceedings of National Academy of Sciences 100, no. 11, (2003), 6313--6318,
long version
(with full proofs) Internet Mathematics 1 (2004), 257--275,
(with Lincoln Lu and Van Vu).
-
Duplication models for biological networks,
Journal of Computational Biology 10, no. 5, (2003), 677--688,
(with Lincoln Lu, Gregory Dewey, David J. Galas).
-
The average distances in random graphs with given expected degrees,
abstract,
paper (short version),
Proc. National Academy of Sciences 99, no. 25, (December, 2002), 15879--15882,
paper (long version)
,
Internet Mathematics 1 (2003), 91--113,
(with L. Lu).
-
Sparse quasi-random graphs,
abstract,
Combinatorica 22 (2002), 217--244,
(with Ronald Graham)
-
Connected components in random graphs with given expected degree sequences,
abstract,
Annals of Combinatorics 6 (2002), 125-145,
(with L. Lu).
-
Random evolution of massive graphs,
abstract,
Handbook of Massive Data Sets, (Eds. James Abello et al.), Kluwer Academic
Publishers, (2002), 97--122,
extended abstract appeared in FOCS 2001, 510--519,
(with W. Aiello and L. Lu).
-
On sparse sets hitting linear forms,
abstract,
Number Theory for the Millennium I,
(Eds. M. A. Bennett et al.), AK Peters, Natick, Massachusetts, (2002), 257--272.
(with Paul Erdös and Ronald Graham)
-
Distance realization problems with applications to Internet tomography,
J. Computer and System Sciences 63 No. 3, (November 2001), 432--448,
(with Mark Garrett, Ronald Graham and David Shallcross).
-
The diameter of sparse random graphs,
abstract,
Advances in Applied Math. 26 (2001), 257--279,
(with Linyuan Lu).
1996-2000
Back to top
-
A random graph model for massive graphs,
abstract,
Proceedings of the
Thirtysecond Annual ACM Symposium on Theory of Computing
(2000),
171--180,
(with Bill Aiello and Linyuan Lu).
The complete paper version
has a different title
A random graph model for power law graphs,
Experimental Math. 10 (2001), 53--66.
-
A combinatorial trace formula,
Tsing Hua Lectures on Geometry and Analysis,
International Press, Cambridge, Massachusetts, 1997, 107--116,
(with S.-T. Yau)
-
Eigenvalues and diameters for manifolds and graphs,
Tsing Hua Lectures on Geometry and Analysis,
International Press, Cambridge, Massachusetts, 1997, 79--106,
(with A. Grigor'yan and S.-T. Yau).
1991-1995
Back to top
1986-1990
Back to top
1981-1985
Back to top
1975-1980
Back to top
1973-1975
Back to top
|