Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/16412
Title: Labeling the nodes in the intrinsic order graph with their weights
Authors: González, Luis 
UNESCO Clasification: 110202 Algebra de Boole
Keywords: Complex stochastic Boolean systems
Hamming weight
Intrinsic order
Intrinsic order graph
Subgraphs
Subposets
Issue Date: 2013
Journal: Lecture Notes in Electrical Engineering 
Conference: 2012 World Congress on Engineering, WCE 2012 
Abstract: 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
Source: Lecture Notes in Electrical Engineering[ISSN 1876-1100],v. 229 LNEE, p. 523-536
Rights: by-nc-nd
Appears in Collections:Actas de congresos
Thumbnail
Adobe PDF (137,16 kB)
Show full item record

Page view(s)

8
checked on Aug 8, 2020

Download(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.