Markov chains and voting protocols

A tétel rövid nézete
dc.contributor.advisorPongrácz, András
dc.contributor.authorKapesa, Siamini Said
dc.contributor.departmentDE--Természettudományi és Technológiai Kar--Biológiai és Ökológiai Intézethu_HU
dc.date.accessioned2020-05-07T08:54:33Z
dc.date.available2020-05-07T08:54:33Z
dc.date.created2020-05-07
dc.description.abstractA fundamental concept in the study of Markov chains and voting protocols is the notion of consensus. Therefore in this work, we answered two main questions which are the winning probability and the consensus time (expected number of rounds to win). We applied voting protocols on finite graphs since graphs are simple models of the environment in which individual entities interact. In these processes vertices of a given graph have opinions such that by interacting with neighbors they change their opinions. And we say that a process reaches consensus if all vertices reach the state where they share the same opinion, and such opinion never changes again.hu_HU
dc.description.correctorgj
dc.description.courseApplied Mathematicshu_HU
dc.description.degreeMSc/MAhu_HU
dc.format.extent43hu_HU
dc.identifier.urihttp://hdl.handle.net/2437/286016
dc.language.isoen_UShu_HU
dc.subjectVoting modelshu_HU
dc.subjectMarkov chains
dc.subject.dspaceDEENK Témalista::Matematikahu_HU
dc.titleMarkov chains and voting protocolshu_HU
Fájlok
Gyűjtemények
Hallgatói dolgozatok (Matematikai Intézet)