The Power Allocation Game on A Network: Balanced Equilibrium

This paper studies a special kind of equilibrium termed as "balanced equilibrium" which arises in the power allocation game defined in \cite{allocation}. In equilibrium, each country in antagonism has to use all of its own power to counteract received threats, and the "threats" made to each adversary just balance out the threats received from that adversary. This paper establishes conditions on different types of networked international environments in order for this equilibrium to exist. The paper also links the existence of this type of equilibrium on structurally balanced graphs to the Hall's Maximum Matching problem and the Max Flow problem

Operator-Theoretic Characterization of Eventually Monotone Systems

Monotone systems are dynamical systems whose solutions preserve a partial order in the initial condition for all positive times. It stands to reason that some systems may preserve a partial order only after some initial transient. These systems are usually called eventually monotone. While monotone systems have a characterization in terms of their vector fields (i.e. Kamke-Muller condition), eventually monotone systems have not been characterized in such an explicit manner. In order to provide a characterization, we drew inspiration from the results for linear systems, where eventually monotone (positive) systems are studied using the spectral properties of the system (i.e. Perron-Frobenius property). In the case of nonlinear systems, this spectral characterization is not straightforward, a fact that explains why the class of eventually monotone systems has received little attention to date. In this paper, we show that a spectral characterization of nonlinear eventually monotone systems can be obtained through the Koopman operator framework. We consider a number of biologically inspired examples to illustrate the potential applicability of eventual monotonicity.Comment: 13 page

Dynamics over Signed Networks

A signed network is a network with each link associated with a positive or negative sign. Models for nodes interacting over such signed networks, where two different types of interactions take place along the positive and negative links, respectively, arise from various biological, social, political, and economic systems. As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature. This paper reviews a few fundamental convergence results for such dynamics over deterministic or random signed networks under a unified algebraic-graphical method. We show that a systematic tool of studying node state evolution over signed networks can be obtained utilizing generalized Perron-Frobenius theory, graph theory, and elementary algebraic recursions.Comment: In press, SIAM Revie

Opinion Dynamics in Social Networks with Hostile Camps: Consensus vs. Polarization

Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and "trustful," and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups, however, require beyond these conventional models due to ubiquitous competition and distrust between some pairs of agents, which are usually characterized by repulsive couplings and may lead to clustering of the opinions. A simple yet insightful model of opinion dynamics with both attractive and repulsive couplings was proposed recently by C. Altafini, who examined first-order consensus algorithms over static signed graphs. This protocol establishes modulus consensus, where the opinions become the same in modulus but may differ in signs. In this paper, we extend the modulus consensus model to the case where the network topology is an arbitrary time-varying signed graph and prove reaching modulus consensus under mild sufficient conditions of uniform connectivity of the graph. For cut-balanced graphs, not only sufficient, but also necessary conditions for modulus consensus are given.Comment: scheduled for publication in IEEE Transactions on Automatic Control, 2016, vol. 61, no. 7 (accepted in August 2015