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.`

Extreme events, a type of collective behavior in complex networked dynamical systems, often can have catastrophic consequences. To develop effective strategies to control extreme events is of fundamental importance and practical interest. Utilizing transportation dynamics on complex networks as a prototypical setting, we find that making the network “mobile” can effectively suppress extreme events. A striking, resonance-like phenomenon is uncovered, where an optimal degree of mobility exists for which the probability of extreme events is minimized. We derive an analytic theory to understand the mechanism of control at a detailed and quantitative level, and validate the theory numerically. Implications of our finding to current areas such as cybersecurity are discussed.

We develop a completely data-driven approach to reconstructing coupled neuronal networks that contain a small subset of chaotic neurons. Such chaotic elements can be the result of parameter shift in their individual dynamical systems and may lead to abnormal functions of the network. To accurately identify the chaotic neurons may thus be necessary and important, for example, applying appropriate controls to bring the network to a normal state. However, due to couplings among the nodes, the measured time series, even from non-chaotic neurons, would appear random, rendering inapplicable traditional nonlinear time-series analysis, such as the delay-coordinate embedding method, which yields information about the global dynamics of the entire network. Our method is based on compressive sensing. In particular, we demonstrate that identifying chaotic elements can be formulated as a general problem of reconstructing the nodal dynamical systems, network connections and all coupling functions, as well as their weights. The working and efficiency of the method are illustrated by using networks of non-identical FitzHugh–Nagumo neurons with randomly-distributed coupling weights.

The relation between flux and fluctuation is fundamental to complex physical systems that support and transport flows. A recently obtained law predicts monotonous enhancement of fluctuation as the average flux is increased, which in principle is valid but only for large systems. For realistic complex systems of small sizes, this law breaks down when both the average flux and fluctuation become large. Here we demonstrate the failure of this law in small systems using real data and model complex networked systems, derive analytically a modified flux-fluctuation law, and validate it through computations of a large number of complex networked systems. Our law is more general in that its predictions agree with numerics and it reduces naturally to the previous law in the limit of large system size, leading to new insights into the flow dynamics in small-size complex systems with significant implications for the statistical and scaling behaviors of small systems, a topic of great recent interest.

We develop a general framework to analyze the controllability of multiplex networks using multiple-relation networks and multiple-layer networks with interlayer couplings as two classes of prototypical systems. In the former, networks associated with different physical variables share the same set of nodes and in the latter, diffusion processes take place. We find that, for a multiple-relation network, a layer exists that dominantly determines the controllability of the whole network and, for a multiple-layer network, a small fraction of the interconnections can enhance the controllability remarkably. Our theory is generally applicable to other types of multiplex networks as well, leading to significant insights into the control of complex network systems with diverse structures and interacting patterns.

Evolutionary dynamical models for cyclic competitions of three species (e.g., rock, paper, and scissors, or RPS) provide a paradigm, at the microscopic level of individual interactions, to address many issues in coexistence and biodiversity. Real ecosystems often involve competitions among more than three species. By extending the RPS game model to five (rock-paper-scissors-lizard-Spock, or RPSLS) mobile species, we uncover a fundamental type of mesoscopic interactions among subgroups of species. In particular, competitions at the microscopic level lead to the emergence of various local groups in different regions of the space, each involving three species. It is the interactions among the groups that fundamentally determine how many species can coexist. In fact, as the mobility is increased from zero, two transitions can occur: one from a five- to a three-species coexistence state and another from the latter to a uniform, single-species state. We develop a mean-field theory to show that, in order to understand the first transition, group interactions at the mesoscopic scale must be taken into account. Our findings suggest, more broadly, the importance of mesoscopic interactions in coexistence of great many species.

An outstanding and fundamental problem in contemporary physics is to include and probe the many-body effect in the study of relativistic quantum manifestations of classical chaos. We address this problem using graphene systems described by the Hubbard Hamiltonian in the setting of resonant tunneling. Such a system consists of two symmetric potential wells separated by a potential barrier, and the geometric shape of the whole domain can be chosen to generate integrable or chaotic dynamics in the classical limit. Employing a standard mean-field approach to calculating a large number of eigenenergies and eigenstates, we uncover a class of localized states with near-zero tunneling in the integrable systems. These states are not the edge states typically seen in graphene systems, and as such they are the consequence of many-body interactions. The physical origin of the non-edge-state type of localized states can be understood by the one-dimensional relativistic quantum tunneling dynamics through the solutions of the Dirac equation with appropriate boundary conditions. We demonstrate that, when the geometry of the system is modified to one with chaos, the localized states are effectively removed, implying that in realistic situations where many-body interactions are present, classical chaos is capable of facilitating greatly quantum tunneling. This result, besides its fundamental importance, can be useful for the development of nanoscale devices such as graphene-based resonant-tunneling diodes.

Dynamical systems based on the minority game (MG) have been a paradigm for gaining significant insights into a variety of social and biological behaviors. Recently, a grouping phenomenon has been unveiled in MG systems of multiple resources (strategies) in which the strategies spontaneously break into an even number of groups, each exhibiting an identical oscillation pattern in the attendance of game players. Here we report our finding of spontaneous breakup of resources into three groups, each exhibiting period-three oscillations. An analysis is developed to understand the emergence of the striking phenomenon of triple grouping and period-three oscillations. In the presence of random disturbances, the triple-group/period-three state becomes transient, and we obtain explicit formula for the average transient lifetime using two methods of approximation. Our finding indicates that, period-three oscillation, regarded as one of the most fundamental behaviors in smooth nonlinear dynamical systems, can also occur in much more complex, evolutionary-game dynamical systems. Our result also provides a plausible insight for the occurrence of triple grouping observed, for example, in the U.S. housing market.

The interplay between individual behaviors and epidemic dynamics in complex networks is a topic of recent interest. In particular, individuals can obtain different types of information about the disease and respond by altering their behaviors, and this can affect the spreading dynamics, possibly in a significant way. We propose a model where individuals' behavioral response is based on a generic type of local information, i.e., the number of neighbors that has been infected with the disease. Mathematically, the response can be characterized by a reduction in the transmission rate by a factor that depends on the number of infected neighbors. Utilizing the standard susceptible-infected-susceptible and susceptible-infected-recovery dynamical models for epidemic spreading, we derive a theoretical formula for the epidemic threshold and provide numerical verification. Our analysis lays on a solid quantitative footing the intuition that individual behavioral response can in general suppress epidemic spreading. Furthermore, we find that the hub nodes play the role of “double-edged sword” in that they can either suppress or promote outbreak, depending on their responses to the epidemic, providing additional support for the idea that these nodes are key to controlling epidemic spreading in complex networks.

Adaptation requires genetic variation, but founder populations are generally genetically depleted. Here we sequence two populations of an inbred ant that diverge in phenotype to determine how variability is generated. Cardiocondyla obscurior has the smallest of the sequenced ant genomes and its structure suggests a fundamental role of transposable elements (TEs) in adaptive evolution. Accumulations of TEs (TE islands) comprising 7.18% of the genome evolve faster than other regions with regard to single-nucleotide variants, gene/exon duplications and deletions and gene homology. A non-random distribution of gene families, larvae/adult specific gene expression and signs of differential methylation in TE islands indicate intragenomic differences in regulation, evolutionary rates and coalescent effective population size. Our study reveals a tripartite interplay between TEs, life history and adaptation in an invasive species.