ASU Scholarship Showcase

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.

Background: An online version of the Microscale Audit of Pedestrian Streetscapes (Abbreviated) tool was adapted to virtually audit built environment features supportive of physical activity. The current study assessed inter-rater reliability of MAPS Online between in-person raters and online raters unfamiliar with the regions.

Methods: In-person and online audits were conducted for a total of 120 quarter-mile routes (60 per site) in Phoenix, AZ and San Diego, CA. Routes in each city included 40 residential origins stratified by walkability and SES, and 20 commercial centers. In-person audits were conducted by raters residing in their region. Online audits were conducted by raters in the alternate location using Google Maps (Aerial and Street View) images. The MAPS Abbreviated Online tool consisted of four sections: overall route, street segments, crossings and cul-de-sacs. Items within each section were grouped into subscales, and inter-rater reliability (ICCs) was assessed for subscales at multiple levels of aggregation.

Results: Online and in-person audits showed excellent agreement for overall positive microscale (ICC = 0.86, 95% CI [0.80, 0.90]) and grand scores (ICC = 0.93, 95% CI [0.89, 0.95]). Substantial to near-perfect agreement was found for 21 of 30 (70%) subscales, valence, and subsection scores, with ICCs ranging from 0.62, 95% CI [0.50, 0.72] to 0.95, 95% CI [0.93, 0.97]. Lowest agreement was found for the aesthetics and social characteristics scores, with ICCs ranging from 0.07, 95% CI [−0.12, 0.24] to 0.27, 95% CI [0.10, 0.43].

Conclusions: Results support use of the MAPS Abbreviated Online tool to reliably assess microscale neighborhood features that support physical activity and may be used by raters residing in different geographic regions and unfamiliar with the audit areas.

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.

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.

Background: To more accurately quantify the potential impact of the neighbourhood environment on adults’ physical activity (PA), it is important to compare environment-PA associations between periods of the day or week when adults are more versus less likely to be in their neighbourhood and utilise its PA resources. We examined whether, among adults from 10 countries, associations between objectively-assessed neighbourhood environment attributes and moderate-to-vigorous physical activity (MVPA) varied by time of the day and day of the week. The secondary aim was to examine whether such associations varied by employment status, gender and city.

Methods: This cross-sectional study included 6,712 adults from 14 cities across 10 countries with ≥1 day of valid accelerometer-assessed MVPA and complete information on socio-demographic and objectively-assessed environmental characteristics within 0.5 and 1 km street-network buffers around the home. Accelerometer measures (MVPA min/h) were created for six time periods from early morning until late evening/night, for weekdays and weekend days separately. Associations were estimated using generalized additive mixed models.

Results: Time of the day, day of week, gender and employment status were significant moderators of environment-MVPA associations. Land use mix was positively associated with MVPA in women who were employed and in men irrespective of their employment status. The positive associations between MVPA and net residential density, intersection density and land use mix were stronger in the mornings of weekdays and the afternoon/evening periods of both weekdays and weekend days. Associations between number of parks and MVPA were stronger in the mornings and afternoon/evenings irrespective of day of the week. Public transport density showed consistent positive associations with MVPA during weekends, while stronger effects on weekdays were observed in the morning and early evenings.

Conclusions: This study suggests that space and time constraints in adults’ daily activities are important factors that determine the impact of neighbourhood attributes on PA. Consideration of time-specific associations is important to better characterise the magnitude of the effects of the neighbourhood environment on PA. Future research will need to examine the contribution of built environment characteristics of areas surrounding other types of daily life centres (e.g., workplaces) to explaining adults’ PA at specific times of the day.

Background: Emerging interventions that rely on and harness variability in behavior to adapt to individual performance over time may outperform interventions that prescribe static goals (e.g., 10,000 steps/day). The purpose of this factorial trial was to compare adaptive vs. static goal setting and immediate vs. delayed, non-contingent financial rewards for increasing free-living physical activity (PA).

Methods: A 4-month 2 × 2 factorial randomized controlled trial tested main effects for goal setting (adaptive vs. static goals) and rewards (immediate vs. delayed) and interactions between factors to increase steps/day as measured by a Fitbit Zip. Moderate-to-vigorous PA (MVPA) minutes/day was examined as a secondary outcome.

Results: Participants (N = 96) were mainly female (77%), aged 41 ± 9.5 years, and all were insufficiently active and overweight/obese (mean BMI = 34.1 ± 6.2). Participants across all groups increased by 2389 steps/day on average from baseline to intervention phase (p < .001). Participants receiving static goals showed a stronger increase in steps per day from baseline phase to intervention phase (2630 steps/day) than those receiving adaptive goals (2149 steps/day; difference = 482 steps/day, p = .095). Participants receiving immediate rewards showed stronger improvement (2762 step/day increase) from baseline to intervention phase than those receiving delayed rewards (2016 steps/day increase; difference = 746 steps/day, p = .009). However, the adaptive goals group showed a slower decrease in steps/day from the beginning of the intervention phase to the end of the intervention phase (i.e. less than half the rate) compared to the static goals group (−7.7 steps vs. -18.3 steps each day; difference = 10.7 steps/day, p < .001) resulting in better improvements for the adaptive goals group by study end. Rate of change over the intervention phase did not differ between reward groups. Significant goal phase x goal setting x reward interactions were observed.

Conclusions: Adaptive goals outperformed static goals (i.e., 10,000 steps) over a 4-month period. Small immediate rewards outperformed larger, delayed rewards. Adaptive goals with either immediate or delayed rewards should be preferred for promoting PA.

The early indications of vitamin C deficiency are unremarkable (fatigue, malaise, depression) and may manifest as a reduced desire to be physically active; moreover, hypovitaminosis C may be associated with increased cold duration and severity. This study examined the impact of vitamin C on physical activity and respiratory tract infections during the peak of the cold season. Healthy non-smoking adult men (18–35 years; BMI <34 kg/m²; plasma vitamin C<45 µmol/L) received either 1000 mg of vitamin C daily (n = 15) or placebo (n = 13) in a randomized, double-blind, eight-week trial. All participants completed the Wisconsin Upper Respiratory Symptom Survey-21 daily and the Godin Leisure-Time Exercise Questionnaire weekly. In the final two weeks of the trial, the physical activity score rose modestly for the vitamin C group vs. placebo after adjusting for baseline values: +39.6% (95% CI [−4.5,83.7]; p = 0.10). The number of participants reporting cold episodes was 7 and 11 for the vitamin C and placebo groups respectively during the eight-week trial (RR = 0.55; 95% CI [0.33,0.94]; p = 0.04) and cold duration was reduced 59% in the vitamin C versus placebo groups (−3.2 days; 95% CI [−7.0,0.6]; p = 0.06). These data suggest measurable health advantages associated with vitamin C supplementation in a population with adequate-to-low vitamin C status.

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.