14281

12918

كارشناسي ارشد

ماده چگال

اصفهان : دانشگاه صنعتي اصفهان

1397

يازده، ۳۶ص.: مصور، جدول

كيوان آقابابايي ساماني، مجتبي اعلايي

ممتحن مدعو: وحيد سالاري; ممتحن داخلي: فرهاد شهبازي

1397/11/08

كتابنامه

فيزيك

فيزيك

1397/11/15

ID12918

Moran process on Lattices Mahnaz Soleymani Asl m soleymaniasl@ph iut ac ir 2019 01 16 Department of Physics Isfahan University of Technology Isfahan 84156 83111 Iran University Code IUT 77142 Degree M S c Language Farsi supervisor Dr Keivan Aghababaei Samani samani@cc iut ac ir Abstract The world around us is constantly growing and changing We use evolutionary dynamics to investigate and answer the questions about these developments Examined species can be seen in the smallest sizes such as molecules cells bacteria and viruses to the largest extent such as the collective life of animals and human activities including organizations and organs One of the methods of dynamic simulation study In this way a graph corresponding to the population is selected and the members of that population are placed in each vertex of the graph and connected to each other by the connection between the members There are many questions in this area of science The most important is the probability of stabilization or the probability of extinction and the mean of time to stabilize for a leaked species In such cases in a crowd with time one member jumps and randomly chooses a member of the primary population for extinction and replaces his baby After a period of time this mutated species can capture the entire population and stabilize it Due to some external and internal factors on the network the mutated species may be destroyed and in general extinct In this case the network will remain with the same basic species In this study we examine the moron model for a mutant species in three networks with different dimensions The cycle graph is in one dimension a square grid in two dimensions and a cube network in three dimensions The fitting of the stationary neutral species in each network is equal to 1 and the fit of the mutated species is r Here a member jumps randomly and accidentally chooses one of her neighbors and replaces her baby With the help of computer simulations how to join the graph members to the jumpers population calculate the average stabilization time and the probability of stabilization and compare them for all three networks The results obtained from the simulations show that depending on the number of vertices and their relationship with each other the probabil ity of stabilization and the average time to achieve stabilization are very different Keywords Evolution evolutionary dynamics graph mutated network

كيوان آقابابايي ساماني، مجتبي اعلايي

ممتحن مدعو: وحيد سالاري; ممتحن داخلي: فرهاد شهبازي