prikaz prve stranice dokumenta Kompleksne mreže i slučajni grafovi
Access restricted to students and staff of home institution
master's thesis
Kompleksne mreže i slučajni grafovi
Split: University of Split, University of Split, Faculty of science, 2017. urn:nbn:hr:166:010458
Čondić, Marija
University of Split
Faculty of Science
Department of Mathematics

Institutional repository: Repository of Faculty of Science

Cite this document

Čondić, M. (2017). Kompleksne mreže i slučajni grafovi (Master's thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:010458

Čondić, Marija. "Kompleksne mreže i slučajni grafovi." Master's thesis, University of Split, Faculty of Science, 2017. https://urn.nsk.hr/urn:nbn:hr:166:010458

Čondić, Marija. "Kompleksne mreže i slučajni grafovi." Master's thesis, University of Split, Faculty of Science, 2017. https://urn.nsk.hr/urn:nbn:hr:166:010458

Čondić, M. (2017). 'Kompleksne mreže i slučajni grafovi', Master's thesis, University of Split, Faculty of Science, accessed 02 December 2024, https://urn.nsk.hr/urn:nbn:hr:166:010458

Čondić M. Kompleksne mreže i slučajni grafovi [Master's thesis]. Split: University of Split, Faculty of Science; 2017 [cited 2024 December 02] Available at: https://urn.nsk.hr/urn:nbn:hr:166:010458

M. Čondić, "Kompleksne mreže i slučajni grafovi", Master's thesis, University of Split, Faculty of Science, Split, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:166:010458

Metadata
TitleKompleksne mreže i slučajni grafovi
Title (english)Complex networks and random graphs
AuthorMarija Čondić
MentorDamir Vukičević (mentor)
Committee memberDamir Vukičević (predsjednik povjerenstva)
Committee memberTanja Vojković (član povjerenstva)
Committee memberJelena Pleština (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Mathematics)
Split
Defense date and country2017-08-31, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
Cilj ovog rada bio je predstaviti Erdos-Renyi-ev model slučajnog grafa. Za obraditi taj model, prvo je obrađen proces grananja - nađena je veza preživljavanja i izumiranja u procesu grananja i izvedeni su dokazi za binomni i Poissonov proces grananja. Nakon toga, uveden je pojam Erdos-Renyi-evog slučajnog grafa i nađena je njegova veza sa Poissonovim procesom grananja. Pronađene su ograde za veličinu clustera, a posebno je promatran graf u subkritičnom području, i za taj slučaj nađena je granica najveće povezane komponente. Za kraj je predstavljeno još nekoliko modela slučajnih grafova i njihove primjene.
Abstract (english)
We represent Erdos-Renyi random graph in this master’s thesis. Firstly, we represent branching process - relation between survival and extinction is found and proofs for binomial and Poisson branching processes are given. Secondly, we introduce term Erdos-Renyi random graph and we related it with Poisson branching process. We found restrictions for cluster size and we especially studied graph in subcritical regime - in this case we found a bound for maxi mal cluster. In the end, we represent few different models od random graphs and its applications.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:010458
Study programmeTitle: Mathematics; specializations in: major in pure mathematics, major in computing, major in teaching
Course: major in computing
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2018-05-18 15:10:20