{"id":"https://openalex.org/W4210808939","doi":"https://doi.org/10.1109/icoin53446.2022.9687190","title":"On Accelerating Multiple Random Walks with Loose Cooperation","display_name":"On Accelerating Multiple Random Walks with Loose Cooperation","publication_year":2022,"publication_date":"2022-01-12","ids":{"openalex":"https://openalex.org/W4210808939","doi":"https://doi.org/10.1109/icoin53446.2022.9687190"},"language":"en","primary_location":{"id":"doi:10.1109/icoin53446.2022.9687190","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin53446.2022.9687190","pdf_url":null,"source":{"id":"https://openalex.org/S4363608592","display_name":"2022 International Conference on Information Networking (ICOIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Information Networking (ICOIN)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076320781","display_name":"Jo Hagikura","orcid":null},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jo Hagikura","raw_affiliation_strings":["Graduate School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan","institution_ids":["https://openalex.org/I206011266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112372365","display_name":"Ryotaro Matsuo","orcid":null},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryotaro Matsuo","raw_affiliation_strings":["Graduate School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan","institution_ids":["https://openalex.org/I206011266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018099452","display_name":"Hiroyuki Ohsaki","orcid":"https://orcid.org/0000-0003-0539-112X"},"institutions":[{"id":"https://openalex.org/I206011266","display_name":"Kwansei Gakuin University","ror":"https://ror.org/02qf2tx24","country_code":"JP","type":"education","lineage":["https://openalex.org/I206011266"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroyuki Ohsaki","raw_affiliation_strings":["Graduate School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan","institution_ids":["https://openalex.org/I206011266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I206011266"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00933197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"238","last_page":"243"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.9226830005645752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6065767407417297},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5534296035766602},{"id":"https://openalex.org/keywords/random-walker-algorithm","display_name":"Random walker algorithm","score":0.5076988935470581},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.48914793133735657},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4607665538787842},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40337130427360535},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3777843117713928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3544160723686218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3202030062675476},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15926936268806458}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.9226830005645752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6065767407417297},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5534296035766602},{"id":"https://openalex.org/C105045736","wikidata":"https://www.wikidata.org/wiki/Q7292002","display_name":"Random walker algorithm","level":3,"score":0.5076988935470581},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48914793133735657},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4607665538787842},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40337130427360535},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3777843117713928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3544160723686218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3202030062675476},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15926936268806458},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icoin53446.2022.9687190","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin53446.2022.9687190","pdf_url":null,"source":{"id":"https://openalex.org/S4363608592","display_name":"2022 International Conference on Information Networking (ICOIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Information Networking (ICOIN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2008620264","https://openalex.org/W2015331738","https://openalex.org/W2046919262","https://openalex.org/W2060540871","https://openalex.org/W2107082801","https://openalex.org/W2117822229","https://openalex.org/W2150887734","https://openalex.org/W2167167562","https://openalex.org/W2281441226","https://openalex.org/W2755627957","https://openalex.org/W2932190792","https://openalex.org/W3024059009","https://openalex.org/W3136290985"],"related_works":["https://openalex.org/W1973641485","https://openalex.org/W2472745029","https://openalex.org/W2064285815","https://openalex.org/W2000620996","https://openalex.org/W3171278913","https://openalex.org/W4287163214","https://openalex.org/W2793605182","https://openalex.org/W3163695673","https://openalex.org/W2900071037","https://openalex.org/W2760154051"],"abstract_inverted_index":{"In":[0,77,144],"recent":[1],"years,":[2],"random":[3,30,52,73,100,110,116,121],"walks":[4,31,53,101,117],"on":[5,24,32,54,102],"graphs":[6,33,103],"have":[7],"been":[8,75],"actively":[9],"studied":[10],"because":[11],"of":[12,48,51,72,88,108],"their":[13],"potential":[14],"applications":[15],"to":[16,44,84,91,131,133,164],"explorations":[17],"in":[18,98],"unknown":[19],"networks":[20],"and":[21,39,65,68,158,180],"information":[22],"searches":[23],"networks.":[25],"Typical":[26],"properties":[27,50],"that":[28,135,172],"characterize":[29],"are":[34],"the":[35,40,46,49,70,86,92,106,109,150,153,159,176,181,190],"first":[36,155],"passage":[37,156,178],"time":[38,157,162,179,184],"cover":[41,161,183],"time.":[42],"Approaches":[43],"improve":[45],"efficiency":[47],"graphs\u2014for":[55],"example,":[56],"using":[57],"mobile":[58,96,126],"agents":[59,97],"with":[60,189],"capabilities":[61],"such":[62],"as":[63,138,142],"memory":[64],"local":[66],"awareness":[67],"increasing":[69],"multiplicity":[71],"walks\u2014have":[74],"studied.":[76],"this":[78],"paper,":[79],"we":[80,113,146],"propose":[81,114],"a":[82],"method":[83],"reduce":[85,175],"number":[87],"redundant":[89],"visits":[90,137],"same":[93],"node":[94,130],"by":[95,185],"multiple":[99,115],"while":[104],"maintaining":[105],"simplicity":[107],"walk.":[111],"Specifically,":[112],"called":[118],"loosely":[119],"cooperative":[120],"walk":[122],"(LC-RW),":[123],"where":[124],"each":[125],"agent":[127],"decides":[128],"which":[129],"move":[132],"so":[134],"it":[136],"many":[139],"different":[140],"nodes":[141],"possible.":[143],"addition,":[145],"investigate":[147],"how":[148],"much":[149],"LC-RW":[151,173],"reduces":[152],"mean":[154,160],"compared":[163,188],"existing":[165,191],"random-walk-based":[166],"graph":[167,192],"exploration":[168,193],"methods.":[169,194],"We":[170],"found":[171],"can":[174],"average":[177,182],"approximately":[186],"5\u201310%":[187]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}