Related papers: The partial gossip problem revisited

We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs with the least restrictive connectivity requirements. In this paper we study the convergence time of these algorithms.…

Both small world models of random networks with occasional long range connections and gossip processes with occasional long range transmission of information have similar characteristic behaviour. The long range elements appreciably reduce…

We study the inverse problem of recovering the order and the diffusion coefficient of an elliptic fractional partial differential equation from a finite number of noisy observations of the solution. We work in a Bayesian framework and show…

Recently, Hong Wang and Joshua Zahl announced a proof of the 3-dimensional Kakeya conjecture. This is a survey article on the proof of Kakeya. We introduce the problem, discuss previous work and some of the difficulties of the problem, and…

The purpose of the paper is to present an short proof of the Chuang's inequality.

We prove recent conjectures of Chern concerning nonnegativity of a certain q-series related to parity bias in integer partitions.

Based on the results people have obtained, we try to prove the Jacobian conjecture, but there is a gap in the proof.

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…

Here we give a short survey of our new results. References to the complete proofs can be found in the text of this article and in the litterature.

We consider a recent The Vee's fair soup division problem, provide its partial solution, and pose a related open problem.

The article presents the proof of Casas-Alvero conjecture.

The paper contains an alternative proof of M. Kontsevich Formality Theorem.

We consider gossiping in a fully-connected wireless network consisting of $n$ nodes. The network receives Poisson updates from a source, which generates new information. The nodes gossip their available information with the neighboring…

The theory of the basic statistical concept of (Lehmann-Scheff\'e-)completeness is perfected by providing the theorem indicated in the title and previously overlooked for several decades. Relations to earlier results are discussed and…

In instances of online kernel learning where little prior information is available and centralized learning is unfeasible, past research has shown that distributed and online multi-kernel learning provides sub-linear regret as long as every…

In a recent paper (quant-ph/0102133) Chen, Liang, Li and Huang suggest a necessary and sufficient separability criterion, which is supposedly practical in judging the separability of any mixed state. In this note we briefly recapitulate…

We prove the divisibility conjecture on sums of even powers of $q$-binomial coefficients, which was recently proposed by Guo, Schlosser and Zudilin. Our proof relies on two $q$-harmonic series congruences due to Shi and Pan.

In many applications, nodes in a network desire not only a consensus, but an optimal one. To date, a family of subgradient algorithms have been proposed to solve this problem under general convexity assumptions. This paper shows that, for…

In this note we prove a weighted version of the Khintchine inequalities.