Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/72747
Title: A picture for complex stochastic Boolean systems: the intrinsic order graph
Authors: Gonźalez, Luis 
UNESCO Clasification: 1208 Probabilidad
Issue Date: 2006
Project: Simulacion Numerica de Campos de Viento Orientados A Procesos Atmofericos. 
Journal: Lecture Notes in Computer Science 
Conference: 6th International Conference on Computational Science (ICCS 2006) 
Abstract: 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 Os and Is, (u(1),...,u(n)), and it has a certain occurrence probability Pr{(u(1),...,u(n))}. The ordering between the 2" binary ntuple probabilities, Pr{(u(n),...,u(n))}, 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.
URI: http://hdl.handle.net/10553/72747
ISBN: 978-3-540-34383-7
ISSN: 0302-9743
DOI: 10.1007/11758532_42
Source: Computational Science - Iccs 2006, Pt 3, Proceedings [ISSN 0302-9743], v. 3993, p. 305-312, (2006)
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

13
checked on Jan 17, 2021

WEB OF SCIENCETM
Citations

6
checked on Jan 17, 2021

Page view(s)

46
checked on Jan 17, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



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