ASU Scholarship Showcase

Two classes of scaling behaviours, namely the super-linear scaling of links or activities, and the sub-linear scaling of area, diversity, or time elapsed with respect to size have been found to prevail in the growth of complex networked systems. Despite some pioneering modelling approaches proposed for specific systems, whether there exists some general mechanisms that account for the origins of such scaling behaviours in different contexts, especially in socioeconomic systems, remains an open question. We address this problem by introducing a geometric network model without free parameter, finding that both super-linear and sub-linear scaling behaviours can be simultaneously reproduced and that the scaling exponents are exclusively determined by the dimension of the Euclidean space in which the network is embedded. We implement some realistic extensions to the basic model to offer more accurate predictions for cities of various scaling behaviours and the Zipf distribution reported in the literature and observed in our empirical studies. All of the empirical results can be precisely recovered by our model with analytical predictions of all major properties. By virtue of these general findings concerning scaling behaviour, our models with simple mechanisms gain new insights into the evolution and development of complex networked systems.

On-going efforts to understand the dynamics of coupled social-ecological (or more broadly, coupled infrastructure) systems and common pool resources have led to the generation of numerous datasets based on a large number of case studies. This data has facilitated the identification of important factors and fundamental principles which increase our understanding of such complex systems. However, the data at our disposal are often not easily comparable, have limited scope and scale, and are based on disparate underlying frameworks inhibiting synthesis, meta-analysis, and the validation of findings. Research efforts are further hampered when case inclusion criteria, variable definitions, coding schema, and inter-coder reliability testing are not made explicit in the presentation of research and shared among the research community. This paper first outlines challenges experienced by researchers engaged in a large-scale coding project; then highlights valuable lessons learned; and finally discusses opportunities for further research on comparative case study analysis focusing on social-ecological systems and common pool resources. Includes supplemental materials and appendices published in the International Journal of the Commons 2016 Special Issue. Volume 10 - Issue 2 - 2016.

Governing common pool resources (CPR) in the face of disturbances such as globalization and climate change is challenging. The outcome of any CPR governance regime is the influenced by local combinations of social, institutional, and biophysical factors, as well as cross-scale interdependencies. In this study, we take a step towards understanding multiple-causation of CPR outcomes by analyzing 1) the co-occurrence of Design Principles (DP) by activity (irrigation, fishery and forestry), and 2) the combination(s) of DPs leading to social and ecological success. We analyzed 69 cases pertaining to three different activities: irrigation, fishery, and forestry. We find that the importance of the design principles is dependent upon the natural and hard human made infrastructure (i.e. canals, equipment, vessels etc.). For example, clearly defined social boundaries are important when the natural infrastructure is highly mobile (i.e. tuna fish), while monitoring is more important when the natural infrastructure is more static (i.e. forests or water contained within an irrigation system). However, we also find that congruence between local conditions and rules and proportionality between investment and extraction are key for CPR success independent from the natural and human hard made infrastructure. We further provide new visualization techniques for co-occurrence patterns and add to qualitative comparative analysis by introducing a reliability metric to deal with a large meta-analysis dataset on secondary data where information is missing or uncertain.

Includes supplemental materials and appendices publications in International Journal of the Commons 2016 Special Issue. Volume 10 - Issue 2 - 2016

In spite of well-documented health benefits of vegetarian diets, less is known regarding the effects of these diets on athletic performance. In this cross-sectional study, we compared elite vegetarian and omnivore adult endurance athletes for maximal oxygen uptake (VO2 max) and strength. Twenty-seven vegetarian (VEG) and 43 omnivore (OMN) athletes were evaluated using VO2 max testing on the treadmill, and strength assessment using a dynamometer to determine peak torque for leg extensions. Dietary data were assessed using detailed seven-day food logs. Although total protein intake was lower among vegetarians in comparison to omnivores, protein intake as a function of body mass did not differ by group (1.2 ± 0.3 and 1.4 ± 0.5 g/kg body mass for VEG and OMN respectively, p = 0.220). VO2 max differed for females by diet group (53.0 ± 6.9 and 47.1 ± 8.6 mL/kg/min for VEG and OMN respectively, p < 0.05) but not for males (62.6 ± 15.4 and 55.7 ± 8.4 mL/kg/min respectively). Peak torque did not differ significantly between diet groups. Results from this study indicate that vegetarian endurance athletes’ cardiorespiratory fitness was greater than that for their omnivorous counterparts, but that peak torque did not differ between diet groups. These data suggest that vegetarian diets do not compromise performance outcomes and may facilitate aerobic capacity in athletes.

Faced with numerous seemingly intractable social and environmental challenges, many scholars and practitioners are increasingly interested in understanding how to actively engage and transform the existing systems holding such problems in place. Although a variety of analytical models have emerged in recent years, most emphasize either the social or ecological elements of such transformations rather than their coupled nature. To address this, first we have presented a definition of the core elements of a social-ecological system (SES) that could potentially be altered in a transformation. Second, we drew on insights about transformation from three branches of literature focused on radical change, i.e., social movements, socio-technical transitions, and social innovation, and gave consideration to the similarities and differences with the current studies by resilience scholars. Drawing on these findings, we have proposed a framework that outlines the process and phases of transformative change in an SES. Future research will be able to utilize the framework as a tool for analyzing the alteration of social-ecological feedbacks, identifying critical barriers and leverage points and assessing the outcome of social-ecological transformations.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical networks.

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.

Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with indirect interactions. Here we introduce a two-step strategy to resolve the reconstruction problem, where in the first step, we recover both direct and indirect interactions by employing the Lasso to solve a sparse signal reconstruction problem, and in the second step, we use matrix transformation and optimization to distinguish between direct and indirect interactions. The network structure corresponding to direct interactions can be fully uncovered. We exploit the public goods game occurring on complex networks as a paradigm for characterizing indirect interactions and test our reconstruction approach. We find that high reconstruction accuracy can be achieved for both homogeneous and heterogeneous networks, and a number of empirical networks in spite of insufficient data measurement contaminated by noise. Although a general framework for reconstructing complex networks with arbitrary types of indirect interactions is yet lacking, our approach opens new routes to separate direct and indirect interactions in a representative complex system.

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.