Related papers: Dynamical Stability of Threshold Networks over Und…
This paper deals with identifiability of undirected dynamical networks with single-integrator node dynamics. We assume that the graph structure of such networks is known, and aim to find graph-theoretic conditions under which the state…
We consider a nonlinear dynamical system on a signed graph, which can be interpreted as a mathematical model of social networks in which the links can have both positive and negative connotations. In accordance with a concept from social…
Understanding which system structure can sustain stable dynamics is a fundamental step in the design and analysis of large scale dynamical systems. Towards this goal, we investigate here the structural stability of systems with a random…
We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched…
The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks,…
This paper studies the signed networks in the presence of stubborn links, based on the structural balance theory. Each agent in the network has a mixture of positive and negative links represent friendly and antagonistic interactions and…
The level of systemic risk in economic and financial systems is strongly determined by the structure of the underlying networks of interdependent entities that can propagate shocks and stresses. Since changes in network structure imply…
We study delay-induced transitions in consensus dynamics on signed networks with a ring topology. The proposed model is formulated as a system of delay differential equations incorporating both cooperative and antagonistic interactions, as…
Recent studies from social, biological, and engineering network systems have drawn attention to the dynamics over signed networks, where each link is associated with a positive/negative sign indicating trustful/mistrustful,…
This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. In particular, we are interested in…
This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…
The abundance of data about social relationships allows the human behavior to be analyzed as any other natural phenomenon. Here we focus on balance theory, stating that social actors tend to avoid establishing cycles with an odd number of…
This letter examines the controllability of consensus dynamics on matrix-weighed networks from a graph-theoretic perspective. Unlike the scalar-weighted networks, the rank of weight matrix introduces additional intricacies into…
Social networks inherently exhibit complex relationships that can be positive or negative, as well as directional. Understanding balance in these networks is crucial for unraveling social dynamics, yet traditional theories struggle to…
We study a graph-theoretic approach to the $\mathcal{H}_{\infty}$ performance of leader following consensus dynamics on directed and undirected graphs. We first provide graph-theoretic bounds on the system $\mathcal{H}_{\infty}$ norm of the…
The modeling of networks, specifically generative models, have been shown to provide a plethora of information about the underlying network structures, as well as many other benefits behind their construction. Recently there has been a…
Threshold-linear networks consist of simple units interacting in the presence of a threshold nonlinearity. Competitive threshold-linear networks have long been known to exhibit multistability, where the activity of the network settles into…
In this paper, we study weakly dynamic undirected graphs, that can be used to represent some logistic networks. The goal is to deliver all the delivery points in the network. The network exists in a mostly stable environment, except for a…
Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states, while directed…
Studying significant network patterns, known as graphlets (or motifs), has been a popular approach to understand the underlying organizing principles of complex networks. Statistical significance is routinely assessed by comparing to null…