Communication on Gossip Networks

In this project, we have analyzed the gossip networks from various aspects.

In Constructing Stochastic Matrices for Weighted Averaging in Gossip Networks, we propose an algorithm for constructing (local) stochastic matrices based on a given gossip network topology and a set of weights for averaging across different consensus clusters, ensuring that the gossip process converges to a finite limit set.

In Age of Coded Updates In Gossip Network Under Memory and Memoryless Scheme, we have analyzed k-out-of-n threshold systems on a gossip network, each receiver node requires at least k different keys out of total n keys with the same version, shared over peer-to-peer connections. We consider two type of node subscriber nodes, which receive a unique key from the source node for every status update instantaneously, and nonsubscriber nodes.

In Age of k-out-of-n Systems on a Gossip Network, we have analyzed k-out-of-n systems on a gossip network, in which for decryption, each receiver node requires at least k different keys out of total n keys with the same version, shared over peer-to-peer connections.

In Vector-Valued Gossip over w-Holonomic Networks, we have provided conditions for the convergence of this non-homogeneous Markov process as well as the characterization of its limit set.