mlsanityData to 7 Oct 2026

The Age of Gossip in Networks

arXiv 2102.02893 ↗First posted 4 Feb 2021cs.IT cs.NI math.ITcited by 7

Not on the map. Why?

Abstract (arXiv)

A source node updates its status as a point process and also forwards its updates to a network of observer nodes. Within the network of observers, these updates are forwarded as point processes from node to node. Each node wishes its knowledge of the source to be as timely as possible. In this network, timeliness is measured by a discrete form of age of information: each status change at the source is referred to as a version and the age at a node is how many versions out of date is its most recent update from the source. This work introduces a method for evaluating the average version age at each node in the network when nodes forward updates using a memoryless gossip protocol. This method is then demonstrated by version age analysis for a collection of simple networks. For gossip on a complete graph with symmetric updating rates, it is shown that each node has average age that grows as the logarithm of the network size.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Feb 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 1; 2026: 1.

7 papers.