Computer Science Theory Seminar
Jake Maranzatto
UIC
Age of Gossip in Random and Bipartite Networks
Abstract: Recently Yates (2021) introduced the "version age of information" metric for studying communication networks where packets are sent between users via independent Poisson processes. For any network G, this produces a graph invariant vAoI(G) characterizing the worst-case version age of a node in the network. In this talk I'll discuss the combinatorics of the vAoI metric, and in particular how this metric varies as one interpolates between the empty graph and complete graph. I'll give the vAoI for the Erdos-Reyni random graph, random d-regular graph, and the family of complete bipartite graphs $K_{n,n-m}$. This is based on my work accepted to ISIT 2024.
Will be going to Chilangos afterwards (not funded)
Monday April 22, 2024 at 4:00 PM in 1227 SEO