Systems composed of dynamical networks - such as the human body with its biological networks or the global economic network consisting of regional clusters - often exhibit complicated collective dynamics. Three fundamental processes that are typically present are failure, damage spread, and recovery. Here we develop a model for such systems and find phase diagrams for single and interacting networks. By investigating networks with a small number of nodes, where finite-size effects are pronounced, we describe the spontaneous recovery phenomenon present in these systems. In the case of interacting networks the phase diagram is very rich and becomes increasingly more complex as the number of interacting networks increases. In the simplest example of two interacting networks we find two critical points, four triple points, ten allowed transitions, and two forbidden transitions, as well as complex hysteresis loops. Remarkably, we find that triple points play the dominant role in constructing the optimal repairing strategy in damaged interacting systems. To test our model, we analyze an example of real interacting financial networks and find evidence of rapid dynamical transitions between well-defined states, in agreement with the predictions of our model.

This dissertation can be essentially divided into two parts. The first, consisting of Chapters I, II, and III, studies the graph theoretic nature of complex systems. This includes the spectral properties of such systems and in particular their influence on the systems dynamics. In the second part of this dissertation, or Chapter IV, we consider a new class of one-dimensional dynamical systems or functions with an eventual negative Schwarzian derivative motivated by some maps arising in neuroscience. To aid in understanding the interplay between the graph structure of a network and its dynamics we first introduce the concept of an isospectral graph reduction in Chapter I. Mathematically, an isospectral graph transformation is a graph operation (equivalently matrix operation) that modifies the structure of a graph while preserving the eigenvalues of the graphs weighted adjacency matrix. Because of their properties such reductions can be used to study graphs (networks) modulo any specific graph structure e.g. cycles of length n, cliques of size k, nodes of minimal/maximal degree, centrality, betweenness, etc. The theory of isospectral graph reductions has also lead to improvements in the general theory of eigenvalue approximation. Specifically, such reductions can be used to improved the classical eigenvalue estimates of Gershgorin, Brauer, Brualdi, and Varga for a complex valued matrix. The details of these specific results are found in Chapter II. The theory of isospectral graph transformations is then used in Chapter III to study time-delayed dynamical systems and develop the notion of a dynamical network expansion and reduction which can be used to determine whether a network of interacting dynamical systems has a unique global attractor. In Chapter IV we consider one-dimensional dynamical systems of an interval. In the study of such systems it is often assumed that the functions involved have a negative Schwarzian derivative. Here we consider a generalization of this condition. Specifically, we consider the functions which have some iterate with a negative Schwarzian derivative and show that many known results generalize to this larger class of functions. This includes both systems with regular as well as chaotic dynamic properties.

Real-world networks are dynamic in that both the state of the network components and the structure of the network (topology) change over time. Most studies regarding network evolution consider either one or the other of these types of network processes. Here we consider the interplay of the two, specifically, we consider how changes in network structure effect the dynamics of the network components. To model the growth of a network we use the specialization model known to produce many of the well-known features observed in real-world networks. We show that specialization results in a nontrivial equitable partition of the network where the elements of the partition form clusters that have synchronous dynamics. In particular, we show that these synchronizing clusters inherit their ability to either locally or globally synchronize from the subnetwork from which they are specialized. Thus, network specialization allows us to model how dynamics and structure can co-evolve in real-world systems.

Influence has been studied across many different domains including sociology, statistics, marketing, network theory, psychology, social media, politics, and web search. In each of these domains, being able to measure and rank various degrees of influence has useful applications. For example, measuring influence in web search allows internet users to discover useful content more quickly. However, many of these algorithms measure influence across networks and graphs that are mathematically static. This project explores influence measurement within the context of linear time invariant (LTI) systems. While dynamical networks do have mathematical models for quantifying influence on a node-to-node basis, to the best of our knowledge, there are no proposed mathematical formulations that measure aggregate level influence across an entire dynamical network. The dynamics associated with each link, which can differ from one link to another, add additional complexity to the problem. Because of this complexity, many of the static-graph approaches used in web search do not achieve the desired outcome for dynamical networks. In this work we build upon concepts from PageRank and systems theory introduce two new methods for measuring influence within dynamical networks: 1) Dynamical Responsive Page Rank (DRPR) and 2) Aggregated Targeted Reachability (ATR). We then compare and analyze and compare results with these new methods.

Ces dernières années, la puissance croissante des ordinateurs a permis à la fois de rassembler une quantité sans précédent de données décrivant la société moderne et d'envisager des outils numériques capables de s'attaquer à l'analyse et la modélisation les processus dynamiques qui se déroulent dans cette réalité complexe. Dans cette perspective, l'approche quantitative de la physique est un des catalyseurs de la croissance de nouveaux domaines interdisciplinaires visant à la compréhension des systèmes complexes techno-sociaux. Dans cette thèse, nous présentons dans cette thèse un cadre théorique et numérique pour simuler des épidémies de maladies infectieuses émergentes dans des contextes réalistes. Dans ce but, nous utilisons le rôle crucial de la mobilité des agents dans la diffusion des maladies infectieuses et nous nous appuyons sur l'étude des réseaux complexes pour gérer les ensembles de données à grande échelle décrivant les interconnexions de la population mondiale. En particulier, nous abordons deux différents problèmes de santé publique. Tout d'abord, nous considérons la propagation d’une épidémie au niveau mondial, et présentons un modèle de mobilité (GLEAM) conçu pour simuler la propagation d'une maladie de type grippal à l'échelle globale, en intégrant des données réelles de mobilité dans le monde entier. La dernière pandémie de grippe H1N1 2009 a démontré la nécessité de modèles mathématiques pour fournir des prévisions épidémiques et évaluer l'efficacité des politiques d'interventions. Dans cette perspective, nous présentons les résultats obtenus en temps réel pendant le déroulement de l'épidémie, ainsi qu'une analyse a posteriori portant sur les stratégies de lutte et sur la validation du modèle. Le deuxième problème que nous abordons est lié à la propagation de l'épidémie sur des systèmes en réseau dépendant du temps. En particulier, nous analysons des données décrivant les mouvements du bétail en Italie afin de caractériser les corrélations temporelles et les propriétés statistiques qui régissent ce système. Nous étudions ensuite la propagation d'une maladie infectieuse, en vue de caractériser la vulnérabilité du système et de concevoir des stratégies de contrôle. Ce travail est une approche interdisciplinaire qui combine les techniques de la physique statistique et de l'analyse des systèmes complexes dans le contexte de la mobilité des agents et de l'épidémiologie numérique. / In recent years, the increasing availability of computer power has enabled both to gather an unprecedented amount of data depicting the global interconnections of the modern society and to envision computational tools able to tackle the analysis and the modeling of dynamical processes unfolding on such a complex reality. In this perspective, the quantitative approach of Physics is catalyzing the growth of new interdisciplinary fields aimed at the understanding of complex techno-socio-ecological systems. By recognizing the crucial role of host mobility in the dissemination of infectious diseases and by leveraging on a network science approach to handle the large scale datasets describing the global interconnectivity, in this thesis we present a theoretical and computational framework to simulate epidemics of emerging infectious diseases in real settings. In particular we will tackle two different public health related issues. First, we present a Global Epidemic and Mobility model (GLEaM) that is designed to simulate the spreading of an influenza-like illness at the global scale integrating real world-wide mobility data. The 2009 H1N1 pandemic demonstrated the need of mathematical models to provide epidemic forecasts and to assess the effectiveness of different intervention policies. In this perspective we present the results achieved in real time during the unfolding of the epidemic and a posteriori analysis on travel related mitigation strategies and model validation. The second problem that we address is related to the epidemic spreading on evolving networked systems. In particular we analyze a detailed dataset of livestock movements in order to characterize the temporal correlations and the statistical properties governing the system. We then study an infectious disease spreading, in order to characterize the vulnerability of the system and to design novel control strategies. This work is an interdisciplinary approach that merges statistical physics techniques, complex and multiscale system analysis in the context of hosts mobility and computational epidemiology.

Linear time-invariant (LTI) dynamic networks are described by their dynamical structure function, and generally, they have many possible state space realizations. This work characterizes the necessary and sufficient conditions on a state transformation that preserves the dynamical structure function, thereby generating the entire set of realizations of a given order for a specific dynamic network.

Linear time-invariant (LTI) dynamic networks are described by their dynamical structure function, and generally, they have many possible state space realizations. This work characterizes the necessary and sufficient conditions on a state transformation that preserves the dynamical structure function, thereby generating the entire set of realizations of a given order for a specific dynamic network.

Linear time-invariant (LTI) dynamic networks are described by their dynamical structure function, and generally, they have many possible state space realizations. This work characterizes the necessary and sufficient conditions on a state transformation that preserves the dynamical structure function, thereby generating the entire set of realizations of a given order for a specific dynamic network.