{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:25:44Z","timestamp":1774941944607,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,7,29]],"date-time":"2009-07-29T00:00:00Z","timestamp":1248825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10618-009-0140-7","type":"journal-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T14:00:30Z","timestamp":1248789630000},"page":"194-209","source":"Crossref","is-referenced-by-count":47,"title":["RTG: a recursive realistic graph generator using random typing"],"prefix":"10.1007","volume":"19","author":[{"given":"Leman","family":"Akoglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,7,29]]},"reference":[{"key":"140_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu L, McGlohon M, Faloutsos C (2008) Rtm: laws and a recursive generator for weighted time-evolving graphs. In: ICDM","DOI":"10.1109\/ICDM.2008.123"},{"key":"140_CR2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert R, Jeong H, Barabasi A-L (1999) Diameter of the world wide web. Nature 401: 130\u2013131","journal-title":"Nature"},{"issue":"5439","key":"140_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439): 509\u2013512","journal-title":"Science"},{"key":"140_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti D, Faloutsos C (2006) Graph mining: laws, generators, and algorithms. ACM Comput Surv 38: 1\u201369","journal-title":"ACM Comput Surv"},{"key":"140_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-MAT: a recursive model for graph mining. In: Fourth SIAM international conference on data mining, April 2004, Orlando, Florida, USA","DOI":"10.1137\/1.9781611972740.43"},{"issue":"7","key":"140_CR6","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1109\/TIT.2004.830752","volume":"50","author":"B Conrad","year":"2004","unstructured":"Conrad B, Mitzenmacher M (2004) Power laws for monkeys typing randomly: the case of unequal probabilities. IEEE Trans Inf Theory 50(7): 1403\u20131414","journal-title":"IEEE Trans Inf Theory"},{"key":"140_CR7","doi-asserted-by":"crossref","unstructured":"Crovella M, Bestavros A (1996) Self-similarity in world wide web traffic, evidence and possible causes. In: Sigmetrics, pp 160\u2013169","DOI":"10.1145\/233008.233038"},{"key":"140_CR8","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hungary Acad Sci 5: 17\u201361","journal-title":"Publ Math Inst Hungary Acad Sci"},{"key":"140_CR9","unstructured":"Even-Bar E, Kearns M, Suri S (2007) A network formation game for bipartite exchange economies. In: SODA"},{"key":"140_CR10","doi-asserted-by":"crossref","unstructured":"Fabrikant A, Luthra A, Maneva EN, Papadimitriou CH, Shenker S (2003) On a network creation game. In: PODC","DOI":"10.1145\/872035.872088"},{"key":"140_CR11","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: SIGCOMM, pp 251\u2013262","DOI":"10.1145\/316188.316229"},{"key":"140_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"GW Flake","year":"2002","unstructured":"Flake GW, Lawrence S, Giles CL, Coetzee FM (2002) Self-organization and identification of web communities. IEEE Comput 35: 66\u201371","journal-title":"IEEE Comput"},{"key":"140_CR13","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. PNAS 99: 7821","journal-title":"PNAS"},{"key":"140_CR14","unstructured":"Gomez ME, Santonja V (1998) Self-similarity in i\/o workload: analysis and modeling. In: WWC"},{"key":"140_CR15","doi-asserted-by":"crossref","unstructured":"Gribble SD, Manku GS, Roselli D, Brewer EA, Gibson TJ, Miller EL (1998) Self-similarity in file systems. In: SIGMETRICS \u201998","DOI":"10.1145\/277851.277894"},{"key":"140_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg JM, Kumar R, Raghavan P, Rajagopalan S, Tomkins AS (1999) AS The Web as a graph: measurements, models and methods. In: Lecture Notes in Computer Science, vol 1627, pp 1\u20137","DOI":"10.1007\/3-540-48686-0_1"},{"key":"140_CR17","unstructured":"Kraetzl MSE, Nickel C (2005) Random dot product graphs: a model for social networks. In: Preliminary manuscript"},{"key":"140_CR18","doi-asserted-by":"crossref","unstructured":"Laoutaris N, Poplawski LJ, Rajaraman R, Sundaram R, Teng S-H (2008) Bounded budget connection (bbc) games or how to make friends and influence people, on a budget. In: PODC","DOI":"10.1145\/1400751.1400774"},{"key":"140_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec J, Chakrabarti D, Kleinberg JM, Faloutsos C (2005) Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication. In: PKDD, Porto, Portugal","DOI":"10.1007\/11564126_17"},{"key":"140_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: ACM SIGKDD","DOI":"10.1145\/1081870.1081893"},{"key":"140_CR21","unstructured":"Mandelbrot B (1953) An informational theory of the statistical structure of language. Commun Theory"},{"key":"140_CR22","doi-asserted-by":"crossref","unstructured":"McGlohon M, Akoglu L, Faloutsos C (2008) Weighted graphs and disconnected components: patterns and a generator. In: ACM SIGKDD, Las Vegas, Aug","DOI":"10.1145\/1401890.1401955"},{"key":"140_CR23","doi-asserted-by":"crossref","first-page":"311","DOI":"10.2307\/1419346","volume":"70","author":"GA Miller","year":"1957","unstructured":"Miller GA (1957) Some effects of intermittent silence. Am J Psychol 70: 311\u2013314","journal-title":"Am J Psychol"},{"key":"140_CR24","unstructured":"Newman MEJ (2004) Power laws, Pareto distributions and Zipf\u2019s law, December"},{"key":"140_CR25","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69: 026113","journal-title":"Phys Rev E"},{"key":"140_CR26","doi-asserted-by":"crossref","unstructured":"Pennock DM, Flake GW, Lawrence S, Glover EJ, Giles CL (2002) Winners don\u01076t take all: characterizing the competition for links on the web. In: Proceedings of the national academy of sciences, pp 5207\u20135211","DOI":"10.1073\/pnas.032085699"},{"key":"140_CR27","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/163381.163402","volume":"36","author":"MF Schwartz","year":"1992","unstructured":"Schwartz MF, Wood DCM (1992) Discovering shared interests among people using graph analysis of global electronic mail traffic. Commun ACM 36: 78\u201389","journal-title":"Commun ACM"},{"key":"140_CR28","doi-asserted-by":"crossref","unstructured":"Siganos G, Faloutsos M, Faloutsos P, Faloutsos C (2003) Power laws and the AS\u2014level internet topology","DOI":"10.1109\/TNET.2003.815300"},{"key":"140_CR29","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE (2008) Fast counting of triangles in large real networks without counting: algorithms and laws. In: ICDM","DOI":"10.1109\/ICDM.2008.72"},{"key":"140_CR30","unstructured":"Wang M, Madhyastha T, Chan NH, Papadimitriou S, Faloutsos C (2002) Data mining meets performance evaluation: fast algorithms for modeling bursty traffic. In: ICDE, pp 507\u2013516"},{"issue":"6684","key":"140_CR31","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature 393(6684): 440\u2013442","journal-title":"Nature"},{"key":"140_CR32","doi-asserted-by":"crossref","unstructured":"Young SJ, Scheinerman ER (2007) Random dot product graph models for social networks. In: WAW, pp 138\u2013149","DOI":"10.1007\/978-3-540-77004-6_11"},{"key":"140_CR33","doi-asserted-by":"crossref","unstructured":"Zipf GK (1932) Selective studies and the principle of relative frequency in language. Harvard University Press","DOI":"10.4159\/harvard.9780674434929"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-009-0140-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0140-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T05:01:43Z","timestamp":1685077303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-009-0140-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,29]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s10618-009-0140-7","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,29]]}}}