ASU Scholarship Showcase

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.

Over the past couple of decades, quality has been an area of increased focus. Multiple models and approaches have been proposed to measure the quality in the construction industry. This paper focuses on determining the quality of one of the types of roofing systems used in the construction industry, i.e., sprayed polyurethane foam roofs (SPF roofs). Thirty-seven urethane-coated SPF roofs that were installed in 2005/2006 were visually inspected to measure the percentage of blisters and repairs three times over a period of four years, six years, and seven years. A repairing criteria was established after a six-year mark based on the data that were reported to contractors as vulnerable roofs. Furthermore, the relation between four possible contributing time-of-installation factors—contractor, demographics, season, and difficulty (number of penetrations and size of the roof in square feet) that could affect the quality of the roof was determined. Demographics and difficulty did not affect the quality of the roofs, whereas the contractor and the season when the roof was installed did affect the quality of the roofs.

Dynamical processes occurring on the edges in complex networks are relevant to a variety of real-world situations. Despite recent advances, a framework for edge controllability is still required for complex networks of arbitrary structure and interaction strength. Generalizing a previously introduced class of processes for edge dynamics, the switchboard dynamics, and exploit- ing the exact controllability theory, we develop a universal framework in which the controllability of any node is exclusively determined by its local weighted structure. This framework enables us to identify a unique set of critical nodes for control, to derive analytic formulas and articulate efficient algorithms to determine the exact upper and lower controllability bounds, and to evaluate strongly structural controllability of any given network. Applying our framework to a large number of model and real-world networks, we find that the interaction strength plays a more significant role in edge controllability than the network structure does, due to a vast range between the bounds determined mainly by the interaction strength. Moreover, transcriptional regulatory networks and electronic circuits are much more strongly structurally controllable (SSC) than other types of real-world networks, directed networks are more SSC than undirected networks, and sparse networks are typically more SSC than dense networks.

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.

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.

Locating sources of diffusion and spreading from minimum data is a significant problem in network science with great applied values to the society. However, a general theoretical framework dealing with optimal source localization is lacking. Combining the controllability theory for complex networks and compressive sensing, we develop a framework with high efficiency and robustness for optimal source localization in arbitrary weighted networks with arbitrary distribution of sources. We offer a minimum output analysis to quantify the source locatability through a minimal number of messenger nodes that produce sufficient measurement for fully locating the sources. When the minimum messenger nodes are discerned, the problem of optimal source localization becomes one of sparse signal reconstruction, which can be solved using compressive sensing. Application of our framework to model and empirical networks demonstrates that sources in homogeneous and denser networks are more readily to be located. A surprising finding is that, for a connected undirected network with random link weights and weak noise, a single messenger node is sufficient for locating any number of sources. The framework deepens our understanding of the network source localization problem and offers efficient tools with broad applications.

For the past three decades, the Saudi construction industry (SCI) has exhibited poor performance. Many research efforts have tried to identify the problem and the potential causes but there have been few publications identifying ways to mitigate the problem and describing testing to validate the proposed solution. This paper examines the research and development (R&D) approach in the SCI. A literature research was performed identifying the impact that R&D has had on the SCI. A questionnaire was also created for surveying industry professionals and researchers. The results show evidence that the SCI practice and the academic research work exist in separate silos. This study recommends a change of mindset in both the public and private sector on their views on R&D since cooperation is required to create collaboration between the two sectors and improve the competitiveness of the country's economy.

The principles of a new project management model have been tested for the past 20 years. This project management model utilizes expertise instead of the traditional management, direction, and control (MDC). This new project management model is a leadership-based model instead of a management model. The practice of the new model requires a change in paradigm and project management structure. Some of the practices of this new paradigm include minimizing the flow of information and communications to and from the project manager [including meetings, emails and documents], eliminating technical communications, reducing client management, direction, and control of the vendor, and the hiring of vendors or personnel to do specific tasks. A vendors is hired only after they have clearly shown that they know what they are doing by showing past performance on similar projects, that they clearly understand how to create transparency to minimize risk that they do not control, and that they can clearly outline their project plan using a detailed milestone schedule including time, cost, and tasks all communicated in the language of metrics.

Research has shown that construction projects in Saudi Arabia have exhibited poor performance for the past three decades. The traditional risk management practices have been ineffective at helping contractors deliver projects on time and within budget while meeting quality expectations. Studies have identified that client decision making is one of the main causes of risks that occur on projects in Saudi Arabia. This paper proposes a new risk management model that can minimize client decision making, and enable the client to utilize expertise, thereby improving project quality and performance. The model is derived from the Information Measurement Theory (IMT) and Performance Information Procurement System (PIPS), both developed at Arizona State University in the United States (U.S.). The model has been tested over 1800 times in both construction and non-construction projects, showing a decrease in required management by owner by up to 80% and an increase in efficiency up to 40%.

Evolutionary games model a common type of interactions in a variety of complex, networked, natural systems and social systems. Given such a system, uncovering the interacting structure of the underlying network is key to understanding its collective dynamics. Based on compressive sensing, we develop an efficient approach to reconstructing complex networks under game-based interactions from small amounts of data. The method is validated by using a variety of model networks and by conducting an actual experiment to reconstruct a social network. While most existing methods in this area assume oscillator networks that generate continuous-time data, our work successfully demonstrates that the extremely challenging problem of reverse engineering of complex networks can also be addressed even when the underlying dynamical processes are governed by realistic, evolutionary-game type of interactions in discrete time.