{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T17:33:16Z","timestamp":1791135196440,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642212857","type":"print"},{"value":"9783642212864","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21286-4_8","type":"book-chapter","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T01:39:29Z","timestamp":1307410769000},"page":"85-102","source":"Crossref","is-referenced-by-count":16,"title":["Modeling Social Networks through User Background and Behavior"],"prefix":"10.1007","author":[{"given":"Ilias","family":"Foudalis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kamal","family":"Jain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martha","family":"Sideri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks, vol.\u00a0286, pp. 509\u2013512 (October 1999)","DOI":"10.1126\/science.286.5439.509"},{"key":"8_CR2","first-page":"1","volume-title":"Handbook of Graphs and Networks","author":"B. Bollobas","year":"2003","unstructured":"Bollobas, B.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, pp. 1\u201334. Wiley, Chichester (2003)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bonato, A., Janssen, J., Pralat, P.: A Geometric Model for On-line Social Networks. In: Proceedings of the 3rd Workshop on Online Social Networks (WOSN 2010), Boston, MA, USA (June 2010), http:\/\/www.usenix.org\/events\/wosn10\/tech\/full_papers\/Bonato.pdf","DOI":"10.1145\/1835980.1835984"},{"key":"8_CR4","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality (2001), http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.11.2024"},{"issue":"1-7","key":"8_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"Sergey Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Computer Networks and ISDN Systems, pp. 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"8_CR6","first-page":"721","volume-title":"WWW 2009: Proceedings of the 18th International Conference on World Wide Web","author":"M. Cha","year":"2009","unstructured":"Cha, M., Mislove, A., Gummadi, K.P.: A measurement-driven analysis of information propagation in the flickr social network. In: WWW 2009: Proceedings of the 18th International Conference on World Wide Web, pp. 721\u2013730. ACM Press, New York (2009), http:\/\/dx.doi.org\/10.1145\/1526709.1526806 , doi:10.1145\/1526709.1526806"},{"key":"8_CR7","first-page":"57","volume-title":"Proceedings of the 8th ACM SIGCOMM Conference on Internet Measurement, IMC 2008","author":"H. Chun","year":"2008","unstructured":"Chun, H., Kwak, H., Eom, Y.-H., Ahn, Y.-Y., Moon, S., Jeong, H.: Comparison of online social relations in volume vs interaction: a case study of cyworld. In: Proceedings of the 8th ACM SIGCOMM Conference on Internet Measurement, IMC 2008, Vouliagmeni, Greece, pp. 57\u201370. ACM, New York (2008), http:\/\/doi.acm.org\/10.1145\/1452520.1452528 , doi:10.1145\/1452520.1452528"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry\u00a040(1), 35\u201341 (1977), http:\/\/links.jstor.org\/sici?sici=0038-0431%28197703%2940%3A1%3C35%3AASOMOC%3E2.0.CO%3B2-H","journal-title":"Sociometry"},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833993","volume-title":"Social and Economic Networks","author":"M.O. Jackson","year":"2008","unstructured":"Jackson, M.O.: Social and Economic Networks. Princeton University Press, Princeton (2008), http:\/\/www.amazon.com\/exec\/obidos\/redirect?tag=citeulike07-20&path=ASIN\/0691134405"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1257\/aer.97.3.890","volume":"97","author":"M.O. Jackson","year":"2007","unstructured":"Jackson, M.O., Rogers, B.W.: Meeting strangers and friends of friends: How random are social networks? American Economic Review\u00a097(3), 890\u2013915 (2007), http:\/\/ideas.repec.org\/a\/aea\/aecrev\/v97y2007i3p890-915.html","journal-title":"American Economic Review"},{"key":"8_CR11","unstructured":"Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 163\u2013170 (2000), http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.29.4366"},{"key":"8_CR12","unstructured":"Kleinberg, J.: Complex networks and decentralized search algorithms. In: Proceedings of the International Congress of Mathematicians, ICM (2006)"},{"key":"8_CR13","first-page":"57","volume-title":"FOCS 2000: Proceedings of the 41st Annual Symposium on Foundations of Computer Science","author":"R. Kumar","year":"2000","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: FOCS 2000: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p. 57. IEEE Computer Society, Washington, DC, USA (2000)"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1145\/1150402.1150476","volume-title":"KDD 2006: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"R. Kumar","year":"2006","unstructured":"Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks. In: KDD 2006: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 611\u2013617. ACM, New York (2006), http:\/\/portal.acm.org\/citation.cfm?id=1150402.1150476 , doi:10.1145\/1150402.1150476"},{"key":"8_CR15","first-page":"427","volume-title":"STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"S. Lattanzi","year":"2009","unstructured":"Lattanzi, S., Sivakumar, D.: Affiliation networks. In: STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, pp. 427\u2013434. ACM, New York (2009), doi:10.1145\/1536414.1536474"},{"key":"8_CR16","unstructured":"Leskovec, J.: Snap graph library, http:\/\/snap.stanford.edu"},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/1081870.1081893","volume-title":"KDD 2005: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining","author":"J. Leskovec","year":"2005","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD 2005: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, Chicago, Illinois, USA, pp. 177\u2013187. ACM, New York (2005), doi:10.1145\/1081870.1081893"},{"key":"8_CR18","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR abs\/0810.1355 (2008)"},{"key":"8_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11564126_17","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"J. Leskovec","year":"2005","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J.M., Faloutsos, C.: Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 133\u2013145. Springer, Heidelberg (2005), http:\/\/dx.doi.org\/10.1007\/11564126_17 , doi:10.1007\/11564126_17"},{"key":"8_CR20","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":"8_CR21","first-page":"29","volume-title":"IMC 2007: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement","author":"A. Mislove","year":"2007","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: IMC 2007: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, San Diego, California, USA, pp. 29\u201342. ACM, New York (2007), doi:10.1145\/1298306.1298311"},{"issue":"2","key":"8_CR22","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1080\/15427951.2004.10129088","volume":"1","author":"Michael Mitzenmacher","year":"2004","unstructured":"Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Mathematics\u00a01(2) (2003)","journal-title":"Internet Mathematics"},{"key":"8_CR23","first-page":"161","volume-title":"Random Graphs 93: Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science","author":"M. Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. In: Random Graphs 93: Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, pp. 161\u2013179. John Wiley & Sons, Inc., New York (1995)"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045, 167\u2013256 (2003), http:\/\/arxiv.org\/abs\/cond-mat\/0303516","journal-title":"SIAM Review"},{"issue":"3","key":"8_CR25","doi-asserted-by":"publisher","first-page":"36122","DOI":"10.1103\/PhysRevE.68.036122","volume":"68","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Physical Review E\u00a068(3), 36122 (2003)","journal-title":"Physical Review E"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"The Semantic Web - ISWC 2003","author":"M. Richardson","year":"2003","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol.\u00a02870, pp. 351\u2013368. Springer, Heidelberg (2003), http:\/\/www.metapress.com\/content\/DM0N8R10RL4U430Q"},{"issue":"16","key":"8_CR27","doi-asserted-by":"publisher","first-page":"9340","DOI":"10.1073\/pnas.97.16.9340","volume":"97","author":"B. Skyrms","year":"2000","unstructured":"Skyrms, B., Pemantle, R.: A dynamic model of social network formation. Proc. Natl. Acad. Sci. U. S. A.\u00a097(16), 9340\u20139346 (2000)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"key":"8_CR28","unstructured":"Traud, A.L., Kelsic, E.D., Mucha, P.J., Porter, M.A.: Community structure in online collegiate social networks. Tech. Rep. arXiv:0809.0690 (September 2008), comments: 38 pages, 14 figure files, some of which have been compressed for this posting (higher-resolution pdf available from http:\/\/www.amath.unc.edu\/Faculty\/mucha\/Reprints\/facebook.pdf )"},{"issue":"6684","key":"8_CR29","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2019small-world\u2019 networks. Nature\u00a0393(6684), 440\u2013442 (1998), http:\/\/dx.doi.org\/10.1038\/30918 , doi:10.1038\/30918","journal-title":"Nature"},{"key":"8_CR30","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1145\/1557019.1557128","volume-title":"KDD 2009: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"E. Zheleva","year":"2009","unstructured":"Zheleva, E., Sharara, H., Getoor, L.: Co-evolution of social and affiliation networks. In: KDD 2009: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1007\u20131016. ACM, New York (2009), http:\/\/dx.doi.org\/10.1145\/1557019.1557128 , doi:10.1145\/1557019.1557128"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21286-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T07:01:27Z","timestamp":1686121287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21286-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212857","9783642212864"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21286-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}