Summer Reading Seminar 2008

Organizers: Shoaib Jamall and Eve Lipton.

Time: Tuesdays, 4PM, except Monday, 7/7, and Monday, 8/25, 4PM

Place: AP&M 7421

Date	Speaker	Paper
6/17/2008		Organizational Meeting
7/1/2008	E. Lipton	Ball, "Markov chains, Riesz transforms and Lipschitz maps."
7/7/2008 Monday	M. S. Jamall	Bollobas, "Mathematical results on scale-free random graphs."
7/22/2008	Mary Radcliffe	Bradonjic, Hagberg, and Percus, " Giant component and connectivity in geographical threshold graphs."
8/5/2008	Du, Peng	Hopcroft and Sheldon, "Manipulation resistant reputations using hitting time."
8/12/2008	Paul Horn	Bohman, "The triangle-free process."
8/25/2008 MONDAY	Wenbo Zhao	Spielman and Srivastava, "Graph sparsification by effective resistances."

Here are some possible papers. If you have an interest in presenting one of them, please contact either Shoaib or Eve. The primary resource was last December's WINE conference; if you would like to look through all of the topics, please contact Shoaib.

Ackermann, Goldberg, Mirrokni, Roglin, and Vocking, "A unified approach to congestion games and 2-sided markets."
Demange, "Information Sharing Communities."
Fotakis and Spirakis, "Cost-balancing tolls for atomic network congestion games."
Arcaute, Johari, and Mannor, "Network formation: Bilateral contracting and myopic dynamics."
Even-Dar and Shapira, "A note on maximizing the spread of influence in social networks."
Brandt and Fischer, "PageRank as a weak tournament solution."
Bharathi, Kempe, and Salek, "Competitive influence maximization in social networks."
Gairing and Schoppmann, "Total latency in singleton congestion games."
Corbo, Calvo-Armengol, and Parkes, "The importance of network topology in local contribution games."
Fang and Kong, "Core stability of vertex cover games."
Flaxman, Frieze, and Vera, "A geometric preferential attachment model of networks II."
Aiello, Bonato, Cooper, Janssen, and Pralat, "A spatial web graph model with local influence regions."
Young and Scheinerman, "Random dot product graph models for social networks."
Sami Assaf has a number of papers, including "A combinatorial proof of LLT and Macdonald positivity," and "A combinatorial realization of Schur-Weyl duality via crystal graphs and dual equivalence graphs."

If there are other papers which you think will be good for learning new combinatorics, further suggestions are welcome.

Links:
The entire book from the WINE converence can be found here, but you may need to be logged in to the UCSD network for access.
You might find useful information on the website for Fan's 261C class this spring. Also, you can check the Regularity Lemma notes - From Fall 2004 262 class, which are potentially useful reference for some papers.