ASU Scholarship Showcase

Cities in the Global South face rapid urbanization challenges and often suffer an acute lack of infrastructure and governance capacities. Smart Cities Mission, in India, launched in 2015, aims to offer a novel approach for urban renewal of 100 cities following an area‐based development approach, where the use of ICT and digital technologies is particularly emphasized. This article presents a critical review of the design and implementation framework of this new urban renewal program across selected case‐study cities. The article examines the claims of the so‐called “smart cities” against actual urban transformation on‐ground and evaluates how “inclusive” and “sustainable” these developments are. We quantify the scale and coverage of the smart city urban renewal projects in the cities to highlight who the program includes and excludes. The article also presents a statistical analysis of the sectoral focus and budgetary allocations of the projects under the Smart Cities Mission to find an inherent bias in these smart city initiatives in terms of which types of development they promote and the ones it ignores. The findings indicate that a predominant emphasis on digital urban renewal of selected precincts and enclaves, branded as “smart cities,” leads to deepening social polarization and gentrification. The article offers crucial urban planning lessons for designing ICT‐driven urban renewal projects, while addressing critical questions around inclusion and sustainability in smart city ventures.`

Cancer therapy selects for cancer cells resistant to treatment, a process that is fundamentally evolutionary. To what extent, however, is the evolutionary perspective employed in research on therapeutic resistance and relapse? We analyzed 6,228 papers on therapeutic resistance and/or relapse in cancers and found that the use of evolution terms in abstracts has remained at about 1% since the 1980s. However, detailed coding of 22 recent papers revealed a higher proportion of papers using evolutionary methods or evolutionary theory, although this number is still less than 10%. Despite the fact that relapse and therapeutic resistance is essentially an evolutionary process, it appears that this framework has not permeated research. This represents an unrealized opportunity for advances in research on therapeutic resistance.

Background: Medical and public health scientists are using evolution to devise new strategies to solve major health problems. But based on a 2003 survey, medical curricula may not adequately prepare physicians to evaluate and extend these advances. This study assessed the change in coverage of evolution in North American medical schools since 2003 and identified opportunities for enriching medical education.

Methods: In 2013, curriculum deans for all North American medical schools were invited to rate curricular coverage and perceived importance of 12 core principles, the extent of anticipated controversy from adding evolution, and the usefulness of 13 teaching resources. Differences between schools were assessed by Pearson’s chi-square test, Student’s t-test, and Spearman’s correlation. Open-ended questions sought insight into perceived barriers and benefits.

Results: Despite repeated follow-up, 60 schools (39%) responded to the survey. There was no evidence of sample bias. The three evolutionary principles rated most important were antibiotic resistance, environmental mismatch, and somatic selection in cancer. While importance and coverage of principles were correlated (r = 0.76, P < 0.01), coverage (at least moderate) lagged behind importance (at least moderate) by an average of 21% (SD = 6%). Compared to 2003, a range of evolutionary principles were covered by 4 to 74% more schools. Nearly half (48%) of responders anticipated igniting controversy at their medical school if they added evolution to their curriculum. The teaching resources ranked most useful were model test questions and answers, case studies, and model curricula for existing courses/rotations. Limited resources (faculty expertise) were cited as the major barrier to adding more evolution, but benefits included a deeper understanding and improved patient care.

Conclusion: North American medical schools have increased the evolution content in their curricula over the past decade. However, coverage is not commensurate with importance. At a few medical schools, anticipated controversy impedes teaching more evolution. Efforts to improve evolution education in medical schools should be directed toward boosting faculty expertise and crafting resources that can be easily integrated into existing curricula.

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.

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating control.

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct complex networks on which stochastic spreading dynamics take place. We apply the methodology to a large number of model and real networks, finding that a full reconstruction of inhomogeneous interactions can be achieved from small amounts of polarized (binary) data, a virtue of compressed sensing. Further, we demonstrate that a hidden source that triggers the spreading process but is externally inaccessible can be ascertained and located with high confidence in the absence of direct routes of propagation from it. Our approach thus establishes a paradigm for tracing and controlling epidemic invasion and information diffusion in complex networked systems.