Educational Workshop in the framework of
Phenomena in High Dimensions Marie Curie Research Training Network.

Today random methods, ("random and semi-random constructions") the investigation of typical random structures or (more recently) quasi-random structures are in the forefront of modern combinatorics. Systematic application of random methods in combinatorics came originally from Paul Erdõs. In the early 70's the investigation of typical random structures became an important field in combinatorics and graph theory. Approximating any structure by random-looking structures, e.g. via the Szemerédi Regularity lemma became one of the most powerful methods in combinatorics. This and many connections to Theoretical Computer Science (random codes, already in Shannon's codes, looking for constructively given Ramsey graphs, use of expanders, etc) led also to an extensive theory of quasi-random structures. (Pseudo-random numbers are extremely important in computer science, e.g., in Monte Carlo methods. However, our main topics are related to structures like graphs, hypergraphs, integers,... )

Organizers

Miklós Simonovits
Imre Bárány
Zoltán Füredi
Károly Böröczky, Jr.

Keynote speakers

Plenary lectures will be 50 minutes long, other talks 25-30 minutes long.

Béla Bollobás
Christian Borgs
Jennifer Chayes
Alan Frieze
Yoshi Kohayakawa
Michael Krivelevich
László Lovász
Vojtech Rodl
Imre Z. Ruzsa
Asaf Shapira
Angelika Steger
Balázs Szegedy
Endre Szemerédi

Contact

Mailing address: Reáltanoda u. 13-15, Budapest 1053 Hungary

Fax: +36 1 4838333

e-mail: phenomen_at_renyi_dot_hu