{"id":"https://openalex.org/W1982490730","doi":"https://doi.org/10.1109/itw.2006.1633783","title":"Fast Gossip via Non-reversible Random Walk","display_name":"Fast Gossip via Non-reversible Random Walk","publication_year":2006,"publication_date":"2006-05-25","ids":{"openalex":"https://openalex.org/W1982490730","doi":"https://doi.org/10.1109/itw.2006.1633783","mag":"1982490730"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2006.1633783","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Information Theory Workshop","raw_type":"proceedings-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/A5077832834","display_name":"Kyomin Jung","orcid":"https://orcid.org/0000-0003-2547-7051"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kyomin Jung","raw_affiliation_strings":["MIT, USA","MIT, Email: kmjung@mit.edu"],"affiliations":[{"raw_affiliation_string":"MIT, USA","institution_ids":[]},{"raw_affiliation_string":"MIT, Email: kmjung@mit.edu","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029499294","display_name":"Devavrat Shah","orcid":"https://orcid.org/0000-0003-0737-3259"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Shah","raw_affiliation_strings":["MIT, USA","Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"MIT, USA","institution_ids":[]},{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077832834"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.205,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88519978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"10","issue":null,"first_page":"67","last_page":"71"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9968000054359436,"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.7604154944419861},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.7091290950775146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6582679748535156},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.5941964983940125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5243135690689087},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5088396668434143},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4982016086578369},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.47392138838768005},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.473678857088089},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4490457773208618},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4399959444999695},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4379422962665558},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43108874559402466},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4155632257461548},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4006000757217407},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36934152245521545},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.35985612869262695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2959829270839691},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1424694061279297},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13298159837722778},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1258329153060913}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7604154944419861},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.7091290950775146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6582679748535156},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.5941964983940125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5243135690689087},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5088396668434143},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4982016086578369},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.47392138838768005},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.473678857088089},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4490457773208618},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4399959444999695},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4379422962665558},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43108874559402466},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4155632257461548},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4006000757217407},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36934152245521545},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.35985612869262695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2959829270839691},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1424694061279297},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13298159837722778},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1258329153060913},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw.2006.1633783","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633783","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Information Theory Workshop","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.161.7287","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.7287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.kaist.ac.kr/~kyomin/ITW06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1547358136","https://openalex.org/W1964932074","https://openalex.org/W1975146994","https://openalex.org/W1981234161","https://openalex.org/W1985215886","https://openalex.org/W2009070933","https://openalex.org/W2090251478","https://openalex.org/W2101517602","https://openalex.org/W2110100895","https://openalex.org/W2119098504","https://openalex.org/W2152652256","https://openalex.org/W2157004711","https://openalex.org/W2158886595"],"related_works":["https://openalex.org/W4386850441","https://openalex.org/W2479311294","https://openalex.org/W2094020986","https://openalex.org/W2028973390","https://openalex.org/W4236832331","https://openalex.org/W12419204","https://openalex.org/W2340554994","https://openalex.org/W2067462320","https://openalex.org/W2117892471","https://openalex.org/W2000880192"],"abstract_inverted_index":{"Distributed":[0],"computation":[1],"of":[2,18,60,66,87,95,119,167,188,208,217,222,235],"average":[3,111,134,152],"is":[4,89,143,159,220],"essential":[5],"for":[6,63,146,156,231],"many":[7],"tasks":[8],"such":[9],"as":[10],"estimation,":[11],"eigenvalue":[12],"computation,":[13],"scheduling":[14],"in":[15,47,57,135,153,170,181],"the":[16,28,58,67,80,84,92,140,178,185,203,223],"context":[17,59],"wireless":[19,25,49],"sensor":[20,50],"and":[21,72,211],"ad-hoc":[22],"networks.":[23],"The":[24,214],"communication":[26],"imposes":[27],"gossip":[29,61],"constraint:":[30],"each":[31],"node":[32,40],"can":[33],"communicate":[34],"with":[35],"at":[36,41],"most":[37],"one":[38],"other":[39],"a":[42,113,136,147,232],"given":[43],"time.":[44],"Recent":[45],"interest":[46],"emerging":[48],"network":[51,81],"has":[52],"led":[53],"to":[54,109,132,150,162],"exciting":[55],"developments":[56],"algorithms":[62,69,169,199],"averaging.":[64],"Most":[65],"known":[68],"are":[70],"iterative":[71],"based":[73],"on":[74,79,112],"certain":[75],"reversible":[76,96,228],"random":[77,97,193,206,229],"walk":[78,230],"graph.":[82],"Subsequently,":[83],"running":[85,215],"time":[86,108,131,155,216,224],"algorithm":[88,128,149,219],"affected":[90],"by":[91,200,226],"diffusive":[93,165,186],"nature":[94,187],"walk.":[98],"For":[99],"example,":[100],"they":[101],"take":[102],"\u03a9(n":[103],"<sup":[104],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[105],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[106],")":[107],"compute":[110,133,151],"simple":[114],"path":[115,157],"or":[116],"ring":[117],"graph":[118],"n":[120],"nodes.":[121],"In":[122,173],"contrast,":[123],"an":[124],"optimal":[125],"(simple)":[126],"centralized":[127],"takes":[129],"[unk](n)":[130],"path.":[137,238],"This":[138],"raises":[139],"following":[141],"questions:":[142],"it":[144,160],"possible":[145,161],"distributed":[148],"O(n)":[154],"graph?":[158],"improve":[163],"over":[164],"behavior":[166],"current":[168],"arbitrary":[171],"graphs?":[172],"this":[174],"paper,":[175],"we":[176,190,196],"answer":[177],"above":[179],"questions":[180],"affirmative.":[182],"To":[183],"overcome":[184],"algorithms,":[189],"utilize":[191],"non-reversible":[192,205],"walks.":[194],"Specifically,":[195],"design":[197],"our":[198,218],"\"projecting":[201],"down\"":[202],"\"lifted\"":[204],"walks":[207],"Diaconis-Holmes-Neal":[209],"(2000)":[210],"Chen-Lovasz-Pak":[212],"(1999).":[213],"square-root":[221],"taken":[225],"corresponding":[227],"large":[233],"class":[234],"graphs":[236],"including":[237]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}