Random Node-Asynchronous Updates on Graphs

DOI10.1109/TSP.2019.2910485MaRDI QIDQ5238822zbMATH OpenOpenAlexWikidataFDO

Authors Oguzhan Teke, P. P. Vaidyanathan

Publication date 28 October 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2019.2910485

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Random asynchronous iterations in distributed coordination algorithms
• Distributed algorithms for random graphs
• Mathematical Foundations of Computer Science 2005
• Asynchronous deterministic rendezvous in graphs
• Local update algorithms for random graphs
• Randomized protocols for asynchronous consensus
• On the Use of Randomness in Local Distributed Graph Algorithms
• Asynchronous Gossip-Based Random Projection Algorithms Over Networks

This page was built for publication: Random Node-Asynchronous Updates on Graphs

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