TY - GEN

T1 - Distributed uniformity testing

AU - Fischer, Orr

AU - Meir, Uri

AU - Oshman, Rotem

N1 - Publisher Copyright:
© 2018 Copyright held by the owner/author(s). Publication rights licensed to the Association for Computing Machinery.

PY - 2018/7/23

Y1 - 2018/7/23

N2 - In the uniformity testing problem, we are given access to samples from some unknown distribution on a fixed domain {1, .., n}, and our goal is to distinguish the case where is the uniform distribution from the case where is -far from uniform in L1 distance. Centralized uniformity testing has been extensively studied, and it is known that Θ(n/2) samples are necessary and sufficient. In this paper we study distributed uniformity testing: in a network of k nodes, each node i has access to si samples from the underlying distribution . Our goal is to test uniformity, while minimizing the number of samples per node, as well as the running time. We consider several distributed models: the LOCAL model, the CONGEST model, and a 0-round model where nodes cannot communicate with each other at all. We give upper bounds for each model, and a lower bound for the 0-round model. The key to our results is analyzing the centralized uniformity-testing problem in an unusual error regime, for which we give new upper and lower bounds.

AB - In the uniformity testing problem, we are given access to samples from some unknown distribution on a fixed domain {1, .., n}, and our goal is to distinguish the case where is the uniform distribution from the case where is -far from uniform in L1 distance. Centralized uniformity testing has been extensively studied, and it is known that Θ(n/2) samples are necessary and sufficient. In this paper we study distributed uniformity testing: in a network of k nodes, each node i has access to si samples from the underlying distribution . Our goal is to test uniformity, while minimizing the number of samples per node, as well as the running time. We consider several distributed models: the LOCAL model, the CONGEST model, and a 0-round model where nodes cannot communicate with each other at all. We give upper bounds for each model, and a lower bound for the 0-round model. The key to our results is analyzing the centralized uniformity-testing problem in an unusual error regime, for which we give new upper and lower bounds.

UR - http://www.scopus.com/inward/record.url?scp=85052447808&partnerID=8YFLogxK

M3 - פרסום בספר כנס

AN - SCOPUS:85052447808

SN - 9781450357951

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 455

EP - 464

BT - PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 23 July 2018 through 27 July 2018

ER -