IPAM Institute for Pure and Applied Mathematics UCLA NSF
Skip Navigation Links
Main Page
Program Poster PDF
Lodging & Air Travel
Public Lecture
Schedule and Presentations

Combinatorics: Methods and Applications in Mathematics and Computer Science

Workshop I: Probabilistic Techniques and Applications

October 5 - 9, 2009

Organizing Committee | Scientific Overview | Speaker List

Application/Registration | Contact Us

Organizing Committee

Alan Frieze (Carnegie-Mellon University, Mathematical Sciences)
Nathan (Nati) Linial (Hebrew University, Computer Science)
Angelika Steger (ETH Zürich)
Benjamin Sudakov (University of California, Los Angeles (UCLA))
Prasad Tetali (Georgia Institute of Technology)

Back to Top

Scientific Overview

One of the exciting phenomena in mathematics in recent years has been the wide-spread and surprisingly effective use of probabilistic methods in diverse areas. The probabilistic approach has been strikingly successful in Combinatorics, Graph Theory, Combinatorial Number Theory, Optimization and Theoretical Computer Science. This workshop will focus on several main research directions of Probabilistic Combinatorics, including the application of probability to solve combinatorial problems, the study of random combinatorial objects and the investigation of randomized algorithms.

Specific topics to be discussed will include: the application of probabilistic arguments to Ramsey and Turan-type problems and to graph colorings, the semi-random method, tools like the Local lemma, large deviation and correlation inequalities, the classical Erd\H{o}s-Renyi random graphs model and its variations, the investigation of various graph processes and hitting times, random regular graphs, models based on preferential attachment and real world networks, random subgraphs of given graphs and applications to various percolation models, the study of the random k-SAT problem and other random instances of computationally hard problem, applications of randomness to Computer Science, in particular to the design of efficient algorithms, derandomization and pseudo-randomness.

This workshop will include a poster session; a request for posters will be sent to registered participants in advance of the workshop.

Back to Top

Confirmed Speakers

Noga Alon (Tel Aviv University)
József Balogh (University of Illinois at Urbana-Champaign)
Tom Bohman (Carnegie-Mellon University)
Béla Bollobás (University of Cambridge)
Fan Chung-Graham (University of California, San Diego (UCSD))
Amin Coja-Oghlan (University of Edinburgh)
Artur Czumaj (University of Warwick)
Uriel Feige (Weizmann Institute of Science)
Alan Frieze (Carnegie-Mellon University)
David Gamarnik (Massachusetts Institute of Technology)
Jeff Kahn (Rutgers University)
Michael Krivelevich (Tel Aviv University)
Thomas Liggett (University of California, Los Angeles (UCLA))
Eyal Lubetzky (Microsoft Research)
Michael Molloy (University of Toronto)
Rob Morris (University of Cambridge)
Yuval Peres (Microsoft Research)
Sebastien Roch (University of California, Los Angeles (UCLA))
Alexander Scott (University of Oxford)
Angelika Steger (ETH Zürich)
Prasad Tetali (Georgia Institute of Technology)
Van Vu (Rutgers University)
Nick Wormald (University of Waterloo)

Back to Top

Contact Us:

Institute for Pure and Applied Mathematics (IPAM)
Attn: CMAWS1
460 Portola Plaza
Los Angeles CA 90095-7121
Phone: 310 825-4755
Fax: 310 825-4756
Email: ipam@ucla.edu
Website: http://www.ipam.ucla.edu/programs/cmaws1/

Back to Top

NSF Math Institutes   |   Webmaster