Related papers: The partial gossip problem revisited

As decentralized AI and edge intelligence become increasingly prevalent, ensuring robustness and trustworthiness in such distributed settings has become a critical issue-especially in the presence of corrupted or adversarial data.…

Misprints in eq. (7), which propagate up to eq. (13), are corrected. References are updated.

Distributed deep learning is an effective way to reduce the training time of deep learning for large datasets as well as complex models. However, the limited scalability caused by network overheads makes it difficult to synchronize the…

We show that a problem by Yau can not be true in general. The counterexamples are constructed based on the recent work of Wu and Zheng.

We revisit the classic problem of spreading a piece of information in a group of $n$ fully connected processors. By suitably adding a small dose of randomness to the protocol of Gasienic and Pelc (1996), we derive for the first time…

Motivated by the large expansion in the study of social networks, this paper deals with the problem of multiple messages spreading over the same network using gossip algorithms. Given two messages distributed over some nodes of the graph,…

Recently, Ni and Pan proved a $q$-congruence on certain sums involving central $q$-binomial coefficients, which was conjectured by Guo. In this paper, we give a generalization of this $q$-congruence and confirm another $q$-congruence, also…

We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.

We give a new simpler proof of a theorem of Jayne and Rogers.

In this paper, we develop and analyze a gossip-based average consensus algorithm that enables all of the components of a distributed system, each with some initial value, to reach (approximate) average consensus on their initial values…

We briefly review the security of the ping-pong protocol in light of several attack scenarios suggested by various authors since the proposal of the protocol. We refute one recent attack on an ideal quantum channel, and show that a recent…

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…

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network…

We give a proof of a result of Bonet, Engli\v{s} and Taskinen filling in several details and correcting some flaws.

Wang and Yau [10] introduced a quasi-local mass, which is a hyperbolic background generalization of Liu-Yau's expression [7] [8], and proved its positivity. In this note, we prove that the positivity of this quasi-local mass is still valid…

In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are…

This paper investigates the problem of distributed network-wide averaging and proposes a new greedy gossip algorithm. Instead of finding the optimal path of each node in a greedy manner, the proposed approach utilises a suboptimal…

We prove the equivalence of the well-posedness of a partial differential equation with delay and an associated abstract Cauchy problem. This is used to derive sufficient conditions for well-posedness, exponential stability and norm…

We present a general model for opinion dynamics in a social network together with several possibilities for object selections at times when the agents are communicating. We study the limiting behavior of such a dynamics and show that this…