Gossip algorithms
From MaRDI portal
Publication:3400007
DOI10.1561/1300000014zbMATH Open1185.68072OpenAlexW4232338303MaRDI QIDQ3400007FDOQ3400007
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
Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Network protocols (68M12)
Cited In (32)
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Weakly interacting particle systems on inhomogeneous random graphs
- In-network estimation of frequency moments
- Analysis of convergence rates of some Gibbs samplers on continuous state spaces
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation
- Asymptotically optimal amplifiers for the Moran process
- Acceleration of gossip algorithms through the Euler–Poisson–Darboux Equation
- Opinion dynamics on social networks
- Consensus-based modeling using distributed feature construction with ILP
- Scaling limits for continuous opinion dynamics systems
- Rates of convergence to equilibrium for potlatch and smoothing processes
- Absorption time of the Moran process
- Mean field interaction on random graphs with dynamically changing multi-color edges
- Hearing the clusters of a graph: A distributed algorithm
- Data flow dissemination in a network
- Interacting particle systems as stochastic social dynamics
- Central limit theorem for majority dynamics: bribing three voters suffices
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Hidden temperature in the KMP model
- Data collection in population protocols with non-uniformly random scheduler
- An averaging process on hypergraphs
- Majority dynamics and the retention of information
- Gossip algorithms in quantum networks
- A Riemannian gossip approach to subspace learning on Grassmann manifold
- Gossip and the efficiency of interactions
- Nonlinear gossip algorithms for wireless sensor networks
- Generalised gossip-based subgradient method for distributed optimisation
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
- Simple multi-party set reconciliation
- A lecture on the averaging process
- A phase transition for repeated averages
- Title not available (Why is that?)
Recommendations
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)