{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:21:19Z","timestamp":1756383679183,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1,12]]},"DOI":"10.1109\/icoin53446.2022.9687140","type":"proceedings-article","created":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T21:55:09Z","timestamp":1643320509000},"page":"232-237","source":"Crossref","is-referenced-by-count":5,"title":["Random Walk on a Graph with Vicinity Avoidance"],"prefix":"10.1109","author":[{"given":"Keita","family":"Kitaura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryotaro","family":"Matsuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Ohsaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Hitting times for non-backtracking random walks","author":"fasino","year":"2021","journal-title":"arXiv preprint arXiv 2105 14438"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.062159"},{"key":"ref12","first-page":"290","article-title":"On random graphs I","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"The Journal of Mathematica"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/38\/45\/002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/38\/1\/007"},{"key":"ref4","first-page":"1","article-title":"A study on the cooperative search using multiple random walks in unstructured network","volume":"118","author":"sakumoto","year":"2018","journal-title":"IEICE Tech Rep"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2017.61"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.118701"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.20461"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2926033"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511369"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.89.012803"}],"event":{"name":"2022 International Conference on Information Networking (ICOIN)","start":{"date-parts":[[2022,1,12]]},"location":"Jeju-si, Korea, Republic of","end":{"date-parts":[[2022,1,15]]}},"container-title":["2022 International Conference on Information Networking (ICOIN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9687102\/9687106\/09687140.pdf?arnumber=9687140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T21:26:57Z","timestamp":1650922017000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9687140\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,12]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icoin53446.2022.9687140","relation":{},"subject":[],"published":{"date-parts":[[2022,1,12]]}}}