Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/72767
Título: n-tuples of 0s and 1s: necessary and sufficient conditions for intrinsic order
Autores/as: González, L. 
Clasificación UNESCO: 1208 Probabilidad
Palabras clave: Probabilities
Fecha de publicación: 2003
Publicación seriada: Lecture Notes in Computer Science 
Conferencia: International Conference on Computational Science and Its Applications (ICCSA 2003) 
Resumen: In an arbitrary stochastic Boolean model we compare the values of a finite set of binary states probabilities, without computing them. The relative positions of 0s and 1s in the binary n-tuples decide by themselves which one has the largest probability. This positional criterion defines an intrinsic order relation in {0,1}(n), which is independent of,the probabilities of the Boolean variables. We obtain different characterizations, as well as necessary conditions and sufficient conditions, for intrinsic order. These propositions explain some relevant properties of the structure of the intrinsic order graph. The results can be applied in many different areas: wherever the random variables of the problem are propositional variables (false or true, i.e: 0 or 1).
URI: http://hdl.handle.net/10553/72767
ISBN: 978-3-540-40155-1
ISSN: 0302-9743
DOI: 10.1007/3-540-44839-X_99
Fuente: Kumar V., Gavrilova M.L., Tan C.J.K., L’Ecuyer P. (eds) Computational Science and Its Applications — ICCSA 2003. Lecture Notes in Computer Science, [ISSN 0302-9743], vol 2667, p. 937-946. Springer, Berlin, Heidelberg. (2003)
Colección:Actas de congresos
Vista completa

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.