Acceleration of gossip algorithms through the Euler–Poisson–Darboux Equation
Gossip algorithms and their accelerated versions have been studied exclusively in discrete time on graphs. In this work, we take a different approach and consider the scaling limit of gossip algorithms in both large graphs and large number of iterations. These limits lead to well-known partial diffe...
Gespeichert in:
| Veröffentlicht in: | IMA journal of applied mathematics 2022-12, Vol.87 (6), p.985-1009 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!