Thesis supervisor: István Fazekas
Location of studies (in Hungarian): Debreceni Egyetem Informatikai Kar Abbreviation of location of studies: DE IK
Description of the research topic:
Random graphs as models of networks. Finding new random graph models. Obtaining new properties of existing random graph models. Evolution of random graphs. Asymptotic properties of random graphs. Clusters, diameter, giant component, scale-free property, small word. Mathematical tools: branching processes, martingales. Computer simulations.
Bibliography
Durrett, R.: Random graph dynamics. Cambridge University Press, Cambridge, 2010.
Bollobás, B.: Random graphs. Cambridge University Press, Cambridge, 2001.
Fazekas, I., Porvázsnyik, B.: Scale-free property for degrees and weights in a preferential attachment random graph model. Journal of Probability and Statistics, Article ID 707960, 2013.
Janson, S.; Łuczak, T.; Rucinski, A.: Random graphs. Wiley-Interscience, New York, 2000.
Remco van der Hofstad: Random Graphs and Complex Networks. Eindhoven University of Technology, 2009.
Móri, T.F.: Degree distribution nearby the origin of a preferential attachment graph. Elect. Comm. in Probab. 12 (2007), 276-282.
Recommended language skills (in Hungarian): angol Number of students who can be accepted: 1
Deadline for application: 2018-02-16
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Login
