{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:04:34Z","timestamp":1725890674720},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334597"},{"type":"electronic","value":"9783642334603"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33460-3_34","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T06:18:14Z","timestamp":1347085094000},"page":"442-457","source":"Crossref","is-referenced-by-count":2,"title":["Reachability Analysis and Modeling of Dynamic Event Networks"],"prefix":"10.1007","author":[{"given":"Kathy","family":"Macropol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambuj","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-04180-8_13","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"L. Akoglu","year":"2009","unstructured":"Akoglu, L., Faloutsos, C.: RTG: A Recursive Realistic Graph Generator Using Random Typing. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part I. LNCS, vol.\u00a05781, pp. 13\u201328. Springer, Heidelberg (2009)"},{"key":"34_CR2","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 (2008)","DOI":"10.1109\/ICDM.2008.123"},{"key":"34_CR3","unstructured":"Bailey, N.: The mathematical theory of infectious disease and its applications. Hafner Press (1975)"},{"issue":"5439","key":"34_CR4","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(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Barrat, A., Barthlemy, M., Vespignani, A.: Dynamical Processes on Complex Networks, New York, NY, USA (2008)","DOI":"10.1017\/CBO9780511791383"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Bi, Z., Faloutsos, C., Korn, F.: The \u201ddgx\u201d distribution for mining massive, skewed data. In: KDD, pp. 17\u201326 (2001)","DOI":"10.1145\/502512.502521"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Comput. Surv.\u00a038 (June 2006)","DOI":"10.1145\/1132952.1132954"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1284680.1284681","volume":"10","author":"D. Chakrabarti","year":"2008","unstructured":"Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., Faloutsos, C.: Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur.\u00a010, 1:1\u20131:26 (2008)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Clementi, A.E., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: PODC, pp. 213\u2013222 (2008)","DOI":"10.1145\/1400751.1400781"},{"key":"34_CR10","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17\u201361 (1960)"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-45465-9_11","volume-title":"Automata, Languages and Programming","author":"A. Fabrikant","year":"2002","unstructured":"Fabrikant, A., Koutsoupias, E., Papadimitriou, C.: Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 110. Springer, Heidelberg (2002)"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1561\/2200000005","volume":"2","author":"A. Goldenberg","year":"2010","unstructured":"Goldenberg, A., Zheng, A.X., Fienberg, S.E., Airoldi, E.M.: A survey of statistical network models. Found. Trends Mach. Learn.\u00a02, 129\u2013233 (2010)","journal-title":"Found. Trends Mach. Learn."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1098\/rspa.2009.0456","volume":"466","author":"P. Grindrod","year":"2010","unstructured":"Grindrod, P., Higham, D.J.: Evolving graphs: dynamical models, inverse problems and propagation. Proc. of TRSA: Math, Phys. Engr. Sci.\u00a0466, 753\u2013770 (2010)","journal-title":"Proc. of TRSA: Math, Phys. Engr. Sci."},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The web as a graph: Measurements, models, and methods (1999)","DOI":"10.1007\/3-540-48686-0_1"},{"key":"34_CR15","unstructured":"Klimt, B., Yang, Y.: Introducing the enron corpus. In: CEAS (2004)"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F. Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News\u00a042, 82\u201396 (2011)","journal-title":"SIGACT News"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: Proc. Found. of CS, pp. 57\u201366 (2000)","DOI":"10.1145\/335168.335170"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335168.335170","volume-title":"PODS","author":"R. Kumar","year":"2000","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tompkins, A., Upfal, E.: The web as a graph. In: PODS, pp. 1\u201310. ACM, New York (2000)"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kumar, R., Tomkins, A.: Microscopic evolution of social networks. In: KDD (2008)","DOI":"10.1145\/1401890.1401948"},{"key":"34_CR20","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":"34_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Mcglohon, M., Faloutsos, C., Glance, N., Hurst, M.: Cascading behavior in large blog graphs: Patterns and a model. Technical report (2006)","DOI":"10.1137\/1.9781611972771.60"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec, J., McGlohon, M., Faloutsos, C., Hurst, M.: Cascading behavior in large blog graphs patterns and a model. In: SDM (2007)","DOI":"10.1137\/1.9781611972771.60"},{"key":"34_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1186\/1471-2105-10-283","volume":"10","author":"K. Macropol","year":"2009","unstructured":"Macropol, K., Can, T., Singh, A.: Rrw: repeated random walks on genome-scale protein networks for local cluster discovery. BMC Bioinformatics\u00a010, 283 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"34_CR25","first-page":"693","volume":"3","author":"K. Macropol","year":"2010","unstructured":"Macropol, K., Singh, A.: Scalable discovery of best clusters on large graphs. PVLDB\u00a03(1), 693\u2013702 (2010)","journal-title":"PVLDB"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Macropol, K., Singh, A.K.: Content-based modeling and prediction of information dissemination. In: ASONAM (2011)","DOI":"10.1109\/ASONAM.2011.61"},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"McGlohon, M., Akoglu, L., Faloutsos, C.: Weighted graphs and disconnected components: patterns and a generator. In: KDD, pp. 524\u2013532 (2008)","DOI":"10.1145\/1401890.1401955"},{"key":"34_CR28","unstructured":"Nickel, C.L.M.: Random Dot Product Graphs: A Model For Social Networks. PhD thesis, Johns Hopkins University, Maryland, USA (2006)"},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"Pennock, D., Flake, G., Lawrence, S., Glover, E., Giles, C.L.: Winners don\u2019t take all: Characterizing the competition for links on the web. In: PNAS (2002)","DOI":"10.1073\/pnas.032085699"},{"key":"34_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-15939-8_7","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"B.A. Prakash","year":"2010","unstructured":"Prakash, B.A., Tong, H., Valler, N., Faloutsos, M., Faloutsos, C.: Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms. In: Balc\u00e1zar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010, Part III. LNCS, vol.\u00a06323, pp. 99\u2013114. Springer, Heidelberg (2010)"},{"key":"34_CR31","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1109\/TNET.2003.815300","volume":"11","author":"G. Siganos","year":"2003","unstructured":"Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power laws and the as-level internet topology. IEEE\/ACM Trans. Netw.\u00a011, 514\u2013524 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"34_CR32","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.socnet.2009.02.004","volume":"32","author":"T.A. Snijders","year":"2010","unstructured":"Snijders, T.A., van de Bunt, G.G., Steglich, C.E.: Introduction to stochastic actor-based models for network dynamics. Social Networks\u00a032, 44\u201360 (2010)","journal-title":"Social Networks"},{"key":"34_CR33","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":"34_CR34","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mislove, A., Cha, M., Gummadi, K.P.: On the evolution of user interaction in facebook. In: WOSN 2009 (2009)","DOI":"10.1145\/1592665.1592675"}],"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-33460-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T16:48:57Z","timestamp":1687711737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33460-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334597","9783642334603"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33460-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}