The project started on May 01, 2015.The need to understand the behavior of real-life networks made it necessary to work out non-standard graph theoretic tools capable of dealing with a large number of interacting nodes. New mathematical areas emerged, such as graph convergence or parallel algorithms.
The project aims at the study of the spectral aspects of these areas. The research is built around two core problems that grew out of and are natural continuations of Harangi's previous work in spectral graph theory at the University of Toronto. One is a spectral version of the so-called soficity problem, a major open question in the area of Benjamini-Schramm convergence.
The other is an ambitious conjecture of Harangi and Balint Virag concerning eigenvectors of random regular graphs, stating that these eigenvectors converge to Gaussian wave functions.
In the past few years the Renyi Institute has become the European center for studying graph convergence with several experts of the field working there as well as many talented and motivated graduate students and postdoctoral fellows. Being a member of this research group allows Harangi to collaborate with researchers from various different mathematical disciplines. The research topic is at the meeting point of these areas. The host's expertise in groups and graph limits complements Harangi's analytic skills. The grant gives Harangi an excellent opportunity to work with some of the top researchers in his field and to acquire the necessary tools to crack the exciting research problems proposed.