{"id":"https://openalex.org/W2112730648","doi":"https://doi.org/10.1109/fcst.2009.74","title":"A Random-Walk-Based Dynamic Tree Evolution Algorithm with Exponential Speed of Convergence to Optimality on Regular Networks","display_name":"A Random-Walk-Based Dynamic Tree Evolution Algorithm with Exponential Speed of Convergence to Optimality on Regular Networks","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2112730648","doi":"https://doi.org/10.1109/fcst.2009.74","mag":"2112730648"},"language":"en","primary_location":{"id":"doi:10.1109/fcst.2009.74","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fcst.2009.74","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Fourth International Conference on Frontier of Computer Science and Technology","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/A5087894632","display_name":"Keqin Li","orcid":"https://orcid.org/0000-0001-5224-4048"},"institutions":[{"id":"https://openalex.org/I1327163397","display_name":"State University of New York","ror":"https://ror.org/01q1z8k08","country_code":"US","type":"education","lineage":["https://openalex.org/I1327163397"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Keqin Li","raw_affiliation_strings":["Department of Computer Science, State University of New York, New York, USA","Dept. of Comput. Sci., State Univ. of New York, New Paltz, NY, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York, New York, USA","institution_ids":["https://openalex.org/I1327163397"]},{"raw_affiliation_string":"Dept. of Comput. Sci., State Univ. of New York, New Paltz, NY, USA#TAB#","institution_ids":["https://openalex.org/I1327163397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087894632"],"corresponding_institution_ids":["https://openalex.org/I1327163397"],"apc_list":null,"apc_paid":null,"fwci":0.6856,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71917753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"85"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9922999739646912,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9908000230789185,"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/speedup","display_name":"Speedup","score":0.7136927843093872},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6795503497123718},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6701583862304688},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6383675336837769},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.6279823780059814},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5782495737075806},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5696772933006287},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5579283237457275},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.5090157985687256},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.49813151359558105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4485729932785034},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39029768109321594},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37397852540016174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2882078289985657},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2855686545372009},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2542220950126648},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.20465171337127686},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1351911723613739}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7136927843093872},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6795503497123718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6701583862304688},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6383675336837769},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6279823780059814},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5782495737075806},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5696772933006287},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5579283237457275},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.5090157985687256},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.49813151359558105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4485729932785034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39029768109321594},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37397852540016174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2882078289985657},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2855686545372009},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2542220950126648},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.20465171337127686},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1351911723613739},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fcst.2009.74","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fcst.2009.74","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Fourth International Conference on Frontier of Computer Science and Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W20624280","https://openalex.org/W45824510","https://openalex.org/W1589331344","https://openalex.org/W1646038686","https://openalex.org/W1698396769","https://openalex.org/W1967644553","https://openalex.org/W1981467920","https://openalex.org/W1993418693","https://openalex.org/W2010709067","https://openalex.org/W2011337949","https://openalex.org/W2012223233","https://openalex.org/W2024489275","https://openalex.org/W2039299463","https://openalex.org/W2042112191","https://openalex.org/W2056986113","https://openalex.org/W2069192107","https://openalex.org/W2080806579","https://openalex.org/W2094300188","https://openalex.org/W2097755092","https://openalex.org/W2103215914","https://openalex.org/W2129259156","https://openalex.org/W2135637754","https://openalex.org/W2157567018","https://openalex.org/W2319958627","https://openalex.org/W2323784209","https://openalex.org/W2568511220","https://openalex.org/W2751862591","https://openalex.org/W2753933954","https://openalex.org/W4297962570","https://openalex.org/W6600874913","https://openalex.org/W6636945615","https://openalex.org/W6649455737","https://openalex.org/W7038906009"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W2112730648"],"abstract_inverted_index":{"In":[0],"many":[1],"tree-structured":[2],"parallel":[3,15],"computations,":[4],"the":[5,26,29,41,49,53,56,61,65,83,103,108,113,121],"size":[6],"and":[7,70,100],"shape":[8],"of":[9,28,55,68,82,124],"a":[10,14,38,88,125,129],"tree":[11,22,43,50,94],"that":[12,59,71,120],"represents":[13],"computation":[16],"is":[17,35,46,117,132],"unpredictable":[18],"at":[19,106],"compile-time.":[20],"The":[21,79],"evolves":[23],"gradually":[24],"during":[25],"course":[27],"computation.":[30],"When":[31],"such":[32,58],"an":[33],"application":[34],"executed":[36],"on":[37,97,128],"static":[39],"network,":[40],"dynamic":[42,93],"evolution":[44,95],"problem":[45],"to":[47,52,76,86,101,112,118],"distribute":[48],"nodes":[51,73],"processors":[54,62],"network":[57,131],"all":[60],"receive":[63],"roughly":[64],"same":[66],"amount":[67],"load":[69],"communicating":[72],"are":[74,85],"assigned":[75],"neighboring":[77],"processors.":[78],"main":[80],"contributions":[81],"paper":[84],"describe":[87],"simple":[89],"random-walk-based":[90],"asymptotically":[91],"optimal":[92],"algorithm":[96],"regular":[98,130],"networks":[99],"analyze":[102],"exponential":[104],"speed":[105],"which":[107],"performance":[109],"ratio":[110],"converges":[111],"optimal.":[114],"Our":[115],"strategy":[116],"prove":[119],"Markov":[122],"chain":[123],"random":[126],"walk":[127],"rapidly":[133],"mixing.":[134]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}