Related papers: Convergence Analysis of Signed Nonlinear Networks
Substantive research in the Social Sciences regularly investigates signed networks, where edges between actors are either positive or negative. For instance, schoolchildren can be friends or rivals, just as countries can cooperate or fight…
Network visualization has established as a key complement to network analysis since the large variety of existing network layouts are able to graphically highlight different properties of networks. However, signed networks, i.e., networks…
We study the identifiability of nonlinear network systems with partial excitation and partial measurement when the network dynamics is linear on the edges and nonlinear on the nodes. We assume that the graph topology and the nonlinear…
We study a non-linear dynamical system on networks inspired by the pitchfork bifurcation normal form. The system has several interesting interpretations: as an interconnection of several pitchfork systems, a gradient dynamical system and…
Sufficient conditions of consensus (synchronization) in networks described by digraphs and consisting of identical determenistic SIMO systems are derived. Identical and nonidentical control gains (positive arc weights) are considered.…
This work studies the limitations of uniquely identifying the structure (i.e., topology) of a networked linear system from partial measurements of its nodal dynamics. In general, many networks can be consistent with these measurements; this…
We derive conditions for the identifiability of nonlinear networks characterized by additive dynamics at the level of the edges when all the nodes are excited. In contrast to linear systems, we show that the measurement of all sinks is…
The paper introduces a Signed Generalized Random Dot Product Graph (SGRDPG) model, which is a variant of the Generalized Random Dot Product Graph (GRDPG), where, in addition, edges can be positive or negative. The setting is extended to a…
This paper discusses the interplay of symmetries and stability in the analysis and control of nonlinear dynamical systems and networks. Specifically, it combines standard results on symmetries and equivariance with recent convergence…
This paper proposes a novel signed $\beta$-model for directed signed network, which is frequently encountered in application domains but largely neglected in literature. The proposed signed $\beta$-model decomposes a directed signed network…
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its operation. However, in the real world, links may fail…
Most of the analyses concerning signed networks have focused on the balance theory, hence identifying frustration with undirected, triadic motifs having an odd number of negative edges; much less attention has been paid to their directed…
Although theoretical properties such as expressive power and over-smoothing of graph neural networks (GNN) have been extensively studied recently, its convergence property is a relatively new direction. In this paper, we investigate the…
Link prediction is central to unraveling social network evolution and node relationships, as well as understanding the characteristic mechanisms of complex networks. Currently, research on link prediction for complex dynamic networks…
Many natural systems are organized as networks, in which the nodes (be they cells, individuals or populations) interact in a time-dependent fashion. The dynamic behavior of these networks depends on how these nodes are connected, which can…
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the…
Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There is, however, a subtle difference between networks where weights are continuos…
We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the…
Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions,…
This work is concerned with interconnected networks with non-identical subsystems. We investigate the output consensus of the network where the dynamics are subject to external disturbance and/or reference input. For a network of…