The Moran process is a model for simulating evolutionary dynamics. In that model, one mutant with higher fitness is introduced to a structured population. Evolution is simulated in rounds. In one round, individual is selected proportio- nally to its fitness and spreads to the place of a random neighbour. In this thesis, we motivate the Moran process, present basic results, and define our variant. We work in a vertex dependent model; every individual has fitness according to its type and occupied vertex. In the vertex dependent model we prove two theorems about the number of steps the process has to make to get to the stable state. We show that on the complete graph, the process takes only polynomially many steps and we find a graph where the process take exponentially many steps, but in the normal settings the number of steps is the same as on the complete graph. 1
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:397629 |
| Date | January 2019 |
| Creators | Svoboda, Jakub |
| Contributors | Šámal, Robert, Balko, Martin |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0019 seconds