Complex Stochastic Boolean Systems: New Properties of the Intrinsic Order Graph
نویسنده
چکیده
A complex stochastic Boolean system (CSBS) is a system depending on an arbitrary number n of stochastic Boolean variables. The analysis of CSBSs is mainly based on the intrinsic order: a partial order relation defined on the set {0, 1} of binary n-tuples. The usual graphical representation for a CSBS is the intrinsic order graph: the Hasse diagram of the intrinsic order. In this paper, some new properties of the intrinsic order graph are studied. Particularly, the set and the number of its edges, the degree and neighbors of each vertex, as well as typical properties, such as the symmetry and fractal structure of this graph, are analyzed.
منابع مشابه
Edges, Chains, Shadows, Neighbors and Subgraphs in the Intrinsic Order Graph
Many different scientific, technical or social phenomena can be modeled by a complex system depending on a large number n of random Boolean variables. Such systems are called complex stochastic Boolean systems (CSBSs). The most useful representation of a CSBS is the intrinsic order graph. This is a symmetric digraph on 2 nodes, with a characteristic fractal structure. In this paper, different p...
متن کاملAlgorithm Comparing Binary String Probabilities in Complex Stochastic Boolean Systems Using Intrinsic Order Graph
This paper deals with a special kind of complex systems which depend on an arbitrary (and usually large) number n of random Boolean variables. The so-called complex stochastic Boolean systems often appear in many different scientific, technical or social areas. Clearly, there are 2n binary states associated to such a complex system. Each one of them is given by a binary string u = (u1, . . . , ...
متن کاملPartitioning the Intrinsic Order Graph for Complex Stochastic Boolean Systems
Many different problems in Engineering and Computer Science can be modeled by a complex system depending on a certain number n of stochastic Boolean variables: the so-called complex stochastic Boolean system (CSBS). The most useful graphical representation of a CSBS is the intrinsic order graph (IOG). This is a symmetric, self-dual diagram on 2 nodes (denoted by In) that displays all the binary...
متن کاملComplex Stochastic Boolean Systems: Generating and Counting the Binary n-Tuples
A complex stochastic Boolean system (CSBS) is a system depending on an arbitrary number n of random Boolean variables. The behavior of a CSBS is determined by the ordering between the occurrence probabilities Pr {u} of the 2 associated binary n-tuples u = (u1, . . . , un) ∈ {0, 1}. In this context, for every fixed binary n-tuple u, this paper presents two simple algorithms –exclusively based on...
متن کاملRegularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011