A Phase Transition and Stochastic Domination in Pippenger's Probabilistic Failure Model for Boolean Networks with Unreliable Gates

arXivmath/0311045MaRDI QIDQ6473307FDOQ6473307

Authors: Maxim Raginsky 

Publication date: 4 November 2003

Abstract: We study Pippenger's model of Boolean networks with unreliable gates. In this model, the conditional probability that a particular gate fails, given the failure status of any subset of gates preceding it in the network, is bounded from above by some $epsilon$. We show that if we pick a Boolean network with $n$ gates at random according to the Barak-ErdH{o}s model of a random acyclic digraph, such that the expected edge density is $c{n}^{-1}logn$, and if $epsilon$ is equal to a certain function of the size of the largest reflexive, transitive closure of a vertex (with respect to a particular realization of the random digraph), then Pippenger's model exhibits a phase transition at $c=1$. Namely, with probability $1-o(1)$ as $noinfty$, we have the following: for $0lecle1$, the minimum of the probability that no gate has failed, taken over all probability distributions of gate failures consistent with Pippenger's model, is equal to $o(1)$, whereas for $c>1$ it is equal to $exp(-fracce(c-1))+o(1)$. We also indicate how a more refined analysis of Pippenger's model, e.g., for the purpose of estimating probabilities of monotone events, can be carried out using the machinery of stochastic domination.

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Phase transitions (general) in equilibrium statistical mechanics (82B26)

This page was built for publication: A Phase Transition and Stochastic Domination in Pippenger's Probabilistic Failure Model for Boolean Networks with Unreliable Gates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6473307)