A Caltech Library Service

On the Expressibility of Stochastic Switching Circuits

Zhou, Hongchao and Bruck, Jehoshua (2009) On the Expressibility of Stochastic Switching Circuits. California Institute of Technology , Pasadena, CA. (Unpublished)

See Usage Policy.


Use this Persistent URL to link to this item:


Stochastic switching circuits are relay circuits that consist of stochastic switches (that we call pswitches). We study the expressive power of these circuits; in particular, we address the following basic question: given an arbitrary integer q, and a pswitch set {1/q, 2/q, ..., (q–1)/q }, can we realize any rational probability with denominator q n (for arbitrary n) by a simple series-parallel stochastic switching circuit? In this paper, we generalized previous results and prove that when q is a multiple of 2 or 3 the answer is positive. We also show that when q is a prime number the answer is negative. In addition, we propose a greedy algorithm to realize desired reachable probabilities, and thousands of experiments show that this algorithm can achieve almost optimal size. Finally, we prove that any desired probability can be approximated well by a linear size circuit.

Item Type:Report or Paper (Technical Report)
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:The authors would like to thank Dan Wilhelm for discussions and assistance.
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:2009.ETR093
Persistent URL:
Official Citation:Hongchao Zhou and Jehoshua Bruck. On the Expressibility of Stochastic Switching Circuits. Technical Report. California Institute of Technology, Pasadena, CA. [CaltechPARADISE:2009.ETR093]
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26124
Deposited By: Imported from CaltechPARADISE
Deposited On:21 Sep 2009
Last Modified:22 Nov 2019 09:58

Repository Staff Only: item control page