We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Edges, Chains, Shadows, Neighbors and Subgraphs in the Intrinsic Order Graph.
- Authors
Gonz´alez, Luis
- Abstract
Many different scientific, technical or social phenomena can be modeled by a complex system depending on a large number n of random Boolean variables. Such systems are called complex stochastic Boolean systems (CSBSs). The most useful representation of a CSBS is the intrinsic order graph. This is a symmetric digraph on 2n nodes, with a characteristic fractal structure. In this paper, different properties of the intrinsic order graph are studied, namely those dealing with its edges; chains; shadows, neighbors and degrees of its vertices; and some relevant subgraphs, as well as the natural isomorphisms between them.
- Subjects
STOCHASTIC processes; BOOLEAN functions; GRAPH theory; COMPLEXITY (Philosophy); RANDOM variables; INTERMITTENCY (Nuclear physics); ISOMORPHISM (Mathematics)
- Publication
IAENG International Journal of Applied Mathematics, 2012, Vol 42, Issue 1, p66
- ISSN
1992-9978
- Publication type
Article