{"id":"https://openalex.org/W3111024254","doi":"https://doi.org/10.1587/transcom.2020ebp3093","title":"Graph Degree Heterogeneity Facilitates Random Walker Meetings","display_name":"Graph Degree Heterogeneity Facilitates Random Walker Meetings","publication_year":2020,"publication_date":"2020-12-13","ids":{"openalex":"https://openalex.org/W3111024254","doi":"https://doi.org/10.1587/transcom.2020ebp3093","mag":"3111024254"},"language":"en","primary_location":{"id":"doi:10.1587/transcom.2020ebp3093","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.2020ebp3093","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Communications","raw_type":"journal-article"},"type":"article","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/A5110231313","display_name":"Yusuke Sakumoto","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":"Yusuke SAKUMOTO","raw_affiliation_strings":["Kwansei Gakuin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kwansei Gakuin University","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":["Kwansei Gakuin University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kwansei Gakuin University","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.4637,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68200668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"E104.B","issue":"6","first_page":"604","last_page":"615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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.9984999895095825,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7751275300979614},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.6500430107116699},{"id":"https://openalex.org/keywords/random-walker-algorithm","display_name":"Random walker algorithm","score":0.581484317779541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5655588507652283},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5168643593788147},{"id":"https://openalex.org/keywords/rendezvous","display_name":"Rendezvous","score":0.4698426127433777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3683812916278839},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35898375511169434},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3265148997306824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2747628092765808},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12661990523338318}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7751275300979614},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.6500430107116699},{"id":"https://openalex.org/C105045736","wikidata":"https://www.wikidata.org/wiki/Q7292002","display_name":"Random walker algorithm","level":3,"score":0.581484317779541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5655588507652283},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5168643593788147},{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.4698426127433777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3683812916278839},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35898375511169434},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3265148997306824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2747628092765808},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12661990523338318},{"id":"https://openalex.org/C29829512","wikidata":"https://www.wikidata.org/wiki/Q40218","display_name":"Spacecraft","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace 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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transcom.2020ebp3093","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transcom.2020ebp3093","pdf_url":null,"source":{"id":"https://openalex.org/S2493627025","display_name":"IEICE Transactions on Communications","issn_l":"0916-8516","issn":["0916-8516","1745-1345"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G245107564","display_name":"Design of the Low-Load Method to Fast Find a Specific Person in Social Networks","funder_award_id":"19K11927","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1498386419","https://openalex.org/W1967434633","https://openalex.org/W1970647593","https://openalex.org/W1992285228","https://openalex.org/W2008620264","https://openalex.org/W2010875998","https://openalex.org/W2039765418","https://openalex.org/W2095530310","https://openalex.org/W2107082801","https://openalex.org/W2143724577","https://openalex.org/W2281441226","https://openalex.org/W3014739137","https://openalex.org/W4211160041","https://openalex.org/W4243132303","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W1973641485","https://openalex.org/W2472745029","https://openalex.org/W2064285815","https://openalex.org/W2000620996","https://openalex.org/W3163695673","https://openalex.org/W3171278913","https://openalex.org/W4287163214","https://openalex.org/W2793605182","https://openalex.org/W2900071037","https://openalex.org/W2760154051"],"abstract_inverted_index":{"Various":[0],"graph":[1,23,64,142,164,252,265],"algorithms":[2],"have":[3],"been":[4,109],"developed":[5],"with":[6],"multiple":[7,27,32,55,73,105,131],"random":[8,15,28,33,56,74,106,132,215,282],"walks,":[9],"the":[10,51,68,79,91,126,139,150,154,160,169,173,179,190,203,211,220,225,231,234,248,251,255,261,267,270,279],"movement":[11],"of":[12,41,50,104,114,130,141,153,162,172,210,214,222,224,237,250,264,269,281],"several":[13],"independent":[14,209],"walkers":[16,75],"on":[17,26,62,118,144,159,254],"a":[18,38,63,83,94],"graph.":[19,84,226],"Designing":[20],"an":[21],"efficient":[22],"algorithm":[24],"based":[25],"walks":[29,34,107,133],"requires":[30],"investigating":[31],"theoretically":[35],"to":[36,76,90,260],"attain":[37],"deep":[39],"understanding":[40,247],"their":[42],"characteristics.":[43],"The":[44,58,100,183],"first":[45,59,101,127,156,175,192,205,256],"meeting":[46,60,102,128,157,176,193,206,257,280],"time":[47,61,69,86,103,129,158,177,194,207],"is":[48,65,87,195,208,219,244],"one":[49],"important":[52],"metrics":[53],"for":[54,72,246,275],"walks.":[57],"defined":[66],"by":[67,198],"it":[70],"takes":[71],"meet":[77],"at":[78],"same":[80],"node":[81,239],"in":[82,97,134],"This":[85],"closely":[88],"related":[89],"rendezvous":[92],"problem,":[93],"fundamental":[95],"problem":[96],"computer":[98],"science.":[99],"has":[108],"analyzed":[110],"previously,":[111],"but":[112],"many":[113],"these":[115],"analyses":[116],"focused":[117],"regular":[119],"graphs.":[120],"In":[121],"this":[122],"paper,":[123],"we":[124,148,167],"analyze":[125],"arbitrary":[135],"graphs":[136],"and":[137,201,228,233],"clarify":[138],"effects":[140],"structures":[143],"expected":[145,155,174,191,204],"values.":[146],"First,":[147],"derive":[149],"spectral":[151,163,181],"formula":[152],"basis":[161],"theory.":[165],"Then,":[166],"examine":[168],"principal":[170,185],"component":[171,186],"using":[178],"derived":[180],"formula.":[182],"clarified":[184],"reveals":[187],"that":[188],"(a)":[189,243],"almost":[196],"dominated":[197],"$n/(1+d_{\\rm":[199],"std}^2/d_{\\rmavg}^2)$":[200],"(b)":[202],"starting":[212],"nodes":[213,223],"walkers,":[216],"where":[217],"n":[218],"number":[221],"davg":[227],"dstd":[229],"are":[230],"average":[232],"standard":[235],"deviation":[236],"weighted":[238,276],"degrees,":[240],"respectively.":[241],"Characteristic":[242],"useful":[245],"effect":[249,263],"structure":[253],"time.":[258],"According":[259],"revealed":[262],"structures,":[266],"variance":[268],"coefficient":[271],"dstd/davg":[272],"(degree":[273],"heterogeneity)":[274],"degrees":[277],"facilitates":[278],"walkers.":[283]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}