Labeling the nodes in the intrinsic order graph with their weights

Título:	Labeling the nodes in the intrinsic order graph with their weights
Autores/as:	González, Luis
Clasificación UNESCO:	110202 Algebra de Boole
Palabras clave:	Complex stochastic Boolean systems Hamming weight Intrinsic order Intrinsic order graph Subgraphs, et al.
Fecha de publicación:	2013
Publicación seriada:	Lecture Notes in Electrical Engineering
Conferencia:	2012 World Congress on Engineering, WCE 2012
Resumen:	This paper deals with the study of some new properties of the intrinsic order graph. The intrinsic order graph is the natural graphical representation of a complex stochastic Boolean system (CSBS). A CSBS is a system depending on an arbitrarily large number n of mutually independent random Boolean variables. The intrinsic order graph displays its 2n vertices (associated to the CSBS) from top to bottom, in decreasing order of their occurrence probabilities. New relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1-bits in a binary n-tuple) are derived. Further, the distribution of the weights of the 2n nodes in the intrinsic order graph is analyzed…
URI:	http://hdl.handle.net/10553/16412
ISBN:	9789400761896
ISSN:	1876-1100
DOI:	10.1007/978-94-007-6190-2-40
Fuente:	Lecture Notes in Electrical Engineering[ISSN 1876-1100],v. 229 LNEE, p. 523-536
Derechos:	by-nc-nd
Colección:	Actas de congresos

Vista completa