REVIEW
Fully Asynchronous Push-Sum With Growing Intercommunication Intervals
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Fully Asynchronous Push-Sum With Growing Intercommunication Intervals
classification
math.OC
keywords
asynchronousaveragefullygrowingalgorithmallowingcommunicationcommunications
read the original abstract
We propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications. We show its convergence to the average, while allowing for slowly growing but potentially unbounded communication failures.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.