Related papers: The partial gossip problem revisited
We make some comments about the results we obtained in Phys. Rev. Lett. 86,3392(2001), and in Phys. Rev. Lett.87, 177206 (2001), and show that the conclusion of a recent paper [cond-mat/0409495] leveling some criticism on our results is, in…
We hereby reply concisely and hopefully clearly to the ongoing claims of incorrectness made by Chen et al. about our work on two-dimensional flocks.
A short, fairly self-contained proof is given of the Poincar\'e Conjecture. In the previous version there was an error on Page 8. This gap has now been filled.
This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates. We study the convergence properties of such algorithms with the goal…
A generalized skew information is defined and a generalized uncertainty relation is established with the help of a trace inequality which was recently proven by J.I.Fujii. In addition, we prove the trace inequality conjectured by S.Luo and…
The gossip problem (telephone problem) is an information dissemination problem in which each of $n$ nodes of a communication network has a unique piece of information that must be transmitted to all the other nodes using two-way…
Gossip algorithms are widely used in modern distributed systems, with applications ranging from sensor networks and peer-to-peer networks to mobile vehicle networks and social networks. A tremendous research effort has been devoted to…
In this paper a result of Latala about the tail behavior of Gaussian polynomials will be discussed. Latala proved an interesting result about this problem in paper [2]. But his proof applied an incorrect statement at a crucial point. Hence…
Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout large-scale networks. In this paper, we propose a compositional analysis technique to study formal probabilistic models of gossip…
We prove an improved form of an expectation of Polya and discuss several related questions
Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other's secrets. We consider distributed gossip protocols which are expressed by means of epistemic…
Hou and Liu developed a telescoping method to prove the congruence of partial sums of P-recursive sequences. We release the requirement on the telescoper and utilize the congruence of the sequence. With this approach, we are able to confirm…
In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the…
A novel approach to an old symmetry problem is developed. A new proof is given for the following symmetry problem, studied earlier.
In the paper based on the question of Zhang and L\"{u}[15], we present one theorem which will improve and extend the results of Banerjee-Majumder [2] and a recent result of Li-Huang [9].
We prove that persuasion is an NP-complete problem.
Question when rectangle can be tiled with similar copies of rectangles witch quetient of sides quadratic irrationalities. New proof of one part F. Sharov's theorem. Other close result.
We present a new proof of the celebrated quadratic reciprocity law. Our proof is based on group theory.
Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied by Aoyama and Shah…
We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has…