Related papers: The partial gossip problem revisited
A simple proof of the celebrated theorem of Lee and Yang is attempted in this short note.
In this paper, we consider the fractional sum of the divisor functions. We can improve previous results considered by Bordell\'{e}s \cite{Bo} and Liu-Wu-Yang \cite{LWY}.
A recent result of Ding, Lee and Peres expresses the cover time of the random walk on a graph in terms of generic chaining for the commute distance. Their proof is very involved and the purpose of this article is to present a simpler…
We prove a Wong-Rosay type theorem for a domain with a piecewise smooth generic strictly pseudoconvex boundary point.
We argue that several claims of paper Phys. Rev. Lett 79, 1953 (1997), by Lu-Ming Duan and Guang-Can Guo, are questionable. In particular we stress that the environmental noise considered by the authors belongs to a very special class
We consider estimation models of the form $Y=X^*+N$, where $X^*$ is some $m$-dimensional signal we wish to recover, and $N$ is symmetrically distributed noise that may be unbounded in all but a small $\alpha$ fraction of the entries. We…
Error-correcting codes are efficient methods for handling \emph{noisy} communication channels in the context of technological networks. However, such elaborate methods differ a lot from the unsophisticated way biological entities are…
We study different mechanisms of gossip propagation on several network topologies and introduce a new network property, the "spread factor", describing the fraction of neighbors that get to know the gossip. We postulate that for scale-free…
In this paper, we study gossip algorithms in communication models that describe the peer-to-peer networking functionality included in most standard smartphone operating systems. We begin by describing and analyzing a new synchronous gossip…
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in…
This short note provides a new and simple proof of the convergence rate for Peng's law of large numbers under sublinear expectations, which improves the corresponding results in Song [15] and Fang et al. [3].
In this paper, firstly we propose two new concepts concerning the notion of key escrow encryption schemes: provable partiality and independency. Roughly speaking we say that a scheme has provable partiality if existing polynomial time…
This document describes a new consensus algorithm which is asynchronous and uses gossip based message dissemination between nodes. The current version of the algorithm does not cover the case of a node failure or significantly delayed…
In this note, we give short inductive proofs of two known results on $k$-extendible graphs based on a property proved in [Qinglin Yu, A note on $n$-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].
We consider a gossip approach for finding a Nash equilibrium in a distributed multi-player network game. We extend previous results on Nash equilibrium seeking to the case when the players' cost functions may be affected by the actions of…
Distributed dynamic gossip is a generalization of the classic telephone problem in which agents communicate to share secrets, with the additional twist that also telephone numbers are exchanged to determine who can call whom. Recent work…
We give a simple proof of a recently result concerning Hardy $q$-inequalities.
In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how that Randomized Block Kaczmarz (RBK) method - a method for…
In the paper, we investigate the uniqueness problem of a power of an entire function that share one value partially with it's linear differential polynomial and obtain a result, which improves several previous results in a large scale. Also…
Consider a connected network of agents endowed with local cost functions representing private objectives. Agents seek to find an agreement on some minimizer of the aggregate cost, by means of repeated communications between neighbors.…