What you have, not who you know: food-enhanced social capital and changes in social behavioural relationships in a non-human primate.

Social network position in non-human primates has far-reaching fitness consequences. Critically, social networks are both heterogeneous and dynamic, meaning an individual's current network position is likely to change due to both intrinsic and extrinsic factors. However, our understanding of the drivers of changes in social network position is largely confined to opportunistic studies. Experimental research on the consequences of in situ, controlled network perturbations is limited. Here we conducted a food-based experiment in rhesus macaques to assess whether allowing an individual the ability to provide high-quality food to her group changed her social behavioural relationships. We considered both her social network position across five behavioural networks, as well as her dominance and kin interactions. We found that gaining control over a preferential food resource had far-reaching social consequences. There was an increase in both submission and aggression centrality and changes in the socio-demographic characteristics of her agonistic interaction partners. Further, we found that her grooming balance shifted in her favour as she received more grooming than she gave. Together, these results provide a novel, preliminary insight into how in situ, experimental manipulations can modify social network position and point to broader network-level shifts in both social capital and social power.

Multi-scale phase separation by explosive percolation with single-chromatin loop resolution.

The 2 m-long human DNA is tightly intertwined into the cell nucleus of the size of 10 µm. The DNA packing is explained by folding of chromatin fiber. This folding leads to the formation of such hierarchical structures as: chromosomal territories, compartments; densely-packed genomic regions known as Topologically Associating Domains (TADs), or Chromatin Contact Domains (CCDs), and loops. We propose models of dynamical human genome folding into hierarchical components in human lymphoblastoid, stem cell, and fibroblast cell lines. Our models are based on explosive percolation theory. The chromosomes are modeled as graphs where CTCF chromatin loops are represented as edges. The folding trajectory is simulated by gradually introducing loops to the graph following various edge addition strategies that are based on topological network properties, chromatin loop frequencies, compartmentalization, or epigenomic features. Finally, we propose the genome folding model - a biophysical pseudo-time process guided by a single scalar order parameter. The parameter is calculated by Linear Discriminant Analysis of chromatin features. We also include dynamics of loop formation by using Loop Extrusion Model (LEM) while adding them to the system. The chromatin phase separation, where fiber folds in 3D space into topological domains and compartments, is observed when the critical number of contacts is reached. We also observe that at least 80% of the loops are needed for chromatin fiber to condense in 3D space, and this is constant through various cell lines. Overall, our in-silico model integrates the high-throughput 3D genome interaction experimental data with the novel theoretical concept of phase separation, which allows us to model event-based time dynamics of chromatin loop formation and folding trajectories.

Sandpile cascades on oscillator networks: The BTW model meets Kuramoto.

Cascading failures abound in complex systems and the Bak-Tang-Weisenfeld (BTW) sandpile model provides a theoretical underpinning for their analysis. Yet, it does not account for the possibility of nodes having oscillatory dynamics, such as in power grids and brain networks. Here, we consider a network of Kuramoto oscillators upon which the BTW model is unfolding, enabling us to study how the feedback between the oscillatory and cascading dynamics can lead to new emergent behaviors. We assume that the more out-of-sync a node is with its neighbors, the more vulnerable it is and lower its load-carrying capacity accordingly. Also, when a node topples and sheds load, its oscillatory phase is reset at random. This leads to novel cyclic behavior at an emergent, long timescale. The system spends the bulk of its time in a synchronized state where load builds up with minimal cascades. Yet, eventually, the system reaches a tipping point where a large cascade triggers a "cascade of larger cascades," which can be classified as a dragon king event. The system then undergoes a short transient back to the synchronous, buildup phase. The coupling between capacity and synchronization gives rise to endogenous cascade seeds in addition to the standard exogenous ones, and we show their respective roles. We establish the phenomena from numerical studies and develop the accompanying mean-field theory to locate the tipping point, calculate the load in the system, determine the frequency of the long-time oscillations, and find the distribution of cascade sizes during the buildup phase.

Mutualistic networks emerging from adaptive niche-based interactions.

Mutualistic networks are vital ecological and social systems shaped by adaptation and evolution. They involve bipartite cooperation via the exchange of goods or services between actors of different types. Empirical observations of mutualistic networks across genres and geographic conditions reveal correlated nested and modular patterns. Yet, the underlying mechanism for the network assembly remains unclear. We propose a niche-based adaptive mechanism where both nestedness and modularity emerge simultaneously as complementary facets of an optimal niche structure. Key dynamical properties are revealed at different timescales. Foremost, mutualism can either enhance or reduce the network stability, depending on competition intensity. Moreover, structural adaptations are asymmetric, exhibiting strong hysteresis in response to environmental change. Finally, at the evolutionary timescale we show that the adaptive mechanism plays a crucial role in preserving the distinctive patterns of mutualism under species invasions and extinctions.

Homophily Based on Few Attributes Can Impede Structural Balance.

Homophily between agents and structural balance in connected triads of agents are complementary mechanisms thought to shape social groups leading to, for instance, consensus or polarization. To capture both processes in a unified manner, we propose a model of pair and triadic interactions. We consider N fully connected agents, where each agent has G underlying attributes, and the similarity between agents in attribute space (i.e., homophily) is used to determine the link weight between them. For structural balance we use a triad-updating rule where only one attribute of one agent is changed intentionally in each update, but this also leads to accidental changes in link weights and even link polarities. The link weight dynamics in the limit of large G is described by a Fokker-Planck equation from which the conditions for a phase transition to a fully balanced state with all links positive can be obtained. This "paradise state" of global cooperation is, however, difficult to achieve requiring G>O(N^{2}) and p>0.5, where the parameter p captures a willingness for consensus. Allowing edge weights to be a consequence of attributes naturally captures homophily and reveals that many real-world social systems would have a subcritical number of attributes necessary to achieve structural balance.

Why understanding multiplex social network structuring processes will help us better understand the evolution of human behavior.

Social scientists have long appreciated that relationships between individuals cannot be described from observing a single domain, and that the structure across domains of interaction can have important effects on outcomes of interest (e.g., cooperation; Durkheim, 1893). One debate explicitly about this surrounds food sharing. Some argue that failing to find reciprocal food sharing means that some process other than reciprocity must be occurring, whereas others argue for models that allow reciprocity to span domains in the form of trade (Kaplan and Hill, 1985.). Multilayer networks, high-dimensional networks that allow us to consider multiple sets of relationships at the same time, are ubiquitous and have consequences, so processes giving rise to them are important social phenomena. The analysis of multi-dimensional social networks has recently garnered the attention of the network science community (Kivelä et al., 2014). Recent models of these processes show how ignoring layer interdependencies can lead one to miss why a layer formed the way it did, and/or draw erroneous conclusions (Górski et al., 2018). Understanding the structuring processes that underlie multiplex networks will help understand increasingly rich data sets, giving more accurate and complete pictures of social interactions.

A multiplex centrality metric for complex social networks: sex, social status, and family structure predict multiplex centrality in rhesus macaques.

Members of a society interact using a variety of social behaviors, giving rise to a multi-faceted and complex social life. For the study of animal behavior, quantifying this complexity is critical for understanding the impact of social life on animals' health and fitness. Multilayer network approaches, where each interaction type represents a different layer of the social network, have the potential to better capture this complexity than single layer approaches. Calculating individuals' centrality within a multilayer social network can reveal keystone individuals and more fully characterize social roles. However, existing measures of multilayer centrality do not account for differences in the dynamics and functionality across interaction layers. Here we validate a new method for quantifying multiplex centrality called consensus ranking by applying this method to multiple social groups of a well-studied nonhuman primate, the rhesus macaque. Consensus ranking can suitably handle the complexities of animal social life, such as networks with different properties (sparse vs. dense) and biological meanings (competitive vs. affiliative interactions). We examined whether individuals' attributes or socio-demographic factors (sex, age, dominance rank and certainty, matriline size, rearing history) were associated with multiplex centrality. Social networks were constructed for five interaction layers (i.e., aggression, status signaling, conflict policing, grooming and huddling) for seven social groups. Consensus ranks were calculated across these five layers and analyzed with respect to individual attributes and socio-demographic factors. Generalized linear mixed models showed that consensus ranking detected known social patterns in rhesus macaques, showing that multiplex centrality was greater in high-ranking males with high certainty of rank and females from the largest families. In addition, consensus ranks also showed that females from very small families and mother-reared (compared to nursery-reared) individuals were more central, showing that consideration of multiple social domains revealed individuals whose social centrality and importance might otherwise have been missed.

Interdependent Network Recovery Games.

Recovery of interdependent infrastructure networks in the presence of catastrophic failure is crucial to the economy and welfare of society. Recently, centralized methods have been developed to address optimal resource allocation in postdisaster recovery scenarios of interdependent infrastructure systems that minimize total cost. In real-world systems, however, multiple independent, possibly noncooperative, utility network controllers are responsible for making recovery decisions, resulting in suboptimal decentralized processes. With the goal of minimizing recovery cost, a best-case decentralized model allows controllers to develop a full recovery plan and negotiate until all parties are satisfied (an equilibrium is reached). Such a model is computationally intensive for planning and negotiating, and time is a crucial resource in postdisaster recovery scenarios. Furthermore, in this work, we prove this best-case decentralized negotiation process could continue indefinitely under certain conditions. Accounting for network controllers' urgency in repairing their system, we propose an ad hoc sequential game-theoretic model of interdependent infrastructure network recovery represented as a discrete time noncooperative game between network controllers that is guaranteed to converge to an equilibrium. We further reduce the computation time needed to find a solution by applying a best-response heuristic and prove bounds on ε-Nash equilibrium, where ε depends on problem inputs. We compare best-case and ad hoc models on an empirical interdependent infrastructure network in the presence of simulated earthquakes to demonstrate the extent of the tradeoff between optimality and computational efficiency. Our method provides a foundation for modeling sociotechnical systems in a way that mirrors restoration processes in practice.

Koopman operator and its approximations for systems with symmetries.

Nonlinear dynamical systems with symmetries exhibit a rich variety of behaviors, often described by complex attractor-basin portraits and enhanced and suppressed bifurcations. Symmetry arguments provide a way to study these collective behaviors and to simplify their analysis. The Koopman operator is an infinite dimensional linear operator that fully captures a system's nonlinear dynamics through the linear evolution of functions of the state space. Importantly, in contrast with local linearization, it preserves a system's global nonlinear features. We demonstrate how the presence of symmetries affects the Koopman operator structure and its spectral properties. In fact, we show that symmetry considerations can also simplify finding the Koopman operator approximations using the extended and kernel dynamic mode decomposition methods (EDMD and kernel DMD). Specifically, representation theory allows us to demonstrate that an isotypic component basis induces a block diagonal structure in operator approximations, revealing hidden organization. Practically, if the symmetries are known, the EDMD and kernel DMD methods can be modified to give more efficient computation of the Koopman operator approximation and its eigenvalues, eigenfunctions, and eigenmodes. Rounding out the development, we discuss the effect of measurement noise.

Competitive percolation strategies for network recovery.

Restoring operation of critical infrastructure systems after catastrophic events is an important issue, inspiring work in multiple fields, including network science, civil engineering, and operations research. We consider the problem of finding the optimal order of repairing elements in power grids and similar infrastructure. Most existing methods either only consider system network structure, potentially ignoring important features, or incorporate component level details leading to complex optimization problems with limited scalability. We aim to narrow the gap between the two approaches. Analyzing realistic recovery strategies, we identify over- and undersupply penalties of commodities as primary contributions to reconstruction cost, and we demonstrate traditional network science methods, which maximize the largest connected component, are cost inefficient. We propose a novel competitive percolation recovery model accounting for node demand and supply, and network structure. Our model well approximates realistic recovery strategies, suppressing growth of the largest connected component through a process analogous to explosive percolation. Using synthetic power grids, we investigate the effect of network characteristics on recovery process efficiency. We learn that high structural redundancy enables reduced total cost and faster recovery, however, requires more information at each recovery step. We also confirm that decentralized supply in networks generally benefits recovery efforts.

Cascading failures in scale-free interdependent networks.

Large cascades are a common occurrence in many natural and engineered complex systems. In this paper we explore the propagation of cascades across networks using realistic network topologies, such as heterogeneous degree distributions, as well as intra- and interlayer degree correlations. We find that three properties, scale-free degree distribution, internal network assortativity, and cross-network hub-to-hub connections, are all necessary components to significantly reduce the size of large cascades in the Bak-Tang-Wiesenfeld sandpile model. We demonstrate that correlations present in the structure of the multilayer network influence the dynamical cascading process and can prevent failures from spreading across connected layers. These findings highlight the importance of internal and cross-network topology in optimizing robustness of interconnected systems.

Exotic states in a simple network of nanoelectromechanical oscillators.

Synchronization of oscillators, a phenomenon found in a wide variety of natural and engineered systems, is typically understood through a reduction to a first-order phase model with simplified dynamics. Here, by exploiting the precision and flexibility of nanoelectromechanical systems, we examined the dynamics of a ring of quasi-sinusoidal oscillators at and beyond first order. Beyond first order, we found exotic states of synchronization with highly complex dynamics, including weak chimeras, decoupled states, traveling waves, and inhomogeneous synchronized states. Through theory and experiment, we show that these exotic states rely on complex interactions emerging out of networks with simple linear nearest-neighbor coupling. This work provides insight into the dynamical richness of complex systems with weak nonlinearities and local interactions.

Master stability functions for complete, intralayer, and interlayer synchronization in multiplex networks of coupled Rössler oscillators.

Synchronization phenomena are of broad interest across disciplines and increasingly of interest in a multiplex network setting. For the multiplex network of coupled Rössler oscillators, here we show how the master stability function, a celebrated framework for analyzing synchronization on a single network, can be extended to certain classes of multiplex networks with different intralayer and interlayer coupling functions. We derive three master stability equations that determine, respectively, the necessary regions of complete synchronization, intralayer synchronization, and interlayer synchronization. We calculate these three regions explicitly for the case of a two-layer network of Rössler oscillators and show that the overlap of the regions determines the type of synchronization achieved. In particular, if the interlayer or intralayer coupling function is such that the interlayer or intralayer synchronization region is empty, complete synchronization cannot be achieved regardless of the coupling strength. Furthermore, for any network structure, the occurrence of intralayer and interlayer synchronization depends mainly on the coupling functions of nodes within a layer and across layers, respectively. Our mathematical analysis requires that the intralayer and interlayer supra-Laplacians commute. But, we show this is only a sufficient, and not necessary, condition and that the results can be applied more generally.

Self-organization of dragon king failures.

The mechanisms underlying cascading failures are often modeled via the paradigm of self-organized criticality. Here we introduce a simple network model where nodes self-organize to be either weakly or strongly protected against failure in a manner that captures the trade-off between degradation and reinforcement of nodes inherent in many network systems. If strong nodes cannot fail, any failure is contained to a single, isolated cluster of weak nodes and the model produces power-law distributions of failure sizes. We classify the large, rare events that involve the failure of only a single cluster as "black swans." In contrast, if strong nodes fail once a sufficient fraction of their neighbors fail, then failure can cascade across multiple clusters of weak nodes. If over 99.9% of the nodes fail due to this cluster hopping mechanism, we classify this as a "dragon king," which are massive failures caused by mechanisms distinct from smaller failures. The dragon kings observed are self-organized, existing over a wide range of reinforcement rates and system sizes. We find that once an initial cluster of failing weak nodes is above a critical size, the dragon king mechanism kicks in, leading to piggybacking system-wide failures. We demonstrate that the size of the initial failed weak cluster predicts the likelihood of a dragon king event with high accuracy and we develop a simple control strategy that can dramatically reduce dragon kings and other large failures.

Talent and experience shape competitive social hierarchies.

The hierarchy of social organization is a ubiquitous property of animal and human groups, linked to resource allocation, collective decisions, individual health, and even to social instability. Experimental evidence shows that both the intrinsic abilities of individuals and social reinforcement processes impact hierarchies; existing mathematical models, however, focus on the latter. Here, we develop a rigorous model that incorporates both features and explore their synergistic effect on stability and the structure of hierarchy. For pairwise interactions, we show that there is a trade-off between relationship stability and having the most talented individuals in the highest ranks. Extending this to open societies, where individuals enter and leave the population, we show that important societal effects arise from the interaction between talent and social processes: (i) Despite a positive global correlation between talent and rank, paradoxically, local correlation is negative, and (ii) the removal of an individual can induce a series of rank reversals. We show that the mechanism underlying the latter is the removal of an older individual of limited talent, who nonetheless was able to suppress the rise of younger, more talented individuals.

Maximizing synchronizability of duplex networks.

We study the synchronizability of duplex networks formed by two randomly generated network layers with different patterns of interlayer node connections. According to the master stability function, we use the smallest nonzero eigenvalue and the eigenratio between the largest and the second smallest eigenvalues of supra-Laplacian matrices to characterize synchronizability on various duplexes. We find that the interlayer linking weight and linking fraction have a profound impact on synchronizability of duplex networks. The increasingly large inter-layer coupling weight is found to cause either decreasing or constant synchronizability for different classes of network dynamics. In addition, negative node degree correlation across interlayer links outperforms positive degree correlation when most interlayer links are present. The reverse is true when a few interlayer links are present. The numerical results and understanding based on these representative duplex networks are illustrative and instructive for building insights into maximizing synchronizability of more realistic multiplex networks.

Complex Dynamical Networks Constructed with Fully Controllable Nonlinear Nanomechanical Oscillators.

Control of the global parameters of complex networks has been explored experimentally in a variety of contexts. Yet, the more difficult prospect of realizing arbitrary network architectures, especially analog physical networks that provide dynamical control of individual nodes and edges, has remained elusive. Given the vast hierarchy of time scales involved, it also proves challenging to measure a complex network's full internal dynamics. These span from the fastest nodal dynamics to very slow epochs over which emergent global phenomena, including network synchronization and the manifestation of exotic steady states, eventually emerge. Here, we demonstrate an experimental system that satisfies these requirements. It is based upon modular, fully controllable, nonlinear radio frequency nanomechanical oscillators, designed to form the nodes of complex dynamical networks with edges of arbitrary topology. The dynamics of these oscillators and their surrounding network are analog and continuous-valued and can be fully interrogated in real time. They comprise a piezoelectric nanomechanical membrane resonator, which serves as the frequency-determining element within an electrical feedback circuit. This embodiment permits network interconnections entirely within the electrical domain and provides unprecedented node and edge control over a vast region of parameter space. Continuous measurement of the instantaneous amplitudes and phases of every constituent oscillator node are enabled, yielding full and detailed network data without reliance upon statistical quantities. We demonstrate the operation of this platform through the real-time capture of the dynamics of a three-node ring network as it evolves from the uncoupled state to full synchronization.

Explosive percolation on directed networks due to monotonic flow of activity.

An important class of real-world networks has directed edges, and in addition, some rank ordering on the nodes, for instance the popularity of users in online social networks. Yet, nearly all research related to explosive percolation has been restricted to undirected networks. Furthermore, information on such rank-ordered networks typically flows from higher-ranked to lower-ranked individuals, such as follower relations, replies, and retweets on Twitter. Here we introduce a simple percolation process on an ordered, directed network where edges are added monotonically with respect to the rank ordering. We show with a numerical approach that the emergence of a dominant strongly connected component appears to be discontinuous. Large-scale connectivity occurs at very high density compared with most percolation processes, and this holds not just for the strongly connected component structure but for the weakly connected component structure as well. We present analysis with branching processes, which explains this unusual behavior and gives basic intuition for the underlying mechanisms. We also show that before the emergence of a dominant strongly connected component, multiple giant strongly connected components may exist simultaneously. By adding a competitive percolation rule with a small bias to link uses of similar rank, we show this leads to formation of two distinct components, one of high-ranked users, and one of low-ranked users, with little flow between the two components.