Complex Stochastic Boolean Systems: Comparing Bitstrings with the Same Hamming Weight. (24th March 2014)

• Record Type: Journal Article
• Authors: González, Luis
• Other Names: Su Chun-Yi Academic Editor.
• Is Part Of: Journal of complex systems. Volume 2014(2014)
• Publication Date: 2014-03-24
• Subjects: System analysis -- Periodicals; Computational complexity -- Periodicals; Coupled problems (Complex systems) -- Periodicals; Systems engineering -- Periodicals; Computational complexity; Coupled problems (Complex systems); System analysis; Systems engineering; Electronic journals; Periodicals; 003
• DOI: 10.1155/2014/428418
• Languages: English
• ISSNs: 2356-7244

Abstract

Abstract : A complex stochastic Boolean system (CSBS) is a complex system depending on an arbitrarily large numbern of random Boolean variables. CSBSs arise in many different areas of science and engineering. A proper mathematical model for the analysis of such systems is based on the intrinsic order: a partial order relation defined on the set0, 1 n of all binaryn -tuples of 0s and 1s. The intrinsic order enables one to compare the occurrence probabilities of two given binaryn -tuples with no need to compute them, simply looking at the relative positions of their 0s and 1s. Regarding the analysis of CSBSs, the intrinsic order reduces the complexity of the problem from exponential (2 n binaryn -tuples) to linear (n Boolean variables). In this paper, using the intrinsic ordering, we compare the occurrence probabilities of any two binaryn -tuples having the same number of 1-bits (i.e., the same Hamming weight). Our results can be applied to any CSBS with mutually independent Boolean variables.