Diffusion of Information on Networked Lattices by Gossip

Abstract

We study time-dependent dynamics on a network of order lattices, where structure-preserving lattice maps are used to fuse lattice-valued data over vertices and edges. The principal contribution is a novel asynchronous Laplacian, generalizing the usual graph Laplacian, adapted to a network of heterogeneous lattices. The resulting gossip algorithm is shown to converge asymptotically to stable "harmonic" distributions of lattice data. This general theorem is applicable to several general problems, including lattice-valued consensus, Kripke semantics, and threat detection, all using asynchronous local update rules.