Random discrete structures have been extensively studied during the last few decades and have become one of the central themes of contemporary mathematics. The most important and popular example of random discrete structures is random graphs. Since the seminal work of Erdos and Renyi on the standard random graph, various random graph models are introduced and studied. The intense study of random graphs and random graph processes has brought together different fields such as discrete mathematics, probability theory, theoretical computer science and statistical physics. Our research is centered around phase transitions in random graphs and random graph processes with constraints (e.g. degree, genus, forbidden minors).
|Effective start/end date||1/01/12 → …|
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.