Phase transitions in random graphs and random graph processes

点击翻译按钮获取中文摘要

Combinatorial structures have been extensively studied during the last few decades and have become one of the central themes of contemporary mathematics. The study of random graphs in particular has brought together different fields such as discrete mathematics, probability theory, theoretical computer science and statistical physics. The objectives of this project are to study the phase transitions in random graphs and random graph processes with constraints such as degree distribution, forbidden substructures, genus. The phase transition is a phenomenon observed in many fundamental problems from statistical physics, mathematics and theoretical computer science, including Potts models, graph colourings and satisfiability problem. The phase transition observed in the plethora of different random graph models refers to a phenomenon that there is a critical value of edge density such that adding a small number of edges around the critical value results in a dramatic change in the size of the largest components. It is our aim to further develop and apply new analytic approaches combined with counting and probabilistic methods, e.g. singularity analysis, differential equations method, to the study of the phase transitions in random graphs and random graph processes.