{"id":"https://openalex.org/W1501429410","doi":"https://doi.org/10.1109/infocom.2015.7218566","title":"On the efficiency-optimal Markov chains for distributed networking applications","display_name":"On the efficiency-optimal Markov chains for distributed networking applications","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1501429410","doi":"https://doi.org/10.1109/infocom.2015.7218566","mag":"1501429410"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2015.7218566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2015.7218566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications (INFOCOM)","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/A5100622996","display_name":"Chul\u2010Ho Lee","orcid":"https://orcid.org/0000-0003-1570-8688"},"institutions":[{"id":"https://openalex.org/I2250650973","display_name":"Samsung (South Korea)","ror":"https://ror.org/04w3jy968","country_code":"KR","type":"company","lineage":["https://openalex.org/I2250650973"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chul-Ho Lee","raw_affiliation_strings":["DMC R&D Center, Samsung Electronics, Korea","[DMC R&D Center, Samsung Electronics, Korea]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DMC R&D Center, Samsung Electronics, Korea","institution_ids":["https://openalex.org/I2250650973"]},{"raw_affiliation_string":"[DMC R&D Center, Samsung Electronics, Korea]","institution_ids":["https://openalex.org/I2250650973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050655327","display_name":"Do Young Eun","orcid":"https://orcid.org/0000-0002-1743-7482"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Do Young Eun","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","[Dept of Electrical & Computer Engg., North Carolina State University, Raleigh, NC, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"[Dept of Electrical & Computer Engg., North Carolina State University, Raleigh, NC, USA]","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.02523572,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"46","issue":null,"first_page":"1840","last_page":"1848"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9987000226974487,"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.9976000189781189,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"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/computer-science","display_name":"Computer science","score":0.7203071713447571},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.707533597946167},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6622036695480347},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.609087347984314},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.5401119589805603},{"id":"https://openalex.org/keywords/stationary-distribution","display_name":"Stationary distribution","score":0.5264699459075928},{"id":"https://openalex.org/keywords/crawling","display_name":"Crawling","score":0.5049226880073547},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4779508113861084},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.44974663853645325},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.41788172721862793},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.41552799940109253},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.4128755033016205},{"id":"https://openalex.org/keywords/metropolis\u2013hastings-algorithm","display_name":"Metropolis\u2013Hastings algorithm","score":0.4126942753791809},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38587647676467896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38565030694007874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3738287091255188},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.26767969131469727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2178635597229004},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14636772871017456},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1134539544582367},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10976099967956543},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09448078274726868}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7203071713447571},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.707533597946167},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6622036695480347},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.609087347984314},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.5401119589805603},{"id":"https://openalex.org/C98951983","wikidata":"https://www.wikidata.org/wiki/Q7604341","display_name":"Stationary distribution","level":3,"score":0.5264699459075928},{"id":"https://openalex.org/C100368936","wikidata":"https://www.wikidata.org/wiki/Q1411725","display_name":"Crawling","level":2,"score":0.5049226880073547},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4779508113861084},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.44974663853645325},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.41788172721862793},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.41552799940109253},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.4128755033016205},{"id":"https://openalex.org/C204693719","wikidata":"https://www.wikidata.org/wiki/Q910810","display_name":"Metropolis\u2013Hastings algorithm","level":4,"score":0.4126942753791809},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38587647676467896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38565030694007874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3738287091255188},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26767969131469727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2178635597229004},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14636772871017456},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1134539544582367},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10976099967956543},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09448078274726868},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C105702510","wikidata":"https://www.wikidata.org/wiki/Q514","display_name":"Anatomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2015.7218566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2015.7218566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Conference on Computer Communications (INFOCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1549544029","https://openalex.org/W1586184796","https://openalex.org/W1982490730","https://openalex.org/W1985215886","https://openalex.org/W2002545270","https://openalex.org/W2005548917","https://openalex.org/W2007219304","https://openalex.org/W2028836627","https://openalex.org/W2029596791","https://openalex.org/W2040927601","https://openalex.org/W2047109664","https://openalex.org/W2056760934","https://openalex.org/W2090081488","https://openalex.org/W2090251478","https://openalex.org/W2095724373","https://openalex.org/W2107082801","https://openalex.org/W2110117460","https://openalex.org/W2112090702","https://openalex.org/W2114202040","https://openalex.org/W2115166029","https://openalex.org/W2117905067","https://openalex.org/W2122891730","https://openalex.org/W2134711723","https://openalex.org/W2135543149","https://openalex.org/W2138309709","https://openalex.org/W2142623799","https://openalex.org/W2146324812","https://openalex.org/W2147256592","https://openalex.org/W2162114800","https://openalex.org/W2164328519","https://openalex.org/W2167011266","https://openalex.org/W2170358724","https://openalex.org/W2293974546","https://openalex.org/W2400453370","https://openalex.org/W2471517265","https://openalex.org/W3032120536","https://openalex.org/W3100428187","https://openalex.org/W4214911418","https://openalex.org/W4243132303","https://openalex.org/W4245558686","https://openalex.org/W4246933290","https://openalex.org/W4388311596","https://openalex.org/W6633030040","https://openalex.org/W6646067589","https://openalex.org/W6677414422","https://openalex.org/W6712488688"],"related_works":["https://openalex.org/W4393220254","https://openalex.org/W4321258516","https://openalex.org/W2051833850","https://openalex.org/W4287845917","https://openalex.org/W3156164993","https://openalex.org/W2385015894","https://openalex.org/W4241547694","https://openalex.org/W4381510237","https://openalex.org/W1980467795","https://openalex.org/W2506945978"],"abstract_inverted_index":{"The":[0],"Metropolis-Hastings":[1],"(MH)":[2],"algorithm,":[3],"in":[4,60,69,98,121,124,127],"addition":[5],"to":[6,73,158],"its":[7,78,87],"application":[8],"for":[9,21],"Markov":[10,118],"Chain":[11],"Monte":[12],"Carlo":[13],"sampling":[14,39],"or":[15,43,49],"simulation,":[16],"has":[17],"been":[18],"popularly":[19],"used":[20],"constructing":[22],"a":[23,28,34,75,106,168],"random":[24,89],"walk":[25,90],"that":[26,155],"achieves":[27],"given,":[29],"desired":[30,178],"stationary":[31,179],"distribution":[32,180],"over":[33,163],"graph.":[35],"Applications":[36],"include":[37],"crawling-based":[38],"of":[40,54,86,101,112,115,129,132,142],"large":[41],"graphs":[42],"online":[44],"social":[45],"networks,":[46,63,72],"statistical":[47],"estimation":[48],"inference":[50],"from":[51],"massive":[52],"scale":[53],"networked":[55],"data,":[56],"efficient":[57,97],"searching":[58],"algorithms":[59,154],"unstructured":[61],"peer-to-peer":[62],"randomized":[64],"routing":[65],"and":[66,120,135,170],"movement":[67],"strategies":[68],"wireless":[70],"sensor":[71],"list":[74],"few.":[76],"Despite":[77],"versatility,":[79],"the":[80,99,102,160,176],"MH":[81,161],"algorithm":[82,162],"often":[83],"causes":[84],"self-transitions":[85],"resulting":[88],"at":[91],"some":[92],"nodes,":[93],"which":[94],"is":[95],"not":[96],"sense":[100],"Peskun":[103],"ordering":[104],"-":[105],"partial":[107],"order":[108],"between":[109],"off-diagonal":[110],"elements":[111],"transition":[113],"matrices":[114],"two":[116],"different":[117],"chains,":[119],"turn":[122],"results":[123],"deficient":[125],"performance":[126],"terms":[128],"asymptotic":[130],"variance":[131],"time":[133,164],"averages":[134],"expected":[136],"hitting":[137],"times":[138],"with":[139],"slower":[140],"speed":[141],"convergence.":[143],"To":[144],"alleviate":[145],"this":[146],"problem,":[147],"we":[148],"present":[149],"simple":[150],"yet":[151],"effective":[152],"distributed":[153],"are":[156],"guaranteed":[157],"improve":[159],"when":[165],"running":[166],"on":[167],"graph,":[169],"eventually":[171],"reach":[172],"`efficiency-optimality',":[173],"while":[174],"ensuring":[175],"same":[177],"throughout.":[181]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}