Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
A Picture for Complex Stochastic Boolean Systems: The Intrinsic Order Graph
verfasst von : Luis González
Erschienen in: Computational Science – ICCS 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Complex stochastic Boolean systems, depending on a large number
n
of statistically independent random Boolean variables, appear in many different scientific, technical or social areas. Each one of the 2
n
binary states associated to such systems is denoted by its corresponding binary
n
-tuple of 0s and 1s,
$\left( u_{1},\ldots,u_{n}\right) $
, and it has a certain occurrence probability
$\Pr\left\{ \left( u_{1},\ldots ,u_{n}\right) \right\} $
. The ordering between the 2
n
binary
n
-tuple probabilities,
$\Pr\left\{ \left( u_{1},\ldots,u_{n}\right) \right\} $
, can be illustrated by a directed graph which “scales” them by decreasing order, the so-called intrinsic order graph. In this context, this paper provides a simple algorithm for iteratively drawing the intrinsic order graph, for any complex stochastic Boolean system and for any number
n
of independent random Boolean variables. The presentation is self-contained.