Related papers: The partial gossip problem revisited

In this short note, we answer two questions of Chen and Ruzsa negatively and answer a problem of Ma and Chen affirmatively.

The gossip problem, in which information (known as secrets) must be shared among a certain number of agents using the minimum number of calls, is of interest in the conception of communication networks and protocols. We extend the gossip…

In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs.…

The aim of this short note is to give counterexamples to two results by D. Y. Gao [5, Th. 16], [4, Th. 2] and to improve a related result by S.-C. Fang, D. Y. Gao, R.-L. Sheu and S.-Y. Wu [1, Th. 3].

A number of authors have recently pointed out inconsistencies of results obtained with the Huang-Yang multipolar pseudo-potential for low-energy scattering [K. Huang and K. C. Yang, Phys. Rev. A, v 105, 767 (1957); later revised in K.…

We give a sketch for an alternative proof of a recent result by J. Tseng.

Gossip algorithms are widely used to solve the distributed consensus problem, but issues can arise when nodes receive multiple signals either at the same time or before they are able to finish processing their current work load.…

In this work we present a randomized gossip algorithm for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for…

We provide new sufficient conditions under which Ryser's conjecture holds.

Gossip protocols are popular methods for average consensus problems in distributed computing. We prove new convergence guarantees for a variety of such protocols, including path, clique, and synchronous pairwise gossip. These arise by…

Gossip protocols are programs used in a setting in which each agent holds a secret and the aim is to reach a situation in which all agents know all secrets. Such protocols rely on a point-to-point or group communication. Distributed…

In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration…

In this work we present novel provably accelerated gossip algorithms for solving the average consensus problem. The proposed protocols are inspired from the recently developed accelerated variants of the randomized Kaczmarz method - a…

The renowned Gossiping Problem (1971) asks the following. There are $n$ people who each know an item of gossip. In a telephone call, two people share all the gossip they know. How many calls are needed for all of them to be informed of all…

In this work we present a new framework for the analysis and design of randomized gossip algorithms for solving the average consensus problem. We show how classical randomized iterative methods for solving linear systems can be interpreted…

We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes than itself. This problem is at the heart of many…

We study matrix inequalities involving partial traces for positive semidefinite block matrices. First of all, we present a new method to prove a celebrated result of Choi [Linear Algebra Appl. 516 (2017)]. Our method also allows us to prove…

The Aldous gossip process represents the dissemination of information in geographical space as a process of locally deterministic spread, augmented by random long range transmissions. Starting from a single initially informed individual,…

In this paper, we first present simple proofs of Choi's results [4], then we give a short alternative proof for Fiedler and Markham's inequality [6]. We also obtain additional matrix inequalities related to partial determinants.

A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are…