Chen, Zhengkun2020-09-092020-09-092020-09-092020-08-26http://hdl.handle.net/10012/16269We establish a directed analogue of Chung and Tetali's isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions over products of general posets.enMonotonicity TestingProperty TestingIsoperimetryMaster Thesis