Sebastian F. Ruf

Sebastian F. Ruf, Magnus Egerstedt, Jeff S. Shamma

This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.

Sebastian F. Ruf, Magnus Egersted, Jeff S. Shamma

The problem of controlling complex networks is of interest to disciplines ranging from biology to swarm robotics. However, controllability can be too strict a condition, failing to capture a range of desirable behaviors. Herdability, which describes the ability to drive a system to a specific set in the state space, was recently introduced as an alternative network control notion. This paper considers the application of herdability to the study of complex networks under the assumption that a positive system evolves on the network. The herdability of a class of networked systems is investigated and two problems related to ensuring system herdability are explored. The first is the input addition problem, which investigates which nodes in a network should receive inputs to ensure that the system is herdable. The second is a related problem of selecting the best single node from which to herd the network, in the case that a single node is guaranteed to make the system is herdable. In order to select the best herding node, a novel control energy based herdability centrality measure is introduced.

Sebastian F. Ruf, Matthew T. Hale, Talha Manzoor et al.

In this paper, we study the global stability properties of a multi-agent model of natural resource consumption that balances ecological and social network components in determining the consumption behavior of a group of agents. The social network is assumed to be leaderless, a condition that ensures that no single node has a greater influence than any other node on the dynamics of the resource consumption. It is shown that any network structure can be made leaderless by the social preferences of the agents. The ecological network component includes a quantification of each agent's environmental concern, which captures each individual agent's threshold for when a resource becomes scarce. We show that leaderlessness and a mild bound on agents' environmental concern are jointly sufficient for global asymptotic stability of the consumption network to a positive consumption value, indicating that appropriately configured networks can continuously consume a resource without driving its value to zero. The behavior of these leaderless resource consumption networks is verified in simulation.

Sebastian F. Ruf, Keith Paarporn, Philip E. Paré

The spread of new products in a networked population is often modeled as an epidemic. However, in the case of `complex' contagion, these models {do not capture nuanced, dynamic social reinforcement effects in adoption behavior}. In this paper, we investigate a model of complex contagion which allows a coevolutionary interplay between adoption, modeled as an SIS epidemic spreading process, and social reinforcement effects, modeled as consensus opinion dynamics. Asymptotic stability analysis of the all-adopt as well as the none-adopt equilibria of the combined opinion-adoption model is provided through the use of Lyapunov arguments. In doing so, sufficient conditions are provided which determine the stability of the `flop' state, where no one adopts the product and everyone's opinion of the product is least favorable, and the `hit' state, where everyone adopts and their opinions are most favorable. These conditions are shown to extend to the bounded confidence opinion dynamic under a stronger assumption on the model parameters. To conclude, numerical simulations demonstrate behavior of the model which reflect findings from the sociology literature on adoption behavior.