ASU Scholarship Showcase

In Ritual and Religion in the Making of Humanity, Roy Rappaport misses an opportunity to more tightly theorize the synergistic relationship between concepts of the divine, the psyches of ritual participants, and the adaptive dynamics of religious sociality. This paper proposes such a theory by drawing on implicit features of Rappaport’s account, fulfilling his goal of a “cybernetics of the holy.” I argue that concepts of the divine, when made authoritative for participants through ritual, have three important effects: they invite intense and meaningful reconstructions of personal identity according to paradigmatic examples; they act as a form of encoded social memory by organizing human relationship according to a “spiritual map”; and they provide the cognitive framework that make religious community organization robust, adaptive, and reproductive. We can characterize divine concepts as “specified absences” that ground each of these effects and link them together in a mutually-reinforcing set.

The conscientious are morally conflicted when their moral dilemmas or incommensurabilities, real or apparent, have not been resolved. But such doublemindedness need not lead to ethical disintegration or moral insensitivity. For one may develop the moral virtue of doublemindedness, the settled power to deliberate and act well while morally conflicted. Such action will be accompanied by both moral loss (perhaps 'dirty hands') and ethical gain (salubrious agental stability). In explaining the virtue's moral psychology I show, among other things, its consistency with wholeheartedness and the unity of the virtues. To broaden its claim to recognition, I show the virtue's consistency with diverse models of practical reason. In conclusion, Michael Walzer's interpretation of Hamlet's attitude toward Gertrude exemplifies this virtue in a fragmentary but nonetheless praiseworthy form.

Rice is an essential crop in Ghana. Several aspects of rice have been studied to increase its production; however, the environmental aspects, including impact on climate change, have not been studied well. There is therefore a gap in knowledge, and hence the need for continuous research. By accessing academic portals, such as Springer Open, InTech Open, Elsevier, and the Kwame Nkrumah University of Science and Technology’s offline campus library, 61 academic publications including peer reviewed journals, books, working papers, reports, etc. were critically reviewed. It was found that there is a lack of data on how paddy rice production systems affect greenhouse gas (GHG) emissions, particularly emissions estimation, geographical location, and crops. Regarding GHG emission estimation, the review identified the use of emission factors calibrated using temperate conditions which do not suit tropical conditions. On location, most research on rice GHG emissions have been carried out in Asia with little input from Africa. In regard to crops, there is paucity of in-situ emissions data from paddy fields in Ghana. Drawing on the review, a conceptual framework is developed using Ghana as reference point to guide the discussion on fertilizer application, water management rice cultivars, and soil for future development of adaptation strategies for rice emission reduction.

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.