Gossip algorithms

DOI10.1561/1300000014MaRDI QIDQ3400007zbMATH OpenOpenAlexFDO

Authors Devavrat Shah

Publication date 18 January 2010

Published in Foundations and Trends® in Networking (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/55e09948fe85ff0d07db5d6ac962e52d5fd10fb3

zbMATH Keywords

asynchronous information exchange protocol

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Gossip in a smartphone peer-to-peer network
• Spatial gossip and resource location protocols
• Gossip consensus algorithms via quantized communication
• Simple, fast and deterministic gossip and rumor spreading
• Nonlinear gossip algorithms for wireless sensor networks

Cited in

(39)

• Scaling limits for continuous opinion dynamics systems
• Central limit theorem for majority dynamics: bribing three voters suffices
• The age of information in gossip networks
• Nonlinear gossip algorithms for wireless sensor networks
• Interacting particle systems as stochastic social dynamics
• Generalised gossip-based subgradient method for distributed optimisation
• Mean curvature, threshold dynamics, and phase field theory on finite graphs
• Distributed approximation and tracking using selective gossip
• On collaborative content distribution using multi-message gossip
• A phase transition for repeated averages
• An averaging process on hypergraphs
• Rates of convergence to equilibrium for potlatch and smoothing processes
• Acceleration of gossip algorithms through the Euler–Poisson–Darboux Equation
• Hidden temperature in the KMP model
• Asymptotically optimal amplifiers for the Moran process
• Analysis of convergence rates of some Gibbs samplers on continuous state spaces
• Weakly interacting particle systems on inhomogeneous random graphs
• Gossip algorithms in quantum networks
• A Riemannian gossip approach to subspace learning on Grassmann manifold
• Absorption time of the Moran process
• Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
• Find Your Place: Simple Distributed Algorithms for Community Detection
• Semantic analysis of gossip protocols for wireless sensor networks
• Accelerated gossip in networks of given dimension using Jacobi polynomial iterations
• Opinion dynamics on social networks
• A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
• Data flow dissemination in a network
• Hearing the clusters of a graph: A distributed algorithm
• Simple multi-party set reconciliation
• Majority dynamics and the retention of information
• Gossip and the efficiency of interactions
• Mean field interaction on random graphs with dynamically changing multi-color edges
• An enhanced Gossip algorithm based on superposition coding
• In-network estimation of frequency moments
• Consensus-based modeling using distributed feature construction with ILP
• scientific article; zbMATH DE number 1538541 (Why is no real title available?)
• A lecture on the averaging process
• Data collection in population protocols with non-uniformly random scheduler
• Gossip in a smartphone peer-to-peer network

This page was built for publication: Gossip algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400007)