{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T15:16:24Z","timestamp":1790003784152,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,20]]},"DOI":"10.1145\/1273496.1273559","type":"proceedings-article","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T13:06:52Z","timestamp":1223384812000},"page":"497-504","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":131,"title":["Scalable modeling of real graphs using Kronecker multiplication"],"prefix":"10.1145","author":[{"given":"Jure","family":"Leskovec","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Emergence of scaling in random networks. Science, 509--512","author":"Albert R.","year":"1999","unstructured":"Albert , R. , & Barabasi , A.-L. ( 1999 ). Emergence of scaling in random networks. Science, 509--512 . Albert, R., & Barabasi, A.-L. (1999). Emergence of scaling in random networks. Science, 509--512."},{"key":"e_1_3_2_1_2_1","volume-title":"Statistical mechanics of complex networks. Reviews of Modern Physics","author":"Albert R.","year":"2002","unstructured":"Albert , R. , & Barab á\u00e1si, A.-L. ( 2002 ). Statistical mechanics of complex networks. Reviews of Modern Physics . Albert, R., & Barabá\u00e1si, A.-L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics."},{"key":"e_1_3_2_1_3_1","volume-title":"Graph model selection using maximum likelihood. ICML","author":"Bez\u00e1kov\u00e1 I.","year":"2006","unstructured":"Bez\u00e1kov\u00e1 , I. , Kalai , A. , & Santhanam , R. ( 2006 ). Graph model selection using maximum likelihood. ICML . Bez\u00e1kov\u00e1, I., Kalai, A., & Santhanam, R. (2006). Graph model selection using maximum likelihood. ICML."},{"key":"e_1_3_2_1_4_1","volume-title":"ech. Rep. MBS 05-02). Univ. of California, Irvine.","author":"Butts C. T.","year":"2005","unstructured":"Butts , C. T. ( 2005 ). Permutation models for relational data( T ech. Rep. MBS 05-02). Univ. of California, Irvine. Butts, C. T. (2005). Permutation models for relational data(Tech. Rep. MBS 05-02). Univ. of California, Irvine."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"e_1_3_2_1_6_1","volume-title":"R-MAT: A recursive model for graph mining. SDM","author":"Chakrabarti D.","year":"2004","unstructured":"Chakrabarti , D. , Zhan , Y. , & Faloutsos , C. ( 2004 ). R-MAT: A recursive model for graph mining. SDM . Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004). R-MAT: A recursive model for graph mining. SDM."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343282"},{"key":"e_1_3_2_1_8_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos P.","year":"1960","unstructured":"Erdos , P. , & Renyi , A. ( 1960 ). On the evolution of random graphs . Publication of the Mathematical Institute of the Hungarian Acadamy of Science , 5 , 17 -- 67 . Erdos, P., & Renyi, A. (1960). On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Acadamy of Science, 5, 17--67.","journal-title":"Publication of the Mathematical Institute of the Hungarian Acadamy of Science"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_3_2_1_10_1","volume-title":"Markov chain monte carlo, stochastic simulation for bayesian inference","author":"Gamerman D.","year":"1997","unstructured":"Gamerman , D. ( 1997 ). Markov chain monte carlo, stochastic simulation for bayesian inference . Chapman & Hall . Gamerman, D. (1997). Markov chain monte carlo, stochastic simulation for bayesian inference. Chapman & Hall."},{"key":"e_1_3_2_1_11_1","volume-title":"The web as a graph: Measurements, models and methods. COCOON","author":"Kleinberg J. M.","year":"1999","unstructured":"Kleinberg , J. M. , Kumar , S. R. , Raghavan , P. , Rajagopalan , S. , & Tomkins , A. ( 1999 ). The web as a graph: Measurements, models and methods. COCOON . Kleinberg, J. M., Kumar, S. R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999). The web as a graph: Measurements, models and methods. COCOON."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564126_17"},{"key":"e_1_3_2_1_13_1","first-page":"60","article-title":"The small-world problem","volume":"2","author":"Milgram S.","year":"1967","unstructured":"Milgram , S. ( 1967 ). The small-world problem . Psychology Today , 2 , 60 -- 67 . Milgram, S. (1967). The small-world problem. Psychology Today, 2, 60--67.","journal-title":"Psychology Today"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100510050359"},{"key":"e_1_3_2_1_15_1","volume-title":"Trust management for the semantic web. ISWC","author":"Richardson M.","year":"2003","unstructured":"Richardson , M. , Agrawal , R. , & Domingos , P. ( 2003 ). Trust management for the semantic web. ISWC . Richardson, M., Agrawal, R., & Domingos, P. (2003). Trust management for the semantic web. ISWC."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_3_2_1_17_1","volume-title":"Subnets of scale-free networks are not scale-free: Sampling properties of networks. PNAS, 102","author":"Stumpf M. P. H.","year":"2005","unstructured":"Stumpf , M. P. H. , Wiuf , C. , & May , R. M. ( 2005 ). Subnets of scale-free networks are not scale-free: Sampling properties of networks. PNAS, 102 . Stumpf, M. P. H., Wiuf, C., & May, R. M. (2005). Subnets of scale-free networks are not scale-free: Sampling properties of networks. PNAS, 102."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294547"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0600061103"}],"event":{"name":"ICML '07 & ILP '07: The 24th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","location":"Corvalis Oregon USA","acronym":"ICML '07 & ILP '07","sponsor":["Machine Learning Journal"]},"container-title":["Proceedings of the 24th international conference on Machine learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273496.1273559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:01Z","timestamp":1750258681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":20,"alternative-id":["10.1145\/1273496.1273559","10.1145\/1273496"],"URL":"https:\/\/doi.org\/10.1145\/1273496.1273559","relation":{},"subject":[],"published":{"date-parts":[[2007,6,20]]},"assertion":[{"value":"2007-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}