Basketball Teams as Strategic Networks

We asked how team dynamics can be captured in relation to function by considering games in the first round of the NBA 2010 play-offs as networks. Defining players as nodes and ball movements as links, we analyzed the network properties of degree centrality, clustering, entropy and flow centrality across teams and positions, to characterize the game from a network perspective and to determine whether we can assess differences in team offensive strategy by their network properties. The compiled network structure across teams reflected a fundamental attribute of basketball strategy. They primarily showed a centralized ball distribution pattern with the point guard in a leadership role. However, individual play-off teams showed variation in their relative involvement of other players/positions in ball distribution, reflected quantitatively by differences in clustering and degree centrality. We also characterized two potential alternate offensive strategies by associated variation in network structure: (1) whether teams consistently moved the ball towards their shooting specialists, measured as “uphill/downhill” flux, and (2) whether they distributed the ball in a way that reduced predictability, measured as team entropy. These network metrics quantified different aspects of team strategy, with no single metric wholly predictive of success. However, in the context of the 2010 play-offs, the values of clustering (connectedness across players) and network entropy (unpredictability of ball movement) had the most consistent association with team advancement. Our analyses demonstrate the utility of network approaches in quantifying team strategy and show that testable hypotheses can be evaluated using this approach. These analyses also highlight the richness of basketball networks as a dataset for exploring the relationships between network structure and dynamics with team organization and effectiveness.     

Oscillatory synchronization in large-scale cortical networks predicts perception

Normal brain function requires the dynamic interaction of functionally specialized but widely distributed cortical regions. Long-range synchronization of oscillatory signals has been suggested to mediate these interactions within large-scale cortical networks, but direct evidence is sparse. Here we show that oscillatory synchronization is organized in such large-scale networks. We implemented an analysis approach that allows for imaging synchronized cortical networks and applied this technique to EEG recordings in humans. We identified two networks: beta-band synchronization (~20 Hz) in a fronto-parieto-occipital network and gamma-band synchronization (~80 Hz) in a centro-temporal network. Strong perceptual correlates support their functional relevance: the strength of synchronization within these networks predicted the subjects' perception of an ambiguous audiovisual stimulus as well as the integration of auditory and visual information. Our results provide evidence that oscillatory neuronal synchronization mediates neuronal communication within frequency-specific, large-scale cortical networks.     

What's in a crowd? Analysis of face-to-face behavioral networks

The availability of new data sources on human mobility is opening new avenues for investigating the interplay of social networks, human mobility and dynamical processes such as epidemic spreading. Here we analyze data on the time-resolved face-to-face proximity of individuals in large-scale real-world scenarios. We compare two settings with very different properties, a scientific conference and a long-running museum exhibition. We track the behavioral networks of face-to-face proximity, and characterize them from both a static and a dynamic point of view, exposing differences and similarities. We use our data to investigate the dynamics of a susceptible-infected model for epidemic spreading that unfolds on the dynamical networks of human proximity. The spreading patterns are markedly different for the conference and the museum case, and they are strongly impacted by the causal structure of the network data. A deeper study of the spreading paths shows that the mere knowledge of static aggregated networks would lead to erroneous conclusions about the transmission paths on the dynamical networks.     

Dynamic Social Community Detection and Its Applications

Community structure is one of the most commonly observed features of Online Social Networks (OSNs) in reality. The knowledge of this feature is of great advantage: it not only provides helpful insights into developing more efficient social-aware solutions but also promises a wide range of applications enabled by social and mobile networking, such as routing strategies in Mobile Ad Hoc Networks (MANETs) and worm containment in OSNs. Unfortunately, understanding this structure is very challenging, especially in dynamic social networks where social interactions are evolving rapidly. Our work focuses on the following questions: How can we efficiently identify communities in dynamic social networks? How can we adaptively update the network community structure based on its history instead of recomputing from scratch? To this end, we present Quick Community Adaptation (QCA), an adaptive modularity-based framework for not only discovering but also tracing the evolution of network communities in dynamic OSNs. QCA is very fast and efficient in the sense that it adaptively updates and discovers the new community structure based on its history together with the network changes only. This flexible approach makes QCA an ideal framework applicable for analyzing large-scale dynamic social networks due to its lightweight computing-resource requirement. To illustrate the effectiveness of our framework, we extensively test QCA on both synthesized and real-world social networks including Enron, arXiv e-print citation, and Facebook networks. Finally, we demonstrate the applicability of QCA in real applications: (1) A social-aware message forwarding strategy in MANETs, and (2) worm propagation containment in OSNs. Competitive results in comparison with other methods reveal that social-based techniques employing QCA as a community detection core outperform current available methods.     

Visual Search Strategies of Soccer Players Executing a Power vs. Placement Penalty Kick

Introduction

When taking a soccer penalty kick, there are two distinct kicking techniques that can be adopted; a ‘power’ penalty or a ‘placement’ penalty. The current study investigated how the type of penalty kick being taken affected the kicker’s visual search strategy and where the ball hit the goal (end ball location).

Method

Wearing a portable eye tracker, 12 university footballers executed 2 power and placement penalty kicks, indoors, both with and without the presence of a goalkeeper. Video cameras were used to determine initial ball velocity and end ball location.

Results

When taking the power penalty, the football was kicked significantly harder and more centrally in the goal compared to the placement penalty. During the power penalty, players fixated on the football for longer and more often at the goalkeeper (and by implication the middle of the goal), whereas in the placement penalty, fixated longer at the goal, specifically the edges. Findings remained consistent irrespective of goalkeeper presence.

Discussion/conclusion

Findings indicate differences in visual search strategy and end ball location as a function of type of penalty kick. When taking the placement penalty, players fixated and kicked the football to the edges of the goal in an attempt to direct the ball to an area that the goalkeeper would have difficulty reaching and saving. Fixating significantly longer on the football when taking the power compared to placement penalty indicates a greater importance of obtaining visual information from the football. This can be attributed to ensuring accurate foot-to-ball contact and subsequent generation of ball velocity. Aligning gaze and kicking the football centrally in the goal when executing the power compared to placement penalty may have been a strategy to reduce the risk of kicking wide of the goal altogether.     

Large-scale brain networks in board game experts: insights from a domain-related task and task-free resting state

Cognitive performance relies on the coordination of large-scale networks of brain regions that are not only temporally correlated during different tasks, but also networks that show highly correlated spontaneous activity during a task-free state. Both task-related and task-free network activity has been associated with individual differences in cognitive performance. Therefore, we aimed to examine the influence of cognitive expertise on four networks associated with cognitive task performance: the default mode network (DMN) and three other cognitive networks (central-executive network, dorsal attention network, and salience network). During fMRI scanning, fifteen grandmaster and master level Chinese chess players (GM/M) and fifteen novice players carried out a Chinese chess task and a task-free resting state. Modulations of network activity during task were assessed, as well as resting-state functional connectivity of those networks. Relative to novices, GM/Ms showed a broader task-induced deactivation of DMN in the chess problem-solving task, and intrinsic functional connectivity of DMN was increased with a connectivity pattern associated with the caudate nucleus in GM/Ms. The three other cognitive networks did not exhibit any difference in task-evoked activation or intrinsic functional connectivity between the two groups. These findings demonstrate the effect of long-term learning and practice in cognitive expertise on large-scale brain networks, suggesting the important role of DMN deactivation in expert performance and enhanced functional integration of spontaneous activity within widely distributed DMN-caudate circuitry, which might better support high-level cognitive control of behavior.     

MORE: Mixed Optimization for Reverse Engineering-An Application to Modeling Biological Networks Response via Sparse Systems of Nonlinear Differential Equations

Reverse engineering is the problem of inferring the structure of a network of interactions between biological variables from a set of observations. In this paper, we propose an optimization algorithm, called MORE, for the reverse engineering of biological networks from time series data. The model inferred by MORE is a sparse system of nonlinear differential equations, complex enough to realistically describe the dynamics of a biological system. MORE tackles separately the discrete component of the problem, the determination of the biological network topology, and the continuous component of the problem, the strength of the interactions. This approach allows us both to enforce system sparsity, by globally constraining the number of edges, and to integrate a priori information about the structure of the underlying interaction network. Experimental results on simulated and real-world networks show that the mixed discrete/continuous optimization approach of MORE significantly outperforms standard continuous optimization and that MORE is competitive with the state of the art in terms of accuracy of the inferred networks.     

Comparison of the backward overhead medicine ball throw to power production in college football players

The purpose of this study was to determine the relationship of the backward overhead medicine ball (BOMB) throw to power production in college football players. Forty National Collegiate Athletic Association Division II college football players were studied at the end of an 8-week off-season conditioning program for power output determined from a countermovement vertical jump on a force plate and for maximal distance in the standing BOMB throw. Although the reliability of the BOMB test was high (interclass correlation coefficient = 0.86), there was a significant learning effect across 3 trials (p < 0.01). Peak and average powers generated during the vertical jump correlated moderately but significantly with the best BOMB throw distance (r = 0.59 and 0.63, respectively). Considering power relative to body mass or lean body mass failed to produce significant correlations with BOMB throw distance (r = 0.27 and 0.28, respectively). Therefore, the BOMB throw may have limited potential as a predictor of total body explosive power in college football players.     

Dynamic properties of network motifs contribute to biological network organization

Biological networks, such as those describing gene regulation, signal transduction, and neural synapses, are representations of large-scale dynamic systems. Discovery of organizing principles of biological networks can be enhanced by embracing the notion that there is a deep interplay between network structure and system dynamics. Recently, many structural characteristics of these non-random networks have been identified, but dynamical implications of the features have not been explored comprehensively. We demonstrate by exhaustive computational analysis that a dynamical property—stability or robustness to small perturbations—is highly correlated with the relative abundance of small subnetworks (network motifs) in several previously determined biological networks. We propose that robust dynamical stability is an influential property that can determine the non-random structure of biological networks.     

An interaction switch predicts the nested architecture of mutualistic networks

Nested architecture is distinctive in plant-animal mutualistic networks. However, to date an integrative and quantitative explanation has been lacking. It is evident that species often switch their interactive partners in real-world mutualistic networks such as pollination and seed-dispersal networks. By incorporating an interaction switch into a novel multi-population model, we show that the nested architecture rapidly emerges from an initially random network. The model allowing interaction switches between partner species produced predictions which fit remarkably well with observations from 81 empirical networks. Thus, the nested architecture in mutualistic networks could be an intrinsic physical structure of dynamic networks and the interaction switch is likely a key ecological process that results in nestedness of real-world networks. Identifying the biological processes responsible for network structures is thus crucial for understanding the architecture of ecological networks.     

PANET: A GPU-Based Tool for Fast Parallel Analysis of Robustness Dynamics and Feed-Forward/Feedback Loop Structures in Large-Scale Biological Networks

It has been a challenge in systems biology to unravel relationships between structural properties and dynamic behaviors of biological networks. A Cytoscape plugin named NetDS was recently proposed to analyze the robustness-related dynamics and feed-forward/feedback loop structures of biological networks. Despite such a useful function, limitations on the network size that can be analyzed exist due to high computational costs. In addition, the plugin cannot verify an intrinsic property which can be induced by an observed result because it has no function to simulate the observation on a large number of random networks. To overcome these limitations, we have developed a novel software tool, PANET. First, the time-consuming parts of NetDS were redesigned to be processed in parallel using the OpenCL library. This approach utilizes the full computing power of multi-core central processing units and graphics processing units. Eventually, this made it possible to investigate a large-scale network such as a human signaling network with 1,609 nodes and 5,063 links. We also developed a new function to perform a batch-mode simulation where it generates a lot of random networks and conducts robustness calculations and feed-forward/feedback loop examinations of them. This helps us to determine if the findings in real biological networks are valid in arbitrary random networks or not. We tested our plugin in two case studies based on two large-scale signaling networks and found interesting results regarding relationships between coherently coupled feed-forward/feedback loops and robustness. In addition, we verified whether or not those findings are consistently conserved in random networks through batch-mode simulations. Taken together, our plugin is expected to effectively investigate various relationships between dynamics and structural properties in large-scale networks. Our software tool, user manual and example datasets are freely available at http://panet-csc.sourceforge.net/.     

Abnormal Behavior in Cascading Dynamics with Node Weight

Considering a preferential selection mechanism of load destination, we introduce a new method to quantify initial load distribution and subsequently construct a simple cascading model. By attacking the node with the highest load, we investigate the cascading dynamics in some synthetic networks. Surprisingly, we observe that for several networks of different structural patterns, a counterintuitive phenomenon emerges if the highest load attack is applied to the system, i.e., investing more resources to protect every node in a network inversely makes the whole network more vulnerable. We explain this ability paradox by analyzing the micro-structural components of the underlying network and therefore reveals how specific structural patterns may influence the cascading dynamics. We discover that the robustness of the network oscillates as the capacity of each node increases. The conclusion of the paper may shed lights on future investigations to avoid the demonstrated ability paradox and subsequent cascading failures in real-world networks.     

Players’ physical performance in LaLiga across the season: insights for competition continuation after COVID-19

Due to the COVID-19 outbreak, professional football players competing in LaLiga were confined at home for ~8 weeks and then they were allowed to train to prepare the first competitive match for 4 weeks. As the duration of summer break in the prior four seasons of LaLiga (from 2015-2016 to 2018-2019) was of similar length to the suspension of the championship due to COVID-19 (~12 weeks), we have analysed the running performance of teams competing in LaLiga in these four seasons to anticipate players’ physical performance after the resumption of the competition. The analysis includes the average running distance per game for each of the 38 matchdays that compose LaLiga. One-way ANOVA revealed that there was a main effect of the matchday on total running distance per match (p = 0.001), and in the distance covered between 14.0 and 20.9 km/h (p < 0.001), between 21.0 and 23.9 km/h (p < 0.001) and at above 24.0 km/h (p < 0.001). Overall, the post-hoc analysis revealed that the running patterns progressively increased during the first 8-10 matchdays and then reached a plateau which was significantly different to matchday-1 (p < 0.05). This analysis reveals that, in the prior four competitive seasons of LaLiga, players’ physical performance was lower at the beginning of the season and the teams needed approximately 8-10 matchdays to reach a steady state running performance. These data suggest that football players will progressively increase their performance across the 11 matchdays remaining to complete LaLiga.     

Towards online multiresolution community detection in large-scale networks

The investigation of community structure in networks has aroused great interest in multiple disciplines. One of the challenges is to find local communities from a starting vertex in a network without global information about the entire network. Many existing methods tend to be accurate depending on a priori assumptions of network properties and predefined parameters. In this paper, we introduce a new quality function of local community and present a fast local expansion algorithm for uncovering communities in large-scale networks. The proposed algorithm can detect multiresolution community from a source vertex or communities covering the whole network. Experimental results show that the proposed algorithm is efficient and well-behaved in both real-world and synthetic networks.     

Epidemic threshold and network structure: The interplay of probability of transmission and of persistence in small-size directed networks

A growing number of studies are investigating the effect of contact structure on the dynamics of epidemics in large-scale complex networks. Whether findings thus obtained apply also to networks of small size, and thus to many real-world biological applications, is still an open question. We use numerical simulations of disease spread in directed networks of 100 individual nodes with a constant number of links. We show that, no matter the type of network structure (local, small-world, random and scale-free), there is a linear threshold determined by the probability of infection transmission between connected nodes and the probability of infection persistence in an infected node. The threshold is significantly lower for scale-free networks compared to local, random and small-world ones only if super-connected nodes have a higher number of links both to and from other nodes. The starting point, the node at which the epidemic starts, does not affect the threshold conditions, but has a marked influence on the final size of the epidemic in all kinds of network. There is evidence that contact structure has an influence on the average final size of an epidemic across all starting nodes, with significantly lower values in scale-free networks at equilibrium. Simulations in scale-free networks show a distinctive time-series pattern, which, if found in a real epidemic, can be used to infer the underlying network structure. The findings have relevance also for meta-population ecology and species conservation.     

Emergence of Functional Specificity in Balanced Networks with Synaptic Plasticity

In rodent visual cortex, synaptic connections between orientation-selective neurons are unspecific at the time of eye opening, and become to some degree functionally specific only later during development. An explanation for this two-stage process was proposed in terms of Hebbian plasticity based on visual experience that would eventually enhance connections between neurons with similar response features. For this to work, however, two conditions must be satisfied: First, orientation selective neuronal responses must exist before specific recurrent synaptic connections can be established. Second, Hebbian learning must be compatible with the recurrent network dynamics contributing to orientation selectivity, and the resulting specific connectivity must remain stable for unspecific background activity. Previous studies have mainly focused on very simple models, where the receptive fields of neurons were essentially determined by feedforward mechanisms, and where the recurrent network was small, lacking the complex recurrent dynamics of large-scale networks of excitatory and inhibitory neurons. Here we studied the emergence of functionally specific connectivity in large-scale recurrent networks with synaptic plasticity. Our results show that balanced random networks, which already exhibit highly selective responses at eye opening, can develop feature-specific connectivity if appropriate rules of synaptic plasticity are invoked within and between excitatory and inhibitory populations. If these conditions are met, the initial orientation selectivity guides the process of Hebbian learning and, as a result, functionally specific and a surplus of bidirectional connections emerge. Our results thus demonstrate the cooperation of synaptic plasticity and recurrent dynamics in large-scale functional networks with realistic receptive fields, highlight the role of inhibition as a critical element in this process, and paves the road for further computational studies of sensory processing in neocortical network models equipped with synaptic plasticity.     

Exploring the Morphospace of Communication Efficiency in Complex Networks

Graph theoretical analysis has played a key role in characterizing global features of the topology of complex networks, describing diverse systems such as protein interactions, food webs, social relations and brain connectivity. How system elements communicate with each other depends not only on the structure of the network, but also on the nature of the system''s dynamics which are constrained by the amount of knowledge and resources available for communication processes. Complementing widely used measures that capture efficiency under the assumption that communication preferentially follows shortest paths across the network (“routing”), we define analytic measures directed at characterizing network communication when signals flow in a random walk process (“diffusion”). The two dimensions of routing and diffusion efficiency define a morphospace for complex networks, with different network topologies characterized by different combinations of efficiency measures and thus occupying different regions of this space. We explore the relation of network topologies and efficiency measures by examining canonical network models, by evolving networks using a multi-objective optimization strategy, and by investigating real-world network data sets. Within the efficiency morphospace, specific aspects of network topology that differentially favor efficient communication for routing and diffusion processes are identified. Charting regions of the morphospace that are occupied by canonical, evolved or real networks allows inferences about the limits of communication efficiency imposed by connectivity and dynamics, as well as the underlying selection pressures that have shaped network topology.     

Detecting the Influence of Spreading in Social Networks with Excitable Sensor Networks

Detecting spreading outbreaks in social networks with sensors is of great significance in applications. Inspired by the formation mechanism of humans’ physical sensations to external stimuli, we propose a new method to detect the influence of spreading by constructing excitable sensor networks. Exploiting the amplifying effect of excitable sensor networks, our method can better detect small-scale spreading processes. At the same time, it can also distinguish large-scale diffusion instances due to the self-inhibition effect of excitable elements. Through simulations of diverse spreading dynamics on typical real-world social networks (Facebook, coauthor, and email social networks), we find that the excitable sensor networks are capable of detecting and ranking spreading processes in a much wider range of influence than other commonly used sensor placement methods, such as random, targeted, acquaintance and distance strategies. In addition, we validate the efficacy of our method with diffusion data from a real-world online social system, Twitter. We find that our method can detect more spreading topics in practice. Our approach provides a new direction in spreading detection and should be useful for designing effective detection methods.     

Analysis of Biomechanical Characteristics of Football Players at Different Levels Kicking with the Inner Edge of Instep

This study aims to analyze the difference in biomechanical properties of football players at different levels when kicking the football with the inner edge of the instep. Before the experiment, ten football players were selected; five were higher than the national level (group A), and the other five players were lower than the national level II (group B). During the experiment, the motion process was captured by a high-speed camera for biomechanical analysis. It was found that in group A, the thigh and leg swung in less time and larger amplitude, the acceleration of backswing and forward swing of the leg was larger, and the angular velocity of forward swing was also larger. At the moment of touching the ball, in the sagittal plane, the ankle joint angle and angular velocity of group A were larger than those of group B (P < 0.05). In conclusion, the high-level athletes can complete the high-quality kicking through a larger swing amplitude and speed of the kicking leg. In the training process, the athletes should pay attention to the speed and strength of the kicking leg to improve the kicking level.