{"id":"https://openalex.org/W4415368490","doi":"https://doi.org/10.1109/isit63088.2025.11195490","title":"Age of Gossip with Time-Varying Topologies","display_name":"Age of Gossip with Time-Varying Topologies","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368490","doi":"https://doi.org/10.1109/isit63088.2025.11195490"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195490","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5056473508","display_name":"Arunabh Srivastava","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arunabh Srivastava","raw_affiliation_strings":["University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"],"affiliations":[{"raw_affiliation_string":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093775120","display_name":"Thomas Jacob Maranzatto","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Jacob Maranzatto","raw_affiliation_strings":["University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"],"affiliations":[{"raw_affiliation_string":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021132487","display_name":"\u015eennur Uluku\u015f","orcid":"https://orcid.org/0000-0002-8219-8190"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sennur Ulukus","raw_affiliation_strings":["University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742"],"affiliations":[{"raw_affiliation_string":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA,20742","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056473508"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":1.6914,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.88935589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9567999839782715,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9567999839782715,"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/T11252","display_name":"Evolutionary Game Theory and Cooperation","score":0.9438999891281128,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.7067000269889832},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.6973000168800354},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5598999857902527},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5533999800682068},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4740000069141388},{"id":"https://openalex.org/keywords/random-geometric-graph","display_name":"Random geometric graph","score":0.45399999618530273},{"id":"https://openalex.org/keywords/comparison-of-topologies","display_name":"Comparison of topologies","score":0.4523000121116638},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44909998774528503},{"id":"https://openalex.org/keywords/absorbing-markov-chain","display_name":"Absorbing Markov chain","score":0.3765999972820282}],"concepts":[{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.7067000269889832},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.6973000168800354},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5598999857902527},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5533999800682068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5248000025749207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4740000069141388},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.45399999618530273},{"id":"https://openalex.org/C176293985","wikidata":"https://www.wikidata.org/wiki/Q906456","display_name":"Comparison of topologies","level":5,"score":0.4523000121116638},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44909998774528503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4449000060558319},{"id":"https://openalex.org/C93457212","wikidata":"https://www.wikidata.org/wiki/Q4669888","display_name":"Absorbing Markov chain","level":5,"score":0.3765999972820282},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.3573000133037567},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.3529999852180481},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C143913944","wikidata":"https://www.wikidata.org/wiki/Q5421952","display_name":"Extension topology","level":4,"score":0.31439998745918274},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C122306262","wikidata":"https://www.wikidata.org/wiki/Q719775","display_name":"Ring network","level":3,"score":0.310699999332428},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3100999891757965},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.29789999127388},{"id":"https://openalex.org/C123867240","wikidata":"https://www.wikidata.org/wiki/Q3001792","display_name":"Markov blanket","level":5,"score":0.287200003862381},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C117729477","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Logical topology","level":3,"score":0.27239999175071716},{"id":"https://openalex.org/C139940560","wikidata":"https://www.wikidata.org/wiki/Q290036","display_name":"Network simulation","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C2780457167","wikidata":"https://www.wikidata.org/wiki/Q17156484","display_name":"Percolation (cognitive psychology)","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2599000036716461},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25859999656677246}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195490","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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":25,"referenced_works":["https://openalex.org/W1993918491","https://openalex.org/W2031541804","https://openalex.org/W2038378248","https://openalex.org/W2886359150","https://openalex.org/W2963294159","https://openalex.org/W3036224849","https://openalex.org/W3041291604","https://openalex.org/W3048950558","https://openalex.org/W3137257456","https://openalex.org/W3153851140","https://openalex.org/W3197901880","https://openalex.org/W3199878738","https://openalex.org/W4211024811","https://openalex.org/W4253891146","https://openalex.org/W4286377573","https://openalex.org/W4308216516","https://openalex.org/W4323520918","https://openalex.org/W4386260456","https://openalex.org/W4390098651","https://openalex.org/W4391020103","https://openalex.org/W4401693410","https://openalex.org/W4404037627","https://openalex.org/W4407736713","https://openalex.org/W4414110859","https://openalex.org/W4414463330"],"related_works":[],"abstract_inverted_index":{"We":[0,96,114,217],"consider":[1],"a":[2,6,12,32,64,77,132,171,248],"gossiping":[3,18,26,86,252],"network,":[4],"where":[5],"source":[7],"node":[8,173,249],"sends":[9],"updates":[10],"to":[11,122,135],"network":[13,27,87,176,190,208],"of":[14,24,35,53,84,100,107,119,126,146,149,161,170,182,239,247],"<tex":[15],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[16],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[17],"nodes.":[19,130],"Meanwhile,":[20],"the":[21,25,40,44,47,54,58,73,80,85,90,98,105,112,116,124,129,136,147,150,153,158,162,167,175,180,186,189,202,207,237,242,251],"connectivity":[22,36,55],"topology":[23,83,209],"changes":[28],"over":[29],"time,":[30],"among":[31,57],"finite":[33,65],"number":[34,181,238],"\u201cstates,\u201d":[37],"such":[38],"as":[39,184],"fully":[41,154,193],"connected":[42,155],"graph,":[43,46,49],"ring":[45],"grid":[48],"etc.":[50],"The":[51],"transition":[52,159],"graph":[56,82,102,156],"possible":[59],"options":[60],"is":[61,75,88,152,198],"governed":[62],"by":[63,93],"state":[66],"continuous":[67],"time":[68],"Markov":[69],"chain":[70],"(CTMC).":[71],"When":[72],"CTMC":[74,151,163,231],"in":[76,89,111,174,185,201,214,250],"particular":[78],"state,":[79],"associated":[81],"way":[91],"indicated":[92],"that":[94],"state.":[95],"evaluate":[97],"impact":[99],"time-varying":[101],"topologies":[103,228],"on":[104,236],"freshness":[106,125],"information":[108,120,127],"for":[109],"nodes":[110],"network.":[113,253],"use":[115],"version":[117,168,244],"age":[118,169,203,245],"metric":[121],"quantify":[123],"at":[128],"Using":[131],"method":[133],"similar":[134],"first":[137],"passage":[138],"percolation":[139],"method,":[140],"we":[141],"show":[142],"that,":[143],"if":[144,188,206],"one":[145],"states":[148],"and":[157,221,229],"rates":[160,232],"are":[164],"constant,":[165],"then":[166],"typical":[172],"scales":[177],"logarithmically":[178],"with":[179],"nodes,":[183],"case":[187],"was":[191],"always":[192],"connected.":[194],"That":[195],"is,":[196],"there":[197],"no":[199],"loss":[200],"scaling,":[204],"even":[205],"deviates":[210],"from":[211],"full":[212],"connectivity,":[213],"this":[215],"setting.":[216],"perform":[218],"numerical":[219],"simulations":[220],"analyze":[222],"more":[223],"generally":[224],"how":[225],"having":[226],"different":[227,230],"(that":[233],"might":[234],"depend":[235],"nodes)":[240],"affect":[241],"average":[243],"scaling":[246]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}