Related papers: The partial gossip problem revisited
In a recent work, Doerr and Fouz [\emph{Asymptotically Optimal Randomized Rumor Spreading}, in ArXiv] present a new quasi-random PUSH algorithm for the rumor spreading problem (also known as gossip spreading or message propagation problem).…
We present in this work a new and simple proof of the false centre theorem.
This is to reply to a recent comment by Yang, Yuan and Zhang on ``Teleportation of two-quNit entanglement: Exploiting local resorces''.
Gossip and in particular network coded algebraic gossip have recently attracted attention as a fast, bandwidth-efficient, reliable and distributed way to broadcast or multicast multiple messages. While the algorithms are simple, involved…
We prove mean comparison from a different perspective, where we introduce the concept of partial convolution.
We revisit the problem of general identifiability originally introduced in [Lee et al., 2019] for causal inference and note that it is necessary to add positivity assumption of observational distribution to the original definition of the…
The proof given in the paper was incomplete due to an omission in the proof of Lemma 2. A corrected and improved version of the paper is in arXiv:0902.2486.
A variation on the splitting principle
In this paper, we will continue to estmate g_1(n|m) for general n and m.
We settle in the affirmative the Graham-Sloane conjecture.
Two parties, Alice and Bob, wish to distill a binary secret key out of a list of correlated variables that they share after running a quantum key distribution protocol based on continuous-spectrum quantum carriers. We present a novel…
In this letter we introduce the problem of secrecy reversibility. This asks when two honest parties can distill secret bits from some tripartite distribution $p_{XYZ}$ and transform secret bits back into $p_{XYZ}$ at equal rates using local…
We prove that the partial $C^0$-estimate holds for metrics along Aubin's continuity method for finding K\"ahler-Einstein metrics, confirming a special case of a conjecture due to Tian. We use the method developed in recent work of…
We generalize the proximal g-formula of Miao, Geng, and Tchetgen Tchetgen (2018) for causal inference under unobserved confounding using proxy variables. Specifically, we show that the formula holds true for all causal models in a certain…
Efficient and robust algorithms for decentralized estimation in networks are essential to many distributed systems. Whereas distributed estimation of sample mean statistics has been the subject of a good deal of attention, computation of…
In this work, we show that parallel repetition of public-coin interactive arguments reduces the soundness error at an exponential rate even in the post-quantum setting. Moreover, we generalize this result to hold for threshold verifiers,…
Extending the eavesdropping strategy devised by Zhang, Li and Guo [Phys. Rev. A 63, 036301 (2001)], we show that the multiparty quantum communication protocol based on entanglement swapping, which was proposed by Cabello [quant-ph/0009025],…
The proof of the No-Go Theorem of unconditionally secure quantum bit commitment depends on the assumption that Alice knows every detail of the protocol, including the probability distributions associated with all the random variables…
We verify a conjecture of Lutwak, Yang, Zhang about the equality case in the Orlicz-Petty projection inequality, and provide an essentially optimal stability version.
I briefly discuss some recent developments (and recall some old news) in the theory and phenomenology of generalised parton distributions.