Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

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.