Synthesis of Stochastic Flow Networks

A stochastic flow network is a directed graph with incoming edges (inputs) and outgoing edges (outputs), tokens enter through the input edges, travel stochastically in the network, and can exit the network through the output edges. Each node in the network is a splitter, namely, a token can enter a node through an incoming edge and exit on one of the output edges according to a predefined probability distribution. Stochastic flow networks can be easily implemented by beam splitters, or by DNA-based chemical reactions, with promising applications in optical computing, molecular computing and stochastic computing. In this paper, we address a fundamental synthesis question: Given a finite set of possible splitters and an arbitrary rational probability distribution, design a stochastic flow network, such that every token that enters the input edge will exit the outputs with the prescribed probability distribution. The problem of probability transformation dates back to von Neumann's 1951 work and was followed, among others, by Knuth and Yao in 1976. Most existing works have been focusing on the “simulation” of target distributions. In this paper, we design optimal-sized stochastic flow networks for “synthesizing” target distributions. It shows that when each splitter has two outgoing edges and is unbiased, an arbitrary rational probability a/b with a ≤ b ≤ 2n can be realized by a stochastic flow network of size n that is optimal. Compared to the other stochastic systems, feedback (cycles in networks) strongly improves the expressibility of stochastic flow networks.

[1]  R. Karl Rethemeyer,et al.  Network analysis , 2011 .

[2]  Po-Ling Loh,et al.  The Synthesis and Analysis of Stochastic Switching Circuits , 2012, ArXiv.

[3]  Jehoshua Bruck,et al.  Transforming Probabilities With Combinational Logic , 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Erik Winfree,et al.  DNA as a universal substrate for chemical kinetics , 2009, Proceedings of the National Academy of Sciences.

[5]  Kia Bazargan,et al.  The synthesis of combinational logic to generate probabilities , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[6]  Po-Ling Loh,et al.  The robustness of stochastic switching networks , 2009, 2009 IEEE International Symposium on Information Theory.

[7]  Jehoshua Bruck,et al.  On the expressibility of stochastic switching circuits , 2009, 2009 IEEE International Symposium on Information Theory.

[8]  Matthew Cook,et al.  Computation with finite stochastic chemical reaction networks , 2008, Natural Computing.

[9]  Jehoshua Bruck,et al.  Stochastic switching circuit synthesis , 2008, 2008 IEEE International Symposium on Information Theory.

[10]  Michael C. Loui,et al.  Optimal random number generation from a biased coin , 2005, SODA '05.

[11]  Mamoru Hoshi,et al.  Interval algorithm for random number generation , 1997, IEEE Trans. Inf. Theory.

[12]  Julia Abrahams,et al.  Generation of discrete distributions from biased coins , 1996, IEEE Trans. Inf. Theory.

[13]  Y. Peres.  Iterating Von Neumann's Procedure for Extracting Random Bits , 1992 .

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  Manuel Blum.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1986, Comb..

[16]  Manuel Blum,et al.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..

[17]  Quentin F. Stout,et al.  TREE ALGORITHMS FOR UNBIASED COIN TOSSING WITH A BIASED COIN , 1984 .

[18]  Andrew Chi-Chih Yao,et al.  The complexity of nonuniform random number generation , 1976 .

[19]  P. Elias.  The Efficient Construction of an Unbiased Random Sequence , 1972 .

[20]  Wassily Hoeffding,et al.  UNBIASED COIN TOSSING WITH A BIASED COIN by , 1969 .

[21]  C. L. Sheng,et al.  Threshold Logic Elements Used as a Probability Transformer , 1965, JACM.

[22]  M. V. Valkenburg.  Network Analysis , 1964 .

[23]  Arthur Gill,et al.  On a Weight Distribution Problem, with Application to the Design of Stochastic Generators , 1963, JACM.

[24]  Arthur Gill,et al.  Synthesis of probability transformers , 1962 .