Related papers: The partial gossip problem revisited

In the paper [Hong-Shi Zong, Wei-Min Sun, Phys. Lett. B 640 (2006) 196], the authors claim that our proof of the inconsistency of the ladder approximation to QCD [Phys. Lett. B 611 (2005) 129] was incorrect. However, their claim is based on…

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem appears to be new but is closely related to results…

We discuss a non-intuitive situation concerning percentages.

In this note we extend a theorem from [13] about uniform circle random coverings

This paper describes and analyzes a hierarchical gossip algorithm for solving the distributed average consensus problem in wireless sensor networks. The network is recursively partitioned into subnetworks. Initially, nodes at the finest…

The aim of this short note is twofold. First, we give a sketch of the proof of a recent result proved by the authors in the paper [Colombo, Crippa, and Spirito, Calc. Var. Partial Differential Equations 2015] concerning existence and…

We give a new proof of a lemma by L. Shepp, that was used in connection to random coverings of a circle.

We prove the quantitative propagation of chaos for stochastic particle systems with interaction in both the drift and the diffusion coefficients, provided the drift kernel is bounded and free of Lipschitz or smoothness assumptions. Our…

We introduce the problem of communication with partial information, where there is an asymmetry between the transmitter and the receiver codebooks. Practical applications of the proposed setup include the robust signal hashing problem…

Gau, Wang and Wu in their LAMA'2016 paper conjectured (and proved for $n\leq 4$) that an $n$-by-$n$ partial isometry cannot have a circular numerical range with a non-zero center. We prove that this statement holds also for $n=5$.

The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…

In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the $q$-case.

We prove that the smallest elements of Shi parts and cone type parts exist and form Garside shadows. The latter resolves a conjecture of Parkinson and the second author as well as a conjecture of Hohlweg, Nadeau and Williams.

This is a revision of my original posting, in which I raised objections to part of the Conway-Kochen argument. I now agree with them that their recent reply answers my original concerns. In the first part of these notes (identical to the…

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over networks. However for many topologies that are realistic…

We reply to the comment by Ying Zhang and S. Das Sarma on our PRL 94, 226405 (2005).

In this short note, we give a simple proof of a Lee-Yang type theorem which appeared in "Lee-Yang theorems and the complexity of computing averages" by Alistair Sinclair and Piyush Srivastava.

The paper considers gossip distributed estimation of a (static) distributed random field (a.k.a., large scale unknown parameter vector) observed by sparsely interconnected sensors, each of which only observes a small fraction of the field.…

We study the problem of list-decodable linear regression, where an adversary can corrupt a majority of the examples. Specifically, we are given a set $T$ of labeled examples $(x, y) \in \mathbb{R}^d \times \mathbb{R}$ and a parameter $0<…

This paper addresses the problem of robust estimation in gossip algorithms over arbitrary communication graphs. Gossip algorithms are fully decentralized, relying only on local neighbor-to-neighbor communication, making them well-suited for…