{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:10:27Z","timestamp":1725707427451},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_16","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T04:00:11Z","timestamp":1353902411000},"page":"219-233","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Generator for Clustered Dynamic Random Networks"],"prefix":"10.1007","author":[{"given":"Robert","family":"G\u00f6rke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Kluge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Schumm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Staudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3-5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Physics Reports\u00a0486(3-5), 75\u2013174 (2010)","journal-title":"Physics Reports"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph Clustering. Computer Science Review\u00a01(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511814068"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"H. Gilbert","year":"1959","unstructured":"Gilbert, H.: Random Graphs. The Annals of Mathematical Statistics\u00a030(4), 1141\u20131144 (1959)","journal-title":"The Annals of Mathematical Statistics"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2","volume":"18","author":"A. Condon","year":"2001","unstructured":"Condon, A., Karp, R.M.: Algorithms for Graph Partitioning on the Planted Partition Model. Randoms Structures and Algorithms\u00a018(2), 116\u2013140 (2001)","journal-title":"Randoms Structures and Algorithms"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-540-39658-1_52","volume-title":"Algorithms - ESA 2003","author":"U. Brandes","year":"2003","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 568\u2013579. Springer, Heidelberg (2003)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-72870-2_2","volume-title":"Algorithmic Aspects in Information and Management","author":"M. Gaertler","year":"2007","unstructured":"Gaertler, M., G\u00f6rke, R., Wagner, D.: Significance-Driven Graph Clustering. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol.\u00a04508, pp. 11\u201326. Springer, Heidelberg (2007)"},{"issue":"12","key":"16_CR8","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. Proceedings of the National Academy of Science of the United States of America\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Science of the United States of America"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Watts, D.J.: Small worlds: The dynamics of networks between order and randomness. Princeton University Press (1999)","DOI":"10.1515\/9780691188331"},{"issue":"6684","key":"16_CR10","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":"16_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graphs Over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 177\u2013187. ACM Press (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"056104","DOI":"10.1103\/PhysRevE.67.056104","volume":"67","author":"A. V\u00e1zquez","year":"2003","unstructured":"V\u00e1zquez, A.: Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Physical Review E 67, 056104 (2003)","journal-title":"Physical Review E"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Bagrow, J.: Evaluating local community methods in networks. Journal of Statistical Mechanics: Theory and Experiment, P05001 (2008), doi:10.1088\/1742-5468\/2008\/05\/P05001","DOI":"10.1088\/1742-5468\/2008\/05\/P05001"},{"issue":"1","key":"16_CR15","doi-asserted-by":"crossref","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A. Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E 80(1), 016118 (2009)","journal-title":"Physical Review E"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.physa.2006.11.036","volume":"377","author":"Y. Fan","year":"2007","unstructured":"Fan, Y., Li, M., Zhang, P., Wu, J., Di, Z.: Accuracy and precision of methods for community identification in weighted networks. Physica\u00a0A\u00a0377(1), 363\u2013372 (2007)","journal-title":"Physica\u00a0A"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"036102","DOI":"10.1103\/PhysRevE.76.036102","volume":"76","author":"R. Guimer\u00e0","year":"2007","unstructured":"Guimer\u00e0, R., Sales-Pardo, M., Amaral, L.A.N.: Module identification in bipartite and directed networks. Physical Review E 76, 036102 (2007)","journal-title":"Physical Review E"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"041908","DOI":"10.1103\/PhysRevE.67.041908","volume":"67","author":"H. Zhou","year":"2003","unstructured":"Zhou, H.: Network landscape from a Brownian particle\u2019s perspective. Physical Review E 67, 041908 (2003)","journal-title":"Physical Review E"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1140\/epjb\/e2008-00418-0","volume":"67","author":"E.N. Sawardecker","year":"2009","unstructured":"Sawardecker, E.N., Sales-Pardo, M., Amaral, L.A.N.: Detection of node group membership in networks with group overlap. The European Physical Journal\u00a0B\u00a067, 277\u2013284 (2009)","journal-title":"The European Physical Journal\u00a0B"},{"key":"16_CR20","doi-asserted-by":"crossref","first-page":"026109","DOI":"10.1103\/PhysRevE.85.026109","volume":"85","author":"R. Aldecoa","year":"2012","unstructured":"Aldecoa, R., Mar\u00edn, I.: Closed benchmarks for network community structure characterization. Physical Review\u00a0E 85, 026109 (2012)","journal-title":"Physical Review E"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-642-18469-7","volume-title":"GD 2011","author":"U. Brandes","year":"2011","unstructured":"Brandes, U., Mader, M.: A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 99\u2013110. Springer, Heidelberg (2011)"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.socnet.2006.08.002","volume":"29","author":"G. Robins","year":"2007","unstructured":"Robins, G., Pattison, P., Kalish, Y., Lusher, D.: An introduction to exponential random graph (p*) models for social networks. Social Networks\u00a029(2), 173\u2013191 (2007)","journal-title":"Social Networks"},{"issue":"1","key":"16_CR23","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1111\/0081-1750.00099","volume":"31","author":"T.A. Snijders","year":"2001","unstructured":"Snijders, T.A.: The Statistical Evaluation of Social Network Dynamics. Sociological Methodology\u00a031(1), 361\u2013395 (2001)","journal-title":"Sociological Methodology"},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1137\/090756053","volume":"24","author":"A.E.F. Clementi","year":"2010","unstructured":"Clementi, A.E.F., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-Markovian dynamic graphs. SIAM Journal on Discrete Mathematics\u00a024(4), 1694\u20131712 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 260\u2013269. ACM Press (2009)","DOI":"10.1145\/1582716.1582757"},{"key":"16_CR26","unstructured":"G\u00f6rke, R., Staudt, C.: A Generator for Dynamic Clustered Random Graphs. Technical report, Informatik, Uni Karlsruhe, TR 2009-7 (2009)"},{"key":"16_CR27","unstructured":"G\u00f6rke, R.: An Algorithmic Walk from Static to Dynamic Graph Clustering. PhD thesis, Fakult\u00e4t f\u00fcr Informatik (February 2010)"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-13193-6_37","volume-title":"Experimental Algorithms","author":"R. G\u00f6rke","year":"2010","unstructured":"G\u00f6rke, R., Maillard, P., Staudt, C., Wagner, D.: Modularity-Driven Clustering of Dynamic Graphs. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 436\u2013448. Springer, Heidelberg (2010)"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"G\u00f6rke, R., Kluge, R., Schumm, A., Staudt, C., Wagner, D.: An Efficient Generator for Clustered Dynamic Random Networks. Technical report, Karlsruhe Reports in Informatics 2012, 17 (2012)","DOI":"10.1007\/978-3-642-34862-4_16"},{"key":"16_CR30","unstructured":"Behrends, E.: Introduction to Markov Chains With Special Emphasis on Rapid Mixing. Friedrick Vieweg\u00a0& Son (October 2002)"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Brandes, U.: Efficient Generation of Large Random Networks. Physical Review\u00a0E 036113 (2005)","DOI":"10.1103\/PhysRevE.71.036113"},{"key":"16_CR32","volume-title":"Statistical Tables for Biological, Agricultural and Medical Research","author":"R.A. Fisher","year":"1948","unstructured":"Fisher, R.A., Yates, F.: Statistical Tables for Biological, Agricultural and Medical Research. Oliver and Boyd, London (1948)"},{"issue":"298","key":"16_CR33","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/01621459.1962.10480667","volume":"57","author":"C.T. Fan","year":"1962","unstructured":"Fan, C.T., Muller, M.E., Rezucha, I.: Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital-Computers. Journal of the American Statistical Association\u00a057(298), 387\u2013402 (1962)","journal-title":"Journal of the American Statistical Association"}],"container-title":["Lecture Notes in Computer Science","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:14:00Z","timestamp":1606169640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}