Synthesis of Stochastic Flow Networks

09/04/2012
by   Hongchao Zhou, et al.
0

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 DNA-based chemical reactions, with promising applications in 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≤ 2^n 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.

READ FULL TEXT
research
04/13/2018

Distribution Regression Network

We introduce our Distribution Regression Network (DRN) which performs re...
research
01/10/2019

On the Distance Between the Rumor Source and Its Optimal Estimate on a Regular Tree

This paper addresses the rumor source identification problem, where the ...
research
01/10/2019

On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree

This paper addresses the rumor source identification problem, where the ...
research
02/08/2021

Prophet Inequality Matching Meets Probing with Commitment

Within the context of stochastic probing with commitment, we consider th...
research
10/22/2019

Stochastic Feedforward Neural Networks: Universal Approximation

In this chapter we take a look at the universal approximation question f...
research
06/17/2018

ZICS: an application for calculating the stationary probability distribution of stochastic reaction networks

Stochastic formalisms are necessary to describe the behavior of many bio...
research
03/08/2018

Distributed Computation of Wasserstein Barycenters over Networks

We propose a new class-optimal algorithm for the distributed computation...

Please sign up or login with your details

Forgot password? Click here to reset