{"id":"https://openalex.org/W3011199693","doi":"https://doi.org/10.1109/cdc40024.2019.9029773","title":"Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm","display_name":"Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3011199693","doi":"https://doi.org/10.1109/cdc40024.2019.9029773","mag":"3011199693"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9029773","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","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/A5016761365","display_name":"Yuanqiu Mo","orcid":"https://orcid.org/0000-0002-0500-5201"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuanqiu Mo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003042086","display_name":"Soura Dasgupta","orcid":"https://orcid.org/0000-0001-6633-2938"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soura Dasgupta","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020446837","display_name":"Jacob Beal","orcid":"https://orcid.org/0000-0002-1663-5102"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jacob Beal","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016761365"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1768,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57965717,"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":"1868","last_page":"1873"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":1.0,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987999796867371,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9955999851226807,"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/bounded-function","display_name":"Bounded function","score":0.6870575547218323},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6525673270225525},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5899609327316284},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5226152539253235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49668818712234497},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.46106940507888794},{"id":"https://openalex.org/keywords/exponential-stability","display_name":"Exponential stability","score":0.43500828742980957},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4302579164505005},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.42908427119255066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42386043071746826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3855992257595062},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38020506501197815},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21876895427703857},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16010397672653198},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.13609391450881958}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6870575547218323},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6525673270225525},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5899609327316284},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5226152539253235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49668818712234497},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.46106940507888794},{"id":"https://openalex.org/C167964875","wikidata":"https://www.wikidata.org/wiki/Q17011487","display_name":"Exponential stability","level":3,"score":0.43500828742980957},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4302579164505005},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.42908427119255066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42386043071746826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3855992257595062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38020506501197815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21876895427703857},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16010397672653198},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.13609391450881958},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc40024.2019.9029773","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9029773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6499999761581421,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W13976994","https://openalex.org/W14096389","https://openalex.org/W1500784773","https://openalex.org/W1581205238","https://openalex.org/W1590227327","https://openalex.org/W1801319046","https://openalex.org/W1908995852","https://openalex.org/W1934455175","https://openalex.org/W1964860132","https://openalex.org/W1970829643","https://openalex.org/W1991657282","https://openalex.org/W2026661126","https://openalex.org/W2064826466","https://openalex.org/W2098989671","https://openalex.org/W2107286988","https://openalex.org/W2133362764","https://openalex.org/W2160643434","https://openalex.org/W2227557434","https://openalex.org/W2544386679","https://openalex.org/W2568478560","https://openalex.org/W2914359657","https://openalex.org/W2920846036","https://openalex.org/W2962760239","https://openalex.org/W4254127125","https://openalex.org/W6629750604"],"related_works":["https://openalex.org/W3162204513","https://openalex.org/W3166204570","https://openalex.org/W2371138613","https://openalex.org/W3121246613","https://openalex.org/W2048963458","https://openalex.org/W2132137594","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2171197263","https://openalex.org/W2374577476"],"abstract_inverted_index":{"Self-stabilizing":[0],"information":[1],"spreading":[2,27],"algorithms":[3],"are":[4,83],"a":[5,22,38,41,92],"key":[6],"basis":[7],"block":[8],"for":[9,13],"building":[10],"distributed":[11],"system":[12],"device":[14],"coordination.":[15],"The":[16],"adaptive":[17],"Bellman-Ford":[18,48],"(ABF)":[19],"algorithm":[20,49],"is":[21],"special":[23],"case":[24],"of":[25,34,94],"these":[26],"algorithms.":[28],"It":[29],"finds":[30],"the":[31,46,110,125],"distance":[32,56],"estimate":[33],"each":[35],"node":[36],"in":[37,74,124],"graph":[39,126],"from":[40],"source":[42],"set,":[43],"but":[44],"unlike":[45],"classical":[47],"does":[50],"not":[51],"assume":[52],"that":[53,118],"all":[54],"initial":[55,81],"estimates":[57,82],"exceed":[58],"their":[59,86],"true":[60,87],"values.":[61,88],"Though":[62],"globally":[63],"uniformly":[64],"asymptotically":[65],"stable":[66],"(GUAS),":[67],"its":[68],"convergence":[69],"can":[70],"be":[71,107],"very":[72],"slow":[73],"graphs":[75],"will":[76],"short":[77],"edges":[78],"if":[79],"some":[80],"smaller":[84],"than":[85],"We":[89,103],"propose":[90],"here":[91],"generalization":[93],"ABF":[95],"with":[96],"additional":[97],"parameters":[98],"to":[99,106,112],"permit":[100],"faster":[101],"convergence.":[102],"prove":[104],"it":[105,119],"GUAS,":[108],"bounding":[109],"time":[111],"converge,":[113],"and":[114],"show":[115],"via":[116],"simulations":[117],"withstands":[120],"persistent":[121],"bounded":[122],"perturbations":[123],"edge":[127],"lengths.":[128]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
