Monotonicity Testing and Shortest-Path Routing on the Cube

We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hypercube network would imply the existence of efficient monotonicity testers. In particular, if any set of source-sink pairs on the directed hypercube (with all sources and all sinks distinct) can be connected with edge-disjoint paths, then monotonicity of functions f : {0, 1}n → Rcan be tested with O(n/e) queries, for any totally ordered range R. More generally, if at least a µ(n) fraction of the pairs can always be connected with edge-disjoint paths then the query complexity is O(n/(eµ(n))). We construct a family of instances of Ω(2n) pairs in n-dimensional hypercubes such that no more than roughly a 1/√n fraction of the pairs can be simultaneously connected with edge-disjoint paths. This answers an open question of Lehman and Ron [LR01], and suggests that the aforementioned appealing combinatorial approach for deriving query-complexity upper bounds from routing properties cannot yield, by itself, query-complexity bounds better than ≅ n3/2. Additionally, our construction can also be used to obtain a strong counterexample to Szymanski's conjecture about routing on the hypercube. In particular, we show that for any δ > 0, the n-dimensional hypercube is not n1/2-δ-realizable with shortest paths, while previously it was only known that hypercubes are not 1-realizable with shortest paths. We also prove a lower bound of Ω(n/e) queries for one-sided non-adaptive testing of monotonicity over the n-dimensional hypercube, as well as additional bounds for specific classes of functions and testers.

[1]  Dana Ron,et al.  Testing Monotonicity , 2000, Comb..

[2]  April Rasala Lehman.  Network coding , 2005 .

[3]  Dana Ron,et al.  Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..

[4]  Ronitt Rubinfeld,et al.  Spot-Checkers , 2000, J. Comput. Syst. Sci..

[5]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, SODA 2006.

[6]  Kyomin Jung,et al.  Transitive-Closure Spanners , 2008, SIAM J. Comput..

[7]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[8]  Eldar Fischer.  On the strength of comparisons in property testing , 2004, Inf. Comput..

[9]  Anna Lubiw,et al.  Counterexample to a Conjecture of Szymanski on Hypercube Routing , 1990, Inf. Process. Lett..

[10]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.

[11]  Abbas Yongaçoglu,et al.  On the k-pairs problem , 2008, 2008 IEEE International Symposium on Information Theory.

[12]  Kyomin Jung,et al.  Transitive-Closure Spanners of the Hypercube and the Hypergrid , 2009, Electron. Colloquium Comput. Complex..

[13]  Ted H. Szymanski,et al.  On the Permutation Capability of a Circuit-Switched Hypercube , 1989, International Conference on Parallel Processing.

[14]  Eyal Kushilevitz,et al.  Testing monotonicity over graph products , 2008, Random Struct. Algorithms.

[15]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[16]  Joshua Brody,et al.  Property Testing Lower Bounds via Communication Complexity , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[17]  Arnab Bhattacharyya.  A Note on the Distance to Monotonicity of Boolean Functions , 2008, Electron. Colloquium Comput. Complex..

[18]  Dana Ron,et al.  On Disjoint Chains of Subsets , 2001, J. Comb. Theory, Ser. A.

[19]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[20]  Bernard Chazelle,et al.  Information theory in property testing and monotonicity testing in higher dimension , 2006, Inf. Comput..