Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/72524
Title: Complex stochastic boolean systems: generating and counting the binary n-tuples intrinsically less or greater than u
Authors: González, Luis 
UNESCO Clasification: 1208 Probabilidad
Keywords: Order graph
Probabilities
Complex stochastic boolean systems
Hamming weight
Intrinsic order
Intrinsic order graph
(In)comparable binary n-tuples
Issue Date: 2009
Conference: World Congress on Engineering and Computer Science 
Abstract: 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(n) associated binary n-tuples u = (u(1), ..., u(n)) is an element of {0, 1}(n). In this context, for every fixed binary n-tuple u, this paper presents two simple algorithms-exclusively based on the vector of positions of the 1-bits (0-bits, respectively) in u for rapidly generating (and counting) all the binary n-tuples v whose occurrence probabilities Pr {v} are always less than or equal to (greater than or equal to, respectively) Pr{u}. Results are illustrated with the intrinsic order graph and they obey to a nice duality property (interchange 0s by 1s and "more probable" by "less probable").
URI: http://hdl.handle.net/10553/72524
ISBN: 978-988-17012-6-8
Source: Wcecs 2009: World Congress On Engineering And Computer Science, Vols I, p. 195-200, (2009)
Appears in Collections:Actas de congresos
Show full item record

WEB OF SCIENCETM
Citations

2
checked on Aug 9, 2020

Page view(s)

11
checked on Aug 8, 2020

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.