Random Walks as a Stable Analogue of Eigenvectors with Applications to Nearly-Linear-Time Graph Partitioning

Lorenzo Orecchia
Massachusetts Institute of Technology
April 8, 2014
Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory...
Play     Slides

Efficient Solvers for Linear Systems in Graph Laplacians

Richard Peng
Massachusetts Institute of Technology
April 7, 2014
Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory...
Play     Abstract

On the Glass Ceiling Effect in Social Networks

Zvi Lotker
Ben Gurion University of the Negev
March 21, 2014
Stochastic Graph Models
Play     Slides

An Efficient reconciliation algorithm for social networks

Silvio Lattanzi
Google Inc.
March 21, 2014
Stochastic Graph Models
Play     Abstract     Slides

Randomly coloring random graphs

Alan Frieze
Carnegie Mellon University
March 21, 2014
Stochastic Graph Models
Play     Abstract

Similarity Ranking in Large-Scale Bipartite Graphs

Alessandro Epasto
Università di Roma "La Sapienza"
March 20, 2014
Stochastic Graph Models
Play     Abstract     Slides

Improved bounds and algorithms for graph cuts and network reliability

Aravind Srinivasan
University of Maryland
March 20, 2014
Stochastic Graph Models
Play     Abstract

Peeling Algorithms

Michael Mitzenmacher
Harvard University
March 19, 2014
Stochastic Graph Models
Play     Abstract

Elite, Periphery and Symmetry in Social Networks- An Axiomatic Approach

Chen Avin
Ben Gurion University of the Negev
March 18, 2014
Stochastic Graph Models
Play     Abstract     Slides