Related papers: Node Balanced Steady States: Unifying and Generali…
Statistical models provide a powerful and useful class of approximations for calculating reaction rates by bypassing the need for detailed, and often difficult, dynamical considerations. Such approaches invariably invoke specific…
We have studied the neutral-ionic transition in organic mixed-stack compounds. A unified model has been derived which, in limiting cases, is equivalent to the models proposed earlier, the donor-acceptor model and the ionic Hubbard model.…
Stable chaos is a generalization of the chaotic behaviour exhibited by cellular automata to continuous-variable systems and it owes its name to an underlying irregular and yet linearly stable dynamics. In this review we discuss analogies…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…
A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high…
We conduct a systematic study of asynchronous models of distributed computing consisting of identical finite-state devices that cooperate in a network to decide if the network satisfies a given graph-theoretical property. Models discussed…
Despite their noted potential in polynomial-system solving, there are few concrete examples of Newton-Okounkov bodies arising from applications. Accordingly, in this paper, we introduce a new application of Newton-Okounkov body theory to…
Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…
Due to the fact much of today's data can be represented as graphs, there has been a demand for generalizing neural network models for graph data. One recent direction that has shown fruitful results, and therefore growing interest, is the…
Power law systems have been studied extensively due to their wide-ranging applications, particularly in chemistry. In this work, we focus on power law systems that can be decomposed into stoichiometrically independent subsystems. We show…
The convergence to equilibrium of mass action reaction-diffusion systems arising from networks of chemical reactions is studied. The considered reaction networks are assumed to satisfy the detailed balance condition and have no boundary…
Random graph models have been instrumental in characterizing complex networks, but chemical reaction networks (CRNs) are better represented as hypergraphs. Traditional models of random CRNs often reduce CRNs to bipartite graphs,…
Linear conjugacy offers a new perspective to broaden the scope of stable biochemical reaction networks to the systems linearly conjugated to the well-established complex balanced mass action systems ($\ell$cCBMASs). This paper addresses the…
Multistationary chemical reaction networks are of interest to scientists and mathematicians alike. While some criteria for multistationarity exist, obtaining explicit reaction rates and steady states that exhibit multistationarity for a…
The class of entangled $N$-qubit states known as graph states, and the corresponding stabilizer groups of $N$-qubit Pauli observables, have found a wide range of applications in quantum information processing and the foundations of quantum…
Previous studies have inferred robust stability of reaction networks by utilizing linear programs or iterative algorithms. Such algorithms become tedious or computationally infeasible for large networks. In addition, they operate like…
This work analyzes the convergence properties of signed networks with nonlinear edge functions. We consider diffusively coupled networks comprised of maximal equilibrium-independent passive (MEIP) dynamics on the nodes, and a general class…
This paper explores the conditions for determining fixed nodes in structured networks, specifically focusing on directed acyclic graphs (DAGs). We introduce several necessary and sufficient conditions for determining fixed nodes in…
We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…
We present a computational procedure to characterize the signs of sensitivities of steady states to parameter perturbations in chemical reaction networks.