arXiv subjects

Shaoxuan Cui

Publications and source records attributed to Shaoxuan Cui.

15 recordsLinked to original sources

arXiv2026

Stability and Robustness of Tensor-Coupled Flow-Conservation Dynamical Systems on Hypergraphs

This paper develops an entropy-based stability and robustness framework for nonlinear hypergraph dynamics with conservation and flow balance. We consider generator-form systems on the simplex whose state-dependent transition rates capture higher-order (tensor) interactions among nodes. Under a tensor generalized detailed-balance (TGDB) condition, we show that the system admits a unique equilibrium and an entropy Lyapunov function ensuring global asymptotic stability. The Jacobian restricted to the tangent subspace of the simplex is Hurwitz, and its spectral gap determines the exponential convergence rate. Building on this structure, we derive first-order sensitivity bounds of the equilibrium under perturbations of the coupling tensor and establish a local input-to-state stability (ISS) estimate with respect to external inputs. The results reveal a quantitative link between the spectral gap and the system's robustness margin: larger spectral gaps imply smaller equilibrium shifts and faster recovery under structural or parametric perturbations. Numerical experiments on tensor-coupled flow models confirm the theoretical predictions and illustrate how the proposed entropy-dissipating framework unifies stability and robustness analysis for conservative higher-order network systems.

eess.SY↗

arXiv2026

Linear Feedback Controller for Homogeneous Polynomial Systems

This paper studies stabilization and its corresponding closed-loop region-of-attraction (ROA) for homogeneous polynomial dynamical systems whose nonlinear term admits an orthogonally decomposable (ODECO) tensor representation. While recent tensor-based results provide explicit solutions and sharp global characterizations for open-loop ODECO systems, closed-loop synthesis and computable ROA estimates are still often dominated by local linearization or Lyapunov/SOS (sum of squares) methods, which can be conservative and computationally demanding. We propose a structure-preserving linear feedback design that shares the ODECO eigenbasis of the system's tensor, thereby enabling closed-form trajectory expressions, explicit convergence/escape thresholds, and sharp ROA characterizations. Under mild conditions, we further derive robustness/ISS-type bounds for bounded disturbances. Numerical examples validate the theoretical results.

eess.SY↗

arXiv2026

Invariance of Competition Outcomes in Hypergraph Competitive Dynamics

Winner-take-all (WTA)--type selection is a fundamental mechanism in networked competition, yet its dependence on higher-order interactions remains insufficiently understood. We study a Lotka--Volterra competitive dynamics on higher-order networks, where classical pairwise inhibition is augmented by multi-way interaction terms induced by hyperedges of uniform hypergraphs. The proposed model shows multiple competitive outcomes, including WTA, winner-share-all (WSA), and variant winner-take-all (VWTA). The existence, uniqueness and stability of equilibria are rigorously proved through mathematical analysis, which relies on classical stability theory and recent advances in tensor algebra. We show that the eventual selection outcome is relatively insensitive to the hyperedge order and the specific higher-order coupling structure, and is instead determined by a small set of interpretable scalar parameters, such as the ratio between self-inhibition and lateral-inhibition and the external inputs. Numerical experiments support the theory by showing that higher-order interactions affect convergence and steady states, yet yield the similar outcome taxonomy (WTA/WSA/VWTA) as in standard graphs. These results provide a network-scientific explanation of the robustness of WTA-type outcomes under complex group interactions and offer principled guidance for designing selection mechanisms on higher-order networks.

eess.SY↗

arXiv2026

Markov Chains and Random Walks with Memory on Hypergraphs: A Tensor-Based Approach

Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains with memory. Our formulation introduces an even-order paired tensor that links folded and unfolded dynamics and characterizes their steady states and convergence. We further show that a Markov chain with memory can be approximated by a low-dimensional nonlinear tensor-based system and then provide a full system analysis. As an application, we define random walks on hypergraphs where memory naturally arises from the hyperedge structure, providing new tools for analyzing higher-order networks with time-dependent effects.

eess.SY↗

arXiv2025

On Tensor-based Polynomial Hamiltonian Systems

It is known that a linear system with a system matrix A constitutes a Hamiltonian system with a quadratic Hamiltonian if and only if A is a Hamiltonian matrix. This provides a straightforward method to verify whether a linear system is Hamiltonian or whether a given Hamiltonian function corresponds to a linear system. These techniques fundamentally rely on the properties of Hamiltonian matrices. Building on recent advances in tensor algebra, this paper generalizes such results to a broad class of polynomial systems. As the systems of interest can be naturally represented in tensor forms, we name them tensor-based polynomial systems. Our main contribution is that we formally define Hamiltonian cubical tensors and characterize their properties. Crucially, we demonstrate that a tensor-based polynomial system is a Hamiltonian system with a polynomial Hamiltonian if and only if all associated system tensors are Hamiltonian cubical tensors-a direct parallel to the linear case. Additionally, we establish a computationally tractable stability criterion for tensor-based polynomial Hamiltonian systems. Finally, we validate all theoretical results through numerical examples and provide a further intuitive discussion.

eess.SY↗

arXiv2025

Higher-order Laplacian dynamics on hypergraphs with cooperative and antagonistic interactions

Laplacian dynamics on a signless graph characterize a class of linear interactions, where pairwise cooperative interactions between all agents lead to the convergence to a common state. On a structurally balanced signed graph, the agents converge to values of the same magnitude but opposite signs (bipartite consensus), as illustrated by the well-known Altafini model. These interactions have been modeled using traditional graphs, where the relationships between agents are always pairwise. In comparison, higher-order networks (such as hypergraphs), offer the possibility to capture more complex, group-wise interactions among agents. This raises a natural question: can collective behavior be analyzed by using hypergraphs? The answer is affirmative. In this paper, higher-order Laplacian dynamics on signless hypergraphs are first introduced and various collective convergence behaviors are investigated, in the framework of homogeneous and non-homogeneous polynomial systems. Furthermore, by employing gauge transformations and leveraging tensor similarities, we extend these dynamics to signed hypergraphs, drawing parallels to the Altafini model. Moreover, we explore non-polynomial interaction functions within this framework. The theoretical results are demonstrated through several numerical examples.

eess.SY↗

arXiv2024

Discrete-time SIS Social Contagion Processes on Hypergraphs

Recent research on social contagion processes has revealed the limitations of traditional networks, which capture only pairwise relationships, to characterize complex multiparty relationships and group influences properly. Social contagion processes on higher-order networks (simplicial complexes and general hypergraphs) have therefore emerged as a novel frontier. In this work, we investigate discrete-time Susceptible-Infected-Susceptible (SIS) social contagion processes occurring on weighted and directed hypergraphs and their extensions to bivirus cases and general higher-order SIS processes with the aid of tensor algebra. Our focus lies in comprehensively characterizing the healthy state and endemic equilibria within this framework. The emergence of bistability or multistability behavior phenomena, where multiple equilibria coexist and are simultaneously locally asymptotically stable, is demonstrated in view of the presence of the higher-order interaction. The novel sufficient conditions of the appearance for system behaviors, which are determined by both (higher-order) network topology and transition rates, are provided to assess the likelihood of the SIS social contagion processes causing an outbreak. More importantly, given the equilibrium is locally stable, an explicit domain of attraction associated with the system parameters is constructed. Moreover, a learning method to estimate the transition rates is presented. In the end, the attained theoretical results are supplemented via numerical examples. Specifically, we evaluate the effectiveness of the networked SIS social contagion process by comparing it with the $2^n$-state Markov chain model. These numerical examples are given to highlight the performance of parameter learning algorithms and the system behaviors of the discrete-time SIS social contagion process.

cs.SI↗

arXiv2024

Global and local observability of hypergraphs

This paper studies observability for non-uniform hypergraphs with inputs and outputs. To capture higher-order interactions, we define a canonical non-homogeneous dynamical system with nonlinear outputs on hypergraphs. We then construct algebraic necessary and sufficient conditions based on polynomial ideals and varieties for global observability at an initial state of hypergraphs. An example is given to illustrate the proposed criteria for observability. Further, necessary and sufficient conditions for local observability are derived based on rank conditions of observability matrices, which provide a framework to study local observability for non-uniform hypergraphs. Finally, the similarity of observability for hypergraphs is proposed using similarity of tensors, which reveals the relation of observability between two hypergraphs and helps to check the observability intuitively.

eess.SY↗

arXiv2024

On the analysis of a higher-order Lotka-Volterra model: an application of S-tensors and the polynomial complementarity problem

It is known that the effect of species' density on species' growth is non-additive in real ecological systems. This challenges the conventional Lotka-Volterra model, where the interactions are always pairwise and their effects are additive. To address this challenge, we introduce HOIs (Higher-Order Interactions) which are able to capture, for example, the indirect effect of one species on a second one correlating to a third species. Towards this end, we propose a general higher-order Lotka-Volterra model. We provide an existence result of a positive equilibrium for a non-homogeneous polynomial equation system with the help of S-tensors. Afterward, by utilizing the latter result, as well as the theory of monotone systems and results from the polynomial complementarity problem, we provide comprehensive results regarding the existence, uniqueness, and stability of the corresponding equilibrium. These results can be regarded as natural extensions of many analogous ones for the classical Lotka-Volterra model, especially in the case of full cooperation, competition among two factions, and pure competition. Finally, illustrative numerical examples are provided to highlight our contributions.

eess.SY↗

arXiv2024

On discrete-time polynomial dynamical systems on hypergraphs

This paper studies the stability of discrete-time polynomial dynamical systems on hypergraphs by utilizing the Perron-Frobenius theorem for nonnegative tensors with respect to the tensors Z-eigenvalues and Z-eigenvectors. Firstly, for a multilinear polynomial system on a uniform hypergraph, we study the stability of the origin of the corresponding systems. Next, we extend our results to non-homogeneous polynomial systems on non-uniform hypergraphs. We confirm that the local stability of any discrete-time polynomial system is in general dominated by pairwise terms. Assuming that the origin is locally stable, we construct a conservative (but explicit) region of attraction from the system parameters. Finally, we validate our results via some numerical examples.

eess.SY↗

arXiv2024

On Metzler positive systems on hypergraphs

In graph-theoretical terms, an edge in a graph connects two vertices while a hyperedge of a hypergraph connects any more than one vertices. If the hypergraph's hyperedges further connect the same number of vertices, it is said to be uniform. In algebraic graph theory, a graph can be characterized by an adjacency matrix, and similarly, a uniform hypergraph can be characterized by an adjacency tensor. This similarity enables us to extend existing tools of matrix analysis for studying dynamical systems evolving on graphs to the study of a class of polynomial dynamical systems evolving on hypergraphs utilizing the properties of tensors. To be more precise, in this paper, we first extend the concept of a Metzler matrix to a Metzler tensor and then describe some useful properties of such tensors. Next, we focus on positive systems on hypergraphs associated with Metzler tensors. More importantly, we design control laws to stabilize the origin of this class of Metzler positive systems on hypergraphs. In the end, we apply our findings to two classic dynamical systems: a higher-order Lotka-Volterra population dynamics system and a higher-order SIS epidemic dynamic process. The corresponding novel stability results are accompanied by ample numerical examples.

eess.SY↗

arXiv2023

General SIS diffusion process with indirect spreading pathways on a hypergraph

While conventional graphs only characterize pairwise interactions, higher-order networks (hypergraph, simplicial complex) capture multi-body interactions, which is a potentially more suitable modeling framework for a complex real system. However, the introduction of higher-order interactions brings new challenges for the rigorous analysis of such systems on a higher-order network. In this paper, we study a series of SIS-type diffusion processes with both indirect and direct pathways on a directed hypergraph. In a concrete case, the model we propose is based on a specific choice (polynomial) of interaction function (how several agents influence each other when they are in a hyperedge). Then, by the same choice of interaction function, we further extend the system and propose a bi-virus competing model on a directed hypergraph by coupling two single-virus models together. Finally, the most general model in this paper considers an abstract interaction function under single-virus and bi-virus settings. For the single-virus model, we provide the results regarding healthy state and endemic equilibrium. For the bi-virus setting, we further give an analysis of the existence and stability of the healthy state, dominant endemic equilibria, and coexisting equilibria. All theoretical results are finally supported by some numerical examples.

eess.SY↗

arXiv2023

Discrete-time Layered-network Epidemics Model with Time-varying Transition Rates and Multiple Resources

This paper studies a discrete-time time-varying multi-layer networked SIWS (susceptible-infected-water-susceptible) model with multiple resources under both single-virus and competing multi-virus settings. Besides the human-to-human interaction, we also consider that the disease can diffuse on different types of medium. We use \emph{resources} to refer to any media that the pathogen of a virus can spread through, and do not restrict the resource only to be water. In the single-virus case, we give a full analysis of the system's behaviour related to its healthy state and endemic equilibrium. In the multi-virus case, we show analytically that different equilibria appear driven by the competition among all viruses. We also show that some analytical results of the time-invariant system can be expanded into time-varying cases. Finally, we illustrate the results through some simulations.

eess.SY↗

arXiv2020

Interplay Between Homophily-Based Appraisal Dynamics and Influence-Based Opinion Dynamics: Modeling and Analysis

In social systems, the evolution of interpersonal appraisals and individual opinions are not independent processes but intertwine with each other. Despite extensive studies on both opinion dynamics and appraisal dynamics separately, no previous work has ever combined these two processes together. In this paper, we propose a novel and intuitive model on the interplay between homophily-based appraisal dynamics and influence-based opinion dynamics. We assume that individuals' opinions are updated via the influence network constructed from their interpersonal appraisals, which are in turn updated based on the individual opinions via the homophily mechanism. By theoretical analysis, we characterize the set of equilibria and some transient behavior of our model. Moreover, we establish the equivalence among the convergence of the appraisal network to social balance, the modulus consensus of individual opinions, and the non-vanishing appraisals. Monte Carlo validations further show that the non-vanishing appraisals condition holds for generic initial conditions. Compared with previous works that explain the emergence of social balance via person-to-person homophily mechanism, our model provides an alternative explanation in terms of the person-to-entity homophily mechanism. In addition, our model also describes how individuals' opinions on multiple irrelevant issues become correlated and converge to modulus consensus over time-varying influence networks.

eess.SY↗

arXiv2020

On the Stability of the Endemic Equilibrium of A Discrete-Time Networked Epidemic Model

Networked epidemic models have been widely adopted to describe propagation phenomena. The endemic equilibrium of these models is of great significance in the field of viral marketing, innovation dissemination, and information diffusion. However, its stability conditions have not been fully explored. In this paper we study the stability of the endemic equilibrium of a networked Susceptible-Infected-Susceptible (SIS) epidemic model with heterogeneous transition rates in a discrete-time manner. We show that the endemic equilibrium, if it exists, is asymptotically stable for any nontrivial initial condition. Under mild assumptions on initial conditions, we further prove that during the spreading process there exists no overshoot with respect to the endemic equilibrium. Finally, we conduct numerical experiments on real-world networks to demonstrate our results.

eess.SY↗