{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:37:37Z","timestamp":1743053857874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031409707"},{"type":"electronic","value":"9783031409714"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-40971-4_18","type":"book-chapter","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T04:02:25Z","timestamp":1693195345000},"page":"190-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preliminary Evaluation of\u00a0Random Walk Based Rendezvous Search on\u00a0Facebook Social Networks"],"prefix":"10.1007","author":[{"given":"Nanami","family":"Tsuji","sequence":"first","affiliation":[]},{"given":"Yusuke","family":"Sakumoto","sequence":"additional","affiliation":[]},{"given":"Hiroyuki","family":"Ohsaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,29]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"S Alpern","year":"1999","unstructured":"Alpern, S., Baston, V.J., Essegaier, S.: Rendezvous search on a graph. J. Appl. Probab. 36(1), 223\u2013231 (1999)","journal-title":"J. Appl. Probab."},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/11682462_60","volume-title":"LATIN 2006: Theoretical Informatics","author":"E Kranakis","year":"2006","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: Mobile agent rendezvous in a synchronous torus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 653\u2013664. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_60"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/opre.50.5.772.363","volume":"50","author":"S Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50, 751\u2013922 (2002)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Ribeiro, R., Silvestre, D., Silvestre, C.: A rendezvous algorithm for multi-agent systems in disconnected network topologies. In: Proceedings of the 28th Mediterranean Conference on Control and Automation (MED 2020), pp.\u00a0592\u2013597 (2020)","key":"18_CR4","DOI":"10.1109\/MED48518.2020.9183093"},{"unstructured":"Thomas, S., Luca, Z.: Random walks on dynamic graphs: mixing times, hittingtimes, and return probabilities. arXiv:1903.01342 (2019)","key":"18_CR5"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331\u2013347 (2012)","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010), pp.\u00a0450\u2013459 (2010)","key":"18_CR7","DOI":"10.1145\/1835698.1835801"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-69084-1_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"F Ooshita","year":"2017","unstructured":"Ooshita, F., Datta, A.K., Masuzawa, T.: Self-stabilizing rendezvous of synchronous mobile agents in graphs. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 18\u201332. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_2"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/3-540-61440-0_163","volume-title":"Automata, Languages and Programming","author":"X Yu","year":"1996","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 610\u2013621. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61440-0_163"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1002\/nav.1044","volume":"48","author":"V Baston","year":"2001","unstructured":"Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Nav. Res. Logist. (NRL) 48, 722\u2013731 (2001)","journal-title":"Nav. Res. Logist. (NRL)"},{"doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management (CIKM 2010), pp.\u00a0499\u2013508 (2010)","key":"18_CR11","DOI":"10.1145\/1871437.1871503"},{"doi-asserted-by":"crossref","unstructured":"Toyoda, F., Sakumoto, Y., Ohsaki, H.: Proposal of an efficient blind search utilizing the rendezvous of random walk agents. In: Proceedings of the 44th IEEE Computer Society Signature Conference on Computers, Software, and Applications (COMPSAC 2020), pp.\u00a0568\u2013575 (2020)","key":"18_CR12","DOI":"10.1109\/COMPSAC48688.2020.0-192"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL B\u00e1rabasi","year":"1999","unstructured":"B\u00e1rabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th Association for the Advancement of Artificial Intelligence (AAAI 2015), pp.\u00a04292\u20134293 (2015)","key":"18_CR14","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-019-0591-9","volume":"9","author":"Z Ghalmane","year":"2019","unstructured":"Ghalmane, Z., Hassouni, M.E., Cherifi, H.: Immunization of networks with non-overlapping community structure. Soc. Netw. Anal. Min. 9, 1\u201322 (2019)","journal-title":"Soc. Netw. Anal. Min."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato, S., Hric, D.: Community detection in networks: a user guide. Phys. Rep. 659, 1\u201344 (2016)","journal-title":"Phys. Rep."},{"issue":"12","key":"18_CR17","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1109\/TKDE.2018.2819980","volume":"30","author":"L Liao","year":"2018","unstructured":"Liao, L., He, X., Zhang, H., Chua, T.-S.: Attributed social network embedding. IEEE Trans. Knowl. Data Eng. 30(12), 2257\u20132270 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1587\/transcom.2020EBP3093","volume":"104","author":"Y Sakumoto","year":"2021","unstructured":"Sakumoto, Y., Ohsaki, H.: Graph degree heterogeneity facilitates random walker meetings. IEICE Trans. Commun. 104, 604\u2013615 (2021)","journal-title":"IEICE Trans. Commun."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud, A.L., Mucha, P.J., Porter, M.A.: Social structure of Facebook networks. Physica A 391, 4165\u20134180 (2012)","journal-title":"Physica A"},{"doi-asserted-by":"crossref","unstructured":"Nguyen, G.H., Lee, J.B., Rossi, R.A., Ahmed, N.K., Koh, E., Kim, S.: Continuous-time dynamic network embeddings. In: Companion Proceedings of the Web Conference 2018 (WWW 2018), pp.\u00a0969\u2013976 (2018)","key":"18_CR20","DOI":"10.1145\/3184558.3191526"},{"issue":"6","key":"18_CR21","doi-asserted-by":"publisher","first-page":"3699","DOI":"10.1109\/TSMC.2019.2932913","volume":"51","author":"J Chen","year":"2021","unstructured":"Chen, J., et al.: E-LSTM-D: a deep learning framework for dynamic network link prediction. IEEE Trans. Syst. Man Cybern.: Syst. 51(6), 3699\u20133712 (2021)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Intelligent Networking and Collaborative Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40971-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T04:11:22Z","timestamp":1693195882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40971-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031409707","9783031409714"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40971-4_18","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Networking and Collaborative Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai University","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incos2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/incos\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}