Pub Date : 2020-02-01DOI: 10.1017/9781108671644.007
Anup Rao, A. Yehudayoff
{"title":"Numbers on Foreheads","authors":"Anup Rao, A. Yehudayoff","doi":"10.1017/9781108671644.007","DOIUrl":"https://doi.org/10.1017/9781108671644.007","url":null,"abstract":"","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-31DOI: 10.1017/9781108671644.014
H. Bingol
It is a fact that there are many web pages for one to know all. Similarly there are many songs than we can keep in our mp3 players. It is not very difficult to increase examples of "too many itemstoo little memory" cases. We try to model the case where the memory is too small to keep all the items. We consider agents with a limited memory of size m. We let them interact by means of recommending web pages among the ones that they know. The giver agent "remembers" an item that is stored in its memory. The giver recommends the item to the taker agent. Since the taker does not have empty space in its memory, it "forgets" something and uses the emptied slot for the item recommended. We surprisingly observed that this process leads to many items become completely forgotten by the society while a few of them become extremely well known as the ratio of the memory size to the number of items decreases. We interpret this result as the emergence of fame. This may explain why there are so many web pages but only a small percentage is widely known. We also observed that some metrics such as the percentage of completely forgotten items, maximum fame, minimum fame changes linearly with the memory ratio.
{"title":"Memory Size","authors":"H. Bingol","doi":"10.1017/9781108671644.014","DOIUrl":"https://doi.org/10.1017/9781108671644.014","url":null,"abstract":"It is a fact that there are many web pages for one to know all. Similarly there are many songs than we can keep in our mp3 players. It is not very difficult to increase examples of \"too many itemstoo little memory\" cases. We try to model the case where the memory is too small to keep all the items. We consider agents with a limited memory of size m. We let them interact by means of recommending web pages among the ones that they know. The giver agent \"remembers\" an item that is stored in its memory. The giver recommends the item to the taker agent. Since the taker does not have empty space in its memory, it \"forgets\" something and uses the emptied slot for the item recommended. We surprisingly observed that this process leads to many items become completely forgotten by the society while a few of them become extremely well known as the ratio of the memory size to the number of items decreases. We interpret this result as the emergence of fame. This may explain why there are so many web pages but only a small percentage is widely known. We also observed that some metrics such as the percentage of completely forgotten items, maximum fame, minimum fame changes linearly with the memory ratio.","PeriodicalId":433709,"journal":{"name":"Communication Complexity","volume":"395 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132346660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：