The Eigenvectors of the Transition Matrix as Predictors of the Dynamics of a Synchronous Boolean Network
Ali Muhammad Ali Rushdi, Adnan Ahmad Alsogati
Journal of Advances in Mathematics and Computer Science · pp. 80–99 · Published 2 Sep 2020
10.9734/jamcs/2020/v35i630293Abstract
The synchronous Boolean network model is a simple and powerful tool in describing, analyzing and simulating cellular biological networks. This paper seeks a complete understanding of the dynamics of such a model by utilizing conventional matrix methods, rather than scalar methods, or matrix methods employing the non-conventional semi-tensor products (STP) of matrices. The paper starts by relating the network transition matrix to its function matrix via a self-inverse (involutary) state matrix, which has a simple recursive expression, provided a recursive ordering is employed for the underlying basis vector. Once the network transition matrix is obtained, it can be used to generate a wealth of information including its powers, characteristic equation, minimal equation, 1-eigenvectors, and 0-eigenvectors. These might be used to correctly predict both the transient behavior and (more importantly) the cyclic behavior of the network. In a short-cut partial variant of the proposed approach, the step of computing the transition matrix might be by-passed. The reason for this is that the transition matrix and the function matrix are similar matrices that share the same characteristic equation and hence the function matrix might suffice when only the partial information supplied by the characteristic equation is all that is needed. We demonstrate the conceptual simplicity and practical utility of our approach via two illustrative examples. The first example illustrates the computation of 1-eigenvectors (that can be used to identify loops or attractors), while the second example deals with the evaluation of 0-eigenvectors (that can be used to explore transient chains). Since attractors are the main concern in the underlying model, then analysis of the Boolean network might be confined to the determination of 1-eigenvectors only.
References (62)
- 1 A logical calculus of the ideas immanent in nervous activity [DOI]
- 2 A Set of Measures of Centrality Based on Betweenness [DOI]
- 3 A Graph-theoretic perspective on centrality [DOI]
- 4 Analysis and Control of Boolean Networks: A Semi-tensor Product Approach
- 5 A Linear Representation of Dynamics of Boolean Networks [DOI]
- 6 Invariant Subspaces of Matrices with Applications [DOI]
- 7 Linear systems
- 8 BoolNet—an R package for generation, reconstruction and analysis of Boolean networks [DOI]
- 9 A Maximum Principle for Single-Input Boolean Control Networks [DOI]
- 10 Error Control Coding, Second Edition
- 11 Survey on semi‐tensor product method with its applications in logical networks and other finite‐valued systems [DOI]
- 12 Introduction to Operator Theory and Invariant Subspaces [DOI]
- 13 A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks [DOI]
- 14 FINDING CYCLES IN SYNCHRONOUS BOOLEAN NETWORKS WITH APPLICATIONS TO BIOCHEMICAL SYSTEMS [DOI]
- 15 Complete Synchronization of Boolean Networks [DOI]
- 16 Input-State Approach to Boolean Networks [DOI]
- 17 Scalar Equations for Synchronous Boolean Networks With Biological Applications [DOI]
- 18 State–Space Analysis of Boolean Networks [DOI]
- 19 On the computation of fixed points in Boolean networks [DOI]
- 20 Boolean functions and equations
- 21 Boolean Reasoning: The Logic of Boolean Equations
- 22 Logic design and switching theory
- 23 Efficient solution of linear diophantine equations [DOI]
- 24 Model Construction of Boolean Network via Observed Data [DOI]
- 25 Synchronization Design of Boolean Networks Via the Semi-Tensor Product Method [DOI]
- 26 Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations [DOI]
- 27 Using Synchronous Boolean Networks to Model Several Phenomena of Collective Behavior [DOI]
- 28 Linear analysis of switching nets [DOI]
- 29 Using variable-entered karnaugh maps to solve boolean equations [DOI]
- 30 Switching-Algebraic Analysis of System Reliability [DOI]
- 31 Efficient Solution of Boolean Equations Using Variable-Entered Karnaugh Maps
- 32 Modern Switching Theory and Digital Design
- 33 The mathematics of coding theory
- 34 On Boolean Control Networks — An Algebraic Approach [DOI]
- 35 The Characteristic Polynomial and Determinant Are Not Ad Hoc Constructions [DOI]
- 36 A Novel Method for Compact Listing of All Particular Solutions of a System of Boolean Equations [DOI]
- 37 ON SELF-INVERSE BINARY MATRICES OVER THE BINARY GALOIS FIELD [DOI]
- 38 ON REDUCED SCALAR EQUATIONS FOR SYNCHRONOUS BOOLEAN NETWORKS [DOI]
- 39 Analysis of Boolean Networks Using an Optimized Algorithm of Structure Matrix Based on Semi-tensor Product [DOI]
- 40 State-Logic Relations for Autonomous Sequential Networks [DOI]
- 41 Characteristic and Minimal Polynomials of Linear Cellular Automata [DOI]
- 42 Reed-Muller descriptions of symmetric functions [DOI]
- 43 Improved Calculation Scheme of Structure Matrix of Boolean Network Using Semi-tensor Product [DOI]
- 44 On the cycles of Boolean networks [DOI]
- 45 On Limitations of Using Scalar Equations for Analyzing Synchronous Boolean Networks
- 46 Fundamental Structure/Behaviour Relationships in Synchronous Boolean Neural Networks [DOI]
- 47 New algorithm for finding fixed points and cycles of Boolean network [DOI]
- 48 A behavioral summary for completely random nets [DOI]
- 49 ON THE MINIMAL POLYNOMIAL OF A MATRIX [DOI]
- 50 An Algorithm to Find Cycles of Biochemical Systems [DOI]
- 51 Concepts in Boolean network modeling: What do they all mean? [DOI]
- 52 Karnaugh-Map Utility in Medical Studies: The Case of Fetal Malnutrition [DOI]
- 53 Utilization of Karnaugh Maps in Multi-Value Qualitative Comparative Analysis [DOI]
- 54 A New Cryptographic Scheme Utilizing the Difficulty of Big Boolean Satisfiability [DOI]
- 55 Finding All Solutions of the Boolean Satisfiability Problem, If Any, via Boolean Equation Solving [DOI]
- 56 Alternative approach to calculate the structure matrix of Boolean network with semi‐tensor product [DOI]
- 57 Satisfiability in intuitionistic fuzzy logic with realistic tautology
- 58 Matrix approach to simplify Boolean networks [DOI]
- 59 Boolean Curve Fitting with the Aid of Variable-Entered Karnaugh Maps [DOI]
- 60 Solution of Boolean equations via atomic decomposition into independent switching equations [DOI]
- 61 Identifying influential vertices in boolean networks through dynamical voter rank [DOI]
- 62 A Novel Minimization Method for Sensor Deployment Via Heuristic 2-Sat Solution [DOI]
Cited by 7
Ali Muhammad Ali Rushdi, Hamzah Abdul Majid Serag · International Journal of Pathogen Research · 2021
Z. Ma · Applied Mathematics and Nonlinear Sciences · 2023
Haitao Li, Xinrong Yang, Wenrong Li · From Boolean Matrix Theory to Logical Dynamical Systems · 2025
Showing 3 of 7 known citations — external sources report more than can currently be individually listed.
Related research
- Study of Numerical Stability for Neutral Differential Equations with Delay by Θ- Method — shares topic coverage
- Impacts of Anthropogenic Activities on Changes in the Land Use Patterns over a Span of Three Decades (1979 to 2010): Case of Dassa-Zoume and Glazoue in Benin — shares topic coverage
- Evolution of Mangrove Landscapes in the Coubalan Municipality (Casamance, Senegal, West Africa): A Diachronic Analysis Using Remote Sensing — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
7
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.