The reading list of MATH 261
Topics in Probabilistic Combinatorics and Algorithms
Spring, 2010
Useful papers for reading:
-
M. Rudelson and R. Vershynin,
Sampling from Large Matrices: An Approach through
Geometric Functional Analysis, JACM 2007.
-
Assaf Naor's ICM paper on the connection between L_1 embeddings and the sparsest cut problem.
-
R. Aharoni, E. Berger and R. Meshulam, Eigenvalues and homology of flag complexes and vector representations of graphs, GAFA, Geom. Funct. Anal. 15 (2005), 555--566.
References:
-
Amy N. Langville and Carl D. Meyer, Deeper Inside PageRank, Internet Mathematics Vol. 1, No. 3: 335-380.
-
J. Kleinberg, Authoritative sources in a hyperlinked environment,
Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998;
later appeared in JACM 46, (1999), 604--632.
-
Sergey Brin and Lawrence Page,
The anatomy of a large-scale
hypertextual Web search
engine, Computer Networks and ISDN Systems 30 (1998) 107--117.
-
Larry Page,
Sergey Brin,
R. Motwani and
T. Winograd,
The PageRank Citation Ranking: Bringing Order to the Web, Proceedings of
ASIS'98, 1998. Also, as a Stanford Tech Report.