Faculty Candidate Seminar
Structure and Randomness in Complex Systems
Shachar Lovett
Post Doc
Institute for Advanced Studies 


Monday, February 20, 2012
4:00pm  5:00pm 1690 Beyster Bldg.


About the EventComplicated systems arise naturally in many scenarios. For example, huge graphs or high dimensional data are part of many problems arising in real life and in theoretical models. In other cases, the problems are simple to describe, but the set of potential solutions is very complicated. I will describe a general approach to analyze and build algorithms for complicated systems. It is based, on the one hand, on finding important structures in these systems; and, on the other hand, on identification of randomlike properties that these objects possess. I will give several examples for the usefulness of this approach. 
BiographyShachar Lovett is a postdoc at the Institute for Advanced Study in Princeton, NJ. He is interested in the relations between structure, randomness and pseudorandomness in many areas of mathematics and computer science, and in particular in
computational complexity, additive combinatorics and coding theory. 
Additional Information
Contact: Cindy Estell
Phone: 46744
Email: cestell
Sponsor: CSE
Open to: Public


