{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:28Z","timestamp":1763467948358},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041792"},{"type":"electronic","value":"9783642041808"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04180-8_13","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T08:11:20Z","timestamp":1251360680000},"page":"13-28","source":"Crossref","is-referenced-by-count":25,"title":["RTG: A Recursive Realistic Graph Generator Using Random Typing"],"prefix":"10.1007","author":[{"given":"Leman","family":"Akoglu","sequence":"first","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu, L., McGlohon, M., Faloutsos, C.: Rtm: Laws and a recursive generator for weighted time-evolving graphs. In: ICDM (2008)","DOI":"10.1109\/ICDM.2008.123"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barabasi, A.-L.: Diameter of the World Wide Web. Nature\u00a0401, 130\u2013131 (1999)","journal-title":"Nature"},{"issue":"5439","key":"13_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barabasi","year":"1999","unstructured":"Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Comput. Surv.\u00a038(1) (2006)","DOI":"10.1145\/1132952.1132954"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: SIAM Int. Conf. on Data Mining (April 2004)","DOI":"10.1137\/1.9781611972740.43"},{"issue":"7","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TIT.2004.830752","volume":"50","author":"B. Conrad","year":"2004","unstructured":"Conrad, B., Mitzenmacher, M.: Power laws for monkeys typing randomly: the case of unequal probabilities. IEEE Transactions on Information Theory\u00a050(7), 1403\u20131414 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Crovella, M., Bestavros, A.: Self-similarity in world wide web traffic, evidence and possible causes. Sigmetrics, 160\u2013169 (1996)","DOI":"10.1145\/233008.233038"},{"key":"13_CR8","first-page":"17","volume":"5","author":"P. Erdos","year":"1960","unstructured":"Erdos, P., Renyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungary. Acad. Sci.\u00a05, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hungary. Acad. Sci."},{"key":"13_CR9","unstructured":"Even-Bar, E., Kearns, M., Suri, S.: A network formation game for bipartite exchange economies. In: SODA (2007)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E.N., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC (2003)","DOI":"10.1145\/872035.872088"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM, August-September 1999, pp. 251\u2013262 (1999)","DOI":"10.1145\/316188.316229"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"G.W. Flake","year":"2002","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L., Coetzee, F.M.: Self-organization and identification of web communities. IEEE Computer\u00a035, 66\u201371 (2002)","journal-title":"IEEE Computer"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS\u00a099, 7821 (2002)","journal-title":"PNAS"},{"key":"13_CR14","unstructured":"Gomez, M.E., Santonja, V.: Self-similarity in i\/o workload: Analysis and modeling. In: WWC (1998)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Gribble, S.D., Manku, G.S., Roselli, D., Brewer, E.A., Gibson, T.J., Miller, E.L.: Self-similarity in file systems. In: SIGMETRICS 1998 (1998)","DOI":"10.1145\/277851.277894"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48686-0_1","volume-title":"Computing and Combinatorics","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The Web as a graph: Measurements, models and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 1\u201317. Springer, Heidelberg (1999)"},{"key":"13_CR17","unstructured":"Scheinerman, E., Kraetzl, M., Nickel, C.: Random dot product graphs: a model for social networks (Preliminary Manuscript) (2005)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Laoutaris, N., Poplawski, L.J., Rajaraman, R., Sundaram, R., Teng, S.-H.: Bounded budget connection (bbc) games or how to make friends and influence people, on a budget. In: PODC (2008)","DOI":"10.1145\/1400751.1400774"},{"key":"13_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)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: ACM SIGKDD (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"13_CR21","unstructured":"Mandelbrot, B.: An informational theory of the statistical structure of language. Communication Theory (1953)"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"McGlohon, M., Akoglu, L., Faloutsos, C.: Weighted graphs and disconnected components: Patterns and a generator. In: ACM SIGKDD, Las Vegas (August 2008)","DOI":"10.1145\/1401890.1401955"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2307\/1419346","volume":"70","author":"G.A. Miller","year":"1957","unstructured":"Miller, G.A.: Some effects of intermittent silence. American Journal of Psychology\u00a070, 311\u2013314 (1957)","journal-title":"American Journal of Psychology"},{"key":"13_CR24","unstructured":"Newman, M.E.J.: Power laws, Pareto distributions and Zipf\u2019s law (December 2004)"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069, 026113 (2004)","journal-title":"Physical Review E"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Pennock, D.M., Flake, G.W., Lawrence, S., Glover, E.J., Giles, C.L.: Winners don\u2019t take all: Characterizing the competition for links on the web. Proceedings of the National Academy of Sciences, 5207\u20135211 (2002)","DOI":"10.1073\/pnas.032085699"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/163381.163402","volume":"36","author":"M.F. Schwartz","year":"1992","unstructured":"Schwartz, M.F., Wood, D.C.M.: Discovering shared interests among people using graph analysis of global electronic mail traffic. Communications of the ACM\u00a036, 78\u201389 (1992)","journal-title":"Communications of the ACM"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power laws and the AS-level internet topology (2003)","DOI":"10.1109\/TNET.2003.815300"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: Algorithms and laws. In: ICDM (2008)","DOI":"10.1109\/ICDM.2008.72"},{"key":"13_CR30","unstructured":"Wang, M., Madhyastha, T., Chan, N.H., Papadimitriou, S., Faloutsos, C.: Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic. In: ICDE, pp. 507\u2013516 (2002)"},{"issue":"6684","key":"13_CR31","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)","journal-title":"Nature"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-77004-6_11","volume-title":"Algorithms and Models for the Web-Graph","author":"S.J. Young","year":"2007","unstructured":"Young, S.J., Scheinerman, E.R.: Random dot product graph models for social networks. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol.\u00a04863, pp. 138\u2013149. Springer, Heidelberg (2007)"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Zipf, G.K.: Selective Studies and the Principle of Relative Frequency in Language. Harvard University Press (1932)","DOI":"10.4159\/harvard.9780674434929"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04180-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T06:20:52Z","timestamp":1558506052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04180-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041792","9783642041808"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04180-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}