Aybars-log

October 28 I have found three papers on some old version of the 'racial neighborhood segregation' cellular automaton. I will read these papers and for tomorrow will try to add some probabilistic features to my Netlogo simulation.

October 29 Today, I met with Jim, and we talked about the possible extensions we can do to the automaton. I told Jim that I am going to finish adding the probabilistic features in the next few days. We also looked at the papers I was talking about and did not necessarily find any new magnificent implementation ideas about them. Still, it seems that those papers are going to be useful for the paper.

October 30 Today I finished adding probabilities to my simulator. So here are the news: About 2/3 of the time, the patch color stays the same. Of the other 1/3, what color the patch will become depends on the colors of the neighbors (the color of the patch itself not included) and there always is a 1/17 (which is about 6%) chance that it will randomly selected (1/3 chance for each color).

I also made the colors probabilistic, where now blues and greens are majorities (equally likely), where the reds are minorities (only about 1/11 of the population initially are reds). One thing that helps reds catch up is the mechanism explained above, where the probability of a red emerging is the same.

Now I am thinking that maybe we should make two different versions of this simulator, so that we can compare: 1- One or two gossips/superstitions/religions/beliefs/whatever we call it come about, and people tend to believe and tell more depending on how many times they heard each one. 2- Same thing, but this time there is also lingual fractionalization. So greens and blues can speak only their own languages, while the reds are the bilingual minorities.