prikaz prve stranice dokumenta Slučajni Cayleyevi grafovi
  Download
PDF 1.07 MB
master's thesis
Slučajni Cayleyevi grafovi
Zagreb: University of Zagreb, Faculty of Science, 2023. urn:nbn:hr:217:545134
Mihovilić, Lugo
University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

Mihovilić, L. (2023). Slučajni Cayleyevi grafovi (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:545134

Mihovilić, Lugo. "Slučajni Cayleyevi grafovi." Master's thesis, University of Zagreb, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:217:545134

Mihovilić, Lugo. "Slučajni Cayleyevi grafovi." Master's thesis, University of Zagreb, Faculty of Science, 2023. https://urn.nsk.hr/urn:nbn:hr:217:545134

Mihovilić, L. (2023). 'Slučajni Cayleyevi grafovi', Master's thesis, University of Zagreb, Faculty of Science, accessed 03 November 2024, https://urn.nsk.hr/urn:nbn:hr:217:545134

Mihovilić L. Slučajni Cayleyevi grafovi [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2023 [cited 2024 November 03] Available at: https://urn.nsk.hr/urn:nbn:hr:217:545134

L. Mihovilić, "Slučajni Cayleyevi grafovi", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2023. Available at: https://urn.nsk.hr/urn:nbn:hr:217:545134

Metadata
TitleSlučajni Cayleyevi grafovi
AuthorLugo Mihovilić
MentorNina Kamčev (mentor)
MentorRudi Mrazović (mentor)
Committee memberRudi Mrazović (predsjednik povjerenstva)
Committee memberNina Kamčev (član povjerenstva)
Committee memberVjekoslav Kovač (član povjerenstva)
Committee memberIgor Ciganović (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2023-08-31, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
Cilj ovog rada je upoznati čitatelja s važnošću i raznim svojstvima ekspander grafova i slučajnih Cayleyevih grafova. Kroz prva poglavlja iznosimo i dokazujemo rezultate potrebne za glavni teorem ovog rada, Alon-Roichmanov teorem. Taj teorem omogućava nam konstrukciju slučajnih Cayleyevih grafova koju su s velikom vjerojatnosti ekspanderi. Za kraj, demonstriramo kako ekspander grafove možemo koristiti za smanjenje pogreške u nekim vjerojatnosnim algoritmima.
Abstract (english)
The focus of this thesis was to showcase the significance and remarkable properties of expander graphs, along with random Cayley graphs. In the initial chapters, we furnish the reader with all the necessary results to establish the central theorem of this thesis, namely, the Alon-Roichman theorem. This theorem provides us with an efficient tool for the successful generation of expander graphs. Afterwards, we elaborate on how expander graphs can be leveraged to minimize the quantity of random bits required in certain probabilistic algorithms.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:545134
Study programmeTitle: Mathematical Statistics
Study programme type: university
Study level: graduate
Academic / professional title: sveučilišni magistar matematike (sveučilišni magistar matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-02-14 10:33:25