{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:53:53Z","timestamp":1743123233512,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653460"},{"type":"electronic","value":"9783030653477"}],"license":[{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65347-7_40","type":"book-chapter","created":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T07:03:42Z","timestamp":1608361422000},"page":"482-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Diffusion Dynamics Prediction on Networks Using Sub-graph Motif Distribution"],"prefix":"10.1007","author":[{"given":"Alexey L.","family":"Zaykov","sequence":"first","affiliation":[]},{"given":"Danila A.","family":"Vaganov","sequence":"additional","affiliation":[]},{"given":"Valentina Y.","family":"Guleva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,20]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Alexander, R.P., Kim, P.M., Emonet, T., Gerstein, M.B.: Understanding modularity in molecular networks requires dynamics. Sci. Signal. 2(81), pe44\u2013pe44 (2009)","DOI":"10.1126\/scisignal.281pe44"},{"issue":"6","key":"40_CR2","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/nrg2102","volume":"8","author":"U Alon","year":"2007","unstructured":"Alon, U.: Network motifs: theory and experimental approaches. Nat. Rev. Genet. 8(6), 450\u2013461 (2007)","journal-title":"Nat. Rev. Genet."},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/s12859-018-2350-8","volume":"19","author":"D Dess\u00ec","year":"2018","unstructured":"Dess\u00ec, D., Cirrone, J., Recupero, D.R., Shasha, D.: SuperNoder: a tool to discover over-represented modular structures in networks. BMC Bioinform. 19(1), 318 (2018)","journal-title":"BMC Bioinform."},{"key":"40_CR4","unstructured":"D\u2019Huys, O., Vicente, R., Erneux, T., Danckaert, J., Fischer, I.: Synchronization properties of network motifs: influence of coupling delay and symmetry. Chaos: Interdiscip. J. Nonlinear Sci. 18(3), 037116 (2008)"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in Facebook: a case study of unbiased sampling of OSNs. In: 2010 Proceedings IEEE Infocom, pp. 1\u20139. IEEE (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"issue":"8","key":"40_CR6","doi-asserted-by":"publisher","first-page":"e22656","DOI":"10.1371\/journal.pone.0022656","volume":"6","author":"B Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, B., Perra, N., Vespignani, A.: Modeling users\u2019 activity on twitter networks: validation of Dunbar\u2019s number. PLoS ONE 6(8), e22656 (2011)","journal-title":"PLoS ONE"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"H\u00fcbler, C., Kriegel, H.P., Borgwardt, K., Ghahramani, Z.: Metropolis algorithms for representative subgraph sampling. In: 2008 Eighth IEEE International Conference on Data Mining, pp. 283\u2013292. IEEE (2008)","DOI":"10.1109\/ICDM.2008.124"},{"issue":"1","key":"40_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2164-7-108","volume":"7","author":"PJ Ingram","year":"2006","unstructured":"Ingram, P.J., Stumpf, M.P., Stark, J.: Network motifs: structure does not determine function. BMC Genom. 7(1), 1\u201312 (2006)","journal-title":"BMC Genom."},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Triolet, R.: SuperNode partitioning. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 319\u2013329 (1988)","DOI":"10.1145\/73560.73588"},{"issue":"1","key":"40_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZRM Kashani","year":"2009","unstructured":"Kashani, Z.R.M., Ahrabian, H., Elahi, E., Nowzari-Dalini, A., Ansari, E.S., Asadi, S., Mohammadi, S., Schreiber, F., Masoudi-Nejad, A.: Kavosh: a new algorithm for finding network motifs. BMC Bioinform. 10(1), 1\u201312 (2009)","journal-title":"BMC Bioinform."},{"issue":"2088","key":"40_CR11","doi-asserted-by":"publisher","first-page":"20160216","DOI":"10.1098\/rsta.2016.0216","volume":"375","author":"S Krishnagopal","year":"2017","unstructured":"Krishnagopal, S., Lehnert, J., Poel, W., Zakharova, A., Sch\u00f6ll, E.: Synchronization patterns: from network motifs to hierarchical networks. Philos. Trans. R. Soc. A: Math. Phys. Eng. Sci. 375(2088), 20160216 (2017)","journal-title":"Philos. Trans. R. Soc. A: Math. Phys. Eng. Sci."},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/2318857.2254795","volume":"40","author":"CH Lee","year":"2012","unstructured":"Lee, C.H., Xu, X., Eun, D.Y.: Beyond random walk and Metropolis-Hastings samplers: why you should not backtrack for unbiased graph sampling. ACM SIGMETRICS Perform. Eval. Rev. 40(1), 319\u2013330 (2012)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Li, Y., Wu, Z., Lin, S., Xie, H., Lv, M., Xu, Y., Lui, J.C.: Walking with perception: efficient random walk sampling via common neighbor awareness. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 962\u2013973. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00090"},{"issue":"2","key":"40_CR15","doi-asserted-by":"publisher","first-page":"28001","DOI":"10.1209\/0295-5075\/78\/28001","volume":"78","author":"I Lodato","year":"2007","unstructured":"Lodato, I., Boccaletti, S., Latora, V.: Synchronization properties of network motifs. EPL (Europhys. Lett.) 78(2), 28001 (2007)","journal-title":"EPL (Europhys. Lett.)"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Sampling community structure. In: Proceedings of the 19th International Conference on World Wide Web, pp. 701\u2013710 (2010)","DOI":"10.1145\/1772690.1772762"},{"issue":"5594","key":"40_CR17","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Paredes, P., Ribeiro, P.: Towards a faster network-centric subgraph census. In: Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 264\u2013271 (2013)","DOI":"10.1145\/2492517.2492535"},{"issue":"1","key":"40_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s13278-015-0256-2","volume":"5","author":"P Paredes","year":"2015","unstructured":"Paredes, P., Ribeiro, P.: Rand-FaSE: fast approximate subgraph census. Soc. Netw. Anal. Min. 5(1), 17 (2015)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"2","key":"40_CR20","doi-asserted-by":"publisher","first-page":"022915","DOI":"10.1103\/PhysRevE.91.022915","volume":"91","author":"W Poel","year":"2015","unstructured":"Poel, W., Zakharova, A., Sch\u00f6ll, E.: Partial synchronization and partial amplitude death in mesoscale network motifs. Phys. Rev. E 91(2), 022915 (2015)","journal-title":"Phys. Rev. E"},{"issue":"11","key":"40_CR21","doi-asserted-by":"publisher","first-page":"e343","DOI":"10.1371\/journal.pbio.0030343","volume":"3","author":"RJ Prill","year":"2005","unstructured":"Prill, R.J., Iglesias, P.A., Levchenko, A.: Dynamic properties of network motifs contribute to biological network organization. PLoS Biol. 3(11), e343 (2005)","journal-title":"PLoS Biol."},{"key":"40_CR22","unstructured":"Ribeiro, P., Paredes, P., Silva, M.E., Aparicio, D., Silva, F.: A survey on subgraph counting: concepts, algorithms and applications to network motifs and graphlets. arXiv preprint arXiv:1910.13011 (2019)"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: Efficient subgraph frequency estimation with g-tries. In: International Workshop on Algorithms in Bioinformatics, pp. 238\u2013249. Springer (2010)","DOI":"10.1007\/978-3-642-15294-8_20"},{"issue":"2","key":"40_CR24","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","volume":"28","author":"P Ribeiro","year":"2014","unstructured":"Ribeiro, P., Silva, F.: G-tries: a data structure for storing and finding subgraphs. Data Min. Knowl. Disc. 28(2), 337\u2013377 (2014)","journal-title":"Data Min. Knowl. Disc."},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F., Lopes, L.: A parallel algorithm for counting subgraphs in complex networks. In: International Joint Conference on Biomedical Engineering Systems and Technologies, pp. 380\u2013393. Springer (2010)","DOI":"10.1007\/978-3-642-18472-7_30"},{"issue":"2","key":"40_CR26","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jpdc.2011.08.007","volume":"72","author":"P Ribeiro","year":"2012","unstructured":"Ribeiro, P., Silva, F., Lopes, L.: Parallel discovery of network motifs. J. Parallel Distrib. Comput. 72(2), 144\u2013154 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"40_CR27","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Kiss, O., Sarkar, R.: Little ball of fur: a python library for graph sampling. In: Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM 2020). ACM (2020)","DOI":"10.1145\/3340531.3412758"},{"issue":"1","key":"40_CR28","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s13278-019-0556-z","volume":"9","author":"S Sarkar","year":"2019","unstructured":"Sarkar, S., Guo, R., Shakarian, P.: Using network motifs to characterize temporal network evolution leading to diffusion inhibition. Soc. Netw. Anal. Min. 9(1), 14 (2019)","journal-title":"Soc. Netw. Anal. Min."},{"key":"40_CR29","unstructured":"Schwarze, A.C., Porter, M.A.: Motifs for processes on networks. arXiv preprint arXiv:2007.07447 (2020)"},{"key":"40_CR30","doi-asserted-by":"crossref","unstructured":"Shahrivari, S., Jalili, S.: Fast parallel all-subgraph enumeration using multicore machines. Sci. Program. 2015 (2015)","DOI":"10.1155\/2015\/901321"},{"issue":"4","key":"40_CR31","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s41060-018-0156-4","volume":"9","author":"Q Tan","year":"2020","unstructured":"Tan, Q., Liu, Y., Liu, J.: Motif-aware diffusion network inference. Int. J. Data Sci. Anal. 9(4), 375\u2013387 (2020)","journal-title":"Int. J. Data Sci. Anal."},{"key":"40_CR32","doi-asserted-by":"crossref","unstructured":"Vaganov, D.A., Guleva, V.Y., Bochenina, K.O.: Social media group structure and its goals: building an order. In: International Conference on Complex Networks and their Applications, pp. 473\u2013483. Springer (2018)","DOI":"10.1007\/978-3-030-05414-4_38"},{"key":"40_CR33","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.physa.2004.05.033","volume":"343","author":"YM Vega","year":"2004","unstructured":"Vega, Y.M., V\u00e1zquez-Prada, M., Pacheco, A.F.: Fitness for synchronization of network motifs. Physica A 343, 279\u2013287 (2004)","journal-title":"Physica A"},{"issue":"4","key":"40_CR34","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S.: Efficient detection of network motifs. IEEE\/ACM Trans. Comput. Biol. Bioinf. 3(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"9","key":"40_CR35","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S., Rasche, F.: FANMOD: a tool for fast network motif detection. Bioinformatics 22(9), 1152\u20131153 (2006)","journal-title":"Bioinformatics"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65347-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T16:08:19Z","timestamp":1608394099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65347-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,20]]},"ISBN":["9783030653460","9783030653477"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65347-7_40","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2020,12,20]]},"assertion":[{"value":"20 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}