Please use this identifier to cite or link to this item:
Title: Partitioning the intrinsic order graph for complex stochastic Boolean systems
Authors: González, Luis 
UNESCO Clasification: 1208 Probabilidad
110202 Algebra de Boole
Keywords: Complex stochastic Boolean system
Intrinsic order;
Intrinsic order graph
Graph bisection
Chain cover
Issue Date: 2010
Project: Avances en Simulación de Campos de Viento y Radiación Solar. 
Conference: World Congress on Engineering (WCE 2010) 
World Congress on Engineering 2010, WCE 2010 
Abstract: 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(n) nodes (denoted by I-n) that displays all the binary n-tuples in decreasing order of their occurrence probabilities. In this paper, two different ways of partitioning the IOG -with applications to the analysis of CSBSs- are presented. The first one is based on the successive bisections of this graph into smaller and smaller equal-sized subgraphs. The second one consists of decomposing the graph I-n, into totally ordered subsets (chains) of the set {0,1}(n) of all binary n-tuples.
ISBN: 978-988-17012-9-9
ISSN: 2078-0958
Source: WCE 2010 - World Congress on Engineering 2010, v. 1, p. 166-171
Appears in Collections:Actas de congresos
Show full item record


checked on Mar 7, 2021


checked on Mar 7, 2021

Page view(s)

checked on Mar 7, 2021

Google ScholarTM




Export metadata

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