{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:26:20Z","timestamp":1725549980985},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294146"},{"type":"electronic","value":"9783540320852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11569596_32","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T06:17:55Z","timestamp":1132035475000},"page":"294-303","source":"Crossref","is-referenced-by-count":2,"title":["Fame as an Effect of the Memory Size"],"prefix":"10.1007","author":[{"given":"Haluk","family":"Bingol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Simkin, M.V., Roychowdhury, V.P.: Theory of Aces: Fame by chance or merit? (2003) cond-mat\/0310049"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Bagrow, J.P., Rozenfeld, H.D., Bollt, E.M., Avraham, D.B.: How Famous is a Scientist? - Famous to Those Who Know Us (2004) cond-mat\/0404515","DOI":"10.1209\/epl\/i2004-10104-y"},{"key":"32_CR3","unstructured":"Bingol, H.: The frequency of appearance in the news as a popularity measure (in preparation)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems\u00a0(30), 107\u2013117 (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"32_CR5","first-page":"396","volume":"3","author":"P. Yolum","year":"2004","unstructured":"Yolum, P., Singh, M.P.: Engineering Self-Organizing Referral Networks for Trustworthy Services Selection. IEEE Transactions On Systems, Man, And Cybernetics\u00a03, 396\u2013407 (2004)","journal-title":"IEEE Transactions On Systems, Man, And Cybernetics"},{"key":"32_CR6","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The small-world problem. Psychology Today\u00a02, 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"J.D. Watts","year":"1998","unstructured":"Watts, J.D., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"32_CR8","unstructured":"Newman, M.E.J.: The structure and function of complex networks (2003) cond-mat\/0303516"},{"key":"32_CR9","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks (2001) cond-mat\/0106144v2"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Albert, R., Barabasi, A.L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics\u00a073, 47\u201397 (2002) (cond-mat\/0106096)","DOI":"10.1103\/RevModPhys.74.47"},{"key":"32_CR11","unstructured":"Kirlidog, M., Bingol, H.: The shaping of an electronic list by its active members. In: ITIRA 2003, pp. 40\u201348 (2003)"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.021544898","volume":"98","author":"M.E.J. Newman","year":"2001","unstructured":"Newman, M.E.J.: The structure of scientific collaboration networks. PNAS\u00a098(2), 404\u2013409 (2001)","journal-title":"PNAS"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Redner, S.: How Popular is Your Paper? An Empirical Study of the Citation Distribution (1998) cond-mat\/9804163","DOI":"10.1007\/s100510050359"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-540-30182-0_69","volume-title":"Computer and Information Sciences - ISCIS 2004","author":"A. Ozgur","year":"2004","unstructured":"Ozgur, A., Bingol, H.: Social Network of Co-occurrence in News Articles. In: Aykanat, C., Dayar, T., K\u00f6rpeo\u011flu, \u0130. (eds.) ISCIS 2004. LNCS, vol.\u00a03280, pp. 688\u2013695. Springer, Heidelberg (2004)"},{"key":"32_CR15","unstructured":"Bingol, H.: Graph properties of who-knows-who graphs (in preparation)"}],"container-title":["Lecture Notes in Computer Science","Computer and Information Sciences - ISCIS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11569596_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:00Z","timestamp":1619505600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11569596_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294146","9783540320852"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11569596_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}