arXiv subjects

Zhengping Ji

Publications and source records attributed to Zhengping Ji.

26 records · Page 2Linked to original sources

arXiv2023

Transition System Representation of Boolean Control Networks

First, the topological structure of a transition system is studied. Then, two types of transition system (TS) representations of Boolean networks (BNs) and Boolean control networks (BCNs) are investigated. The first kind of representation is state-based, which converts a BCN into a TS with either distinct control or non-distinct control. The second representation is output-based, which is also called the simulation of the original BCN. Some applications are also studied.

eess.SY↗

arXiv2023

Aggregated (Bi-)Simulation of Finite Valued Networks

The paper provides a method to approximate a large-scale finite-valued network by a smaller model called the aggregated simulation, which is a combination of aggregation and (bi-)simulation. First, the algebraic state space representation (ASSR) of a transition system is presented. Under output equivalence, the quotient system is obtained, which is called the simulation of the original transition system. The ASSR of the quotient system is obtained. The aggregated (bi-)simulation is execueted in several steps: a large scale finite-valued network is firstly aggregated into several blocks, each of which is considered as a network where the in-degree nodes and out-degree nodes are considered as the block inputs and block outputs respectively. Then the dynamics of each block is converted into its quotient system, called its simulation. Then the overall network can be approximated by the quotient systems of each blocks, which is called the aggregated simulation. If the simulation of a block is a bi-simulation, the approximation becomes a lossless transformation. Otherwise, the quotient system is only a (non-deterministic) transition system, and it can be replaced by a probabilistic networks. Aggregated simulation can reduce the dimension of the original network, while a tradeoff between computation complexity and approximation error need to be decided.

eess.SY↗

arXiv2023

Semi-Tensor Product of Hypermatrices with Application to Compound Hypermatrices

The semi-tensor product (STP) of matrices is extended to the STP of hypermatrices. Some basic properties of the STP of matrices are extended to the STP of hypermatrices. The hyperdeterminant of hypersquares is introduced. Some algebraic and geometric structures of matrices are extended to hypermatrices. Then the compound hypermatrix is proposed. The STP of hypermatrix is used to compound hypermatrix. Basic properties are proved to be available for compound hypermatrix.

eess.SY↗

arXiv2022

From Dimension-Free Manifolds to Dimension-varying Control Systems

Starting from the vector multipliers, the inner product, norm, distance, as well as addition of two vectors of different dimensions are proposed, which makes the spaces into a topological vector space, called the Euclidean space of different dimension (ESDD). An equivalence is obtained via distance. As a quotient space of ESDDs w.r.t. equivalence, the dimension-free Euclidean spaces (DFESs) and dimension-free manifolds (DFMs) are obtained, which have bundled vector spaces as its tangent space at each point. Using the natural projection from a ESDD to a DFES, a fiber bundle structure is obtained, which has ESDD as its total space and DFES as its base space. Classical objects in differential geometry, such as smooth functions, (co-)vector fields, tensor fields, etc., have been extended to the case of DFMs with the help of projections among different dimensional Euclidean spaces. Then the dimension-varying dynamic systems (DVDSs) and dimension-varying control systems (DVCSs) are presented, which have DFM as their state space. The realization, which is a lifting of DVDSs or DVCSs from DFMs into ESDDs, and the projection of DVDSs or DVCSs from ESDDs onto DFMs are investigated.

eess.SY↗

arXiv2022

Invariant and Dual Invariant Subspaces of $k$-valued Networks

Consider a $k$-valued network. Two kinds of (control) invariant subspaces, called state and dual invariant subspaces, are proposed, which are subspaces of state space and dual space respectively. Algorithms are presented to verify whether a dual subspace is a dual or dual control invariant subspace. The bearing space of $k$-valued (control) networks is introduced. Using the structure of bearing space, the universal invariant subspace is introduced, which is independent of the dynamics of particular networks. Finally, the relationship between state invariant subspace and dual invariant subspace of a network is investigated. A duality property shows that if a dual subspace is invariant then its perpendicular state subspace is also invariant and vice versa.

eess.SY↗

arXiv2021

Hidden Order of Boolean Networks

It is a common belief that the order of a Boolean network is mainly determined by its attractors, including fixed points and cycles. Using semi-tensor product (STP) of matrices and the algebraic state-space representation (ASSR) of Boolean networks, this paper reveals that in addition to this explicit order, there is certain implicit or hidden order, which is determined by the fixed points and limit cycles of their dual networks. The structure and certain properties of dual networks are investigated. Instead of a trajectory, which describes the evolution of a state, hidden order provides a global picture to describe the evolution of the overall network. It is our conjecture that the order of networks is mainly determined by the dual attractors via their corresponding hidden orders. The previously obtained results about Boolean networks are further extended to the k-valued case.

eess.SY↗

arXiv2021

Weighted and Near Weighted Potential Games with Application to Game Theoretic Control

An algorithm is proposed to verify whether a finite game is a weighted potential game (WPG) without pre-knowledge on its weights. Then the algorithm is also applied to find the closest WPG for a given finite game. The concept and criterion of near weighted potential games (NWPGs) are given, indicating the evolutionary equivalence between a finite game and its closest WPG. Based on this, a method is proposed for replacing PGs by NWPGs in game theoretic control, which improved the applicability of PG-based optimization.

cs.GT↗

arXiv2021

On Perfect Hypercomplex Algebra

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are reviewed. The zero set is defined for non-invertible hypercomplex numbers in a given PHA, and a characteristic function is proposed for calculating zero set. Then PHA of different dimensions are considered. First, $2$-dimensional PHAs are considered as examples to calculate their zero sets etc. Second, all the $3$-dimensional PHAs are obtained and the corresponding zero sets are investigated. Third, $4$-dimensional or even higher dimensional PHAs are also considered. Finally, matrices over pre-assigned PHA, called perfect hypercomplex matrices (PHMs) are considered. Their properties are also investigated.

math.RA↗