MS&E 337
Lecture #2 Notes
Information Networks
Spring 2010
Prof. Amin Saberi
Page 1 of 4
1. Preferential Attachment
The preferential attachment model was introduced by Barabsi and Albert to explain the
a
power-law degree distribution in complex real-world

Spectral Graph Theory
Lecture 6
Conductance, the Normalized Laplacian, and Cheegers Inequality
Daniel A. Spielman
6.1
September 17, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
writ

Spectral Graph Theory
Lecture 7
Fiedlers Theorems on Nodal Domains
Daniel A. Spielman
7.1
September 19, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say what I

Spectral Graph Theory
Lecture 11
PSRGs via Random Walks on Graphs
Daniel A. Spielman
11.1
October 3, 2012
Overview
There has been a lot of work on the design of Pseudo-Random Number Generators (PSRGs) that
can be proved to work for particular applications

Spectral Graph Theory
Lecture 8
Eective Resistance
Daniel A. Spielman
8.1
September 24, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say what I think I should s

Lecture 1
Spectral Graph Theory
Introduction
August 29, 2012
Daniel A. Spielman
1.1
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say what I think I should say. The n

Spectral Graph Theory
Lecture 5
Rings, Paths, and Paley Graphs
Daniel A. Spielman
5.1
September 12, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say what I thin

Spectral Graph Theory
Lecture 4
Bounding Eigenvalues
Daniel A. Spielman
4.1
September 10, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say what I think I should

Spectral Graph Theory
Lecture 3
The Adjacency Matrix and The nth Eigenvalue
Daniel A. Spielman
3.1
September 5, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say

Spectral Graph Theory
Lecture 2
The Laplacian
Daniel A. Spielman
2.1
August 31, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say what I think I should say. The

On the Spread of Viruses on the Internet
Noam Berger
Christian Borgs
Jennifer T. Chayes
Amin Saberi
Abstract
We analyze the contact process on random graphs generated according to the preferential attachment scheme as a model for the spread of viruses in

Complex networks and decentralized search algorithms
Jon Kleinberg
Abstract. The study of complex networks has emerged over the past several years as a theme spanning many disciplines, ranging from mathematics and computer science to the social and biolog

MS&E 337
Lecture #1 Notes
Information Networks
Spring 2010
Prof. Amin Saberi
Page 1 of 4
Before we start with the lecture, let us review two simple results in probability that will be
very useful in this and future lectures.
The rst one is Cherno bounds f

Spectral Graph Theory
Lecture 10
Random Walks on Graphs
Daniel A. Spielman
10.1
October 1, 2012
About these notes
These notes are not necessarily an accurate representation of what happened in class. The notes
written before class say what I think I shoul