Social network measures for "nosduocentered" networks, their predictive power on performance

Our purpose in this article is to define a network structure which is based on two egos instead of the egocentered (one ego) or the complete network (n egos). We describe the characteristics and properties for this kind of network which we call “nosduocentered network”, comparing it with complete and egocentered networks. The key point for this kind of network is that relations exist between the two main egos and all alters, but relations among others are not observed. After that, we use new social network measures adapted to the nosduocentered network, some of which are based on measures for complete networks such as degree, betweenness, closeness centrality or density, while some others are tailormade for nosduocentered networks. We specify three regression models to predict research performance of PhD students based on these social network measures for different networks such as advice, collaboration, emotional support and trust. Data used are from Slovenian PhD students and their s

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 4: Social Network Analysis

What are fundamental entities in social networks and what information is contained in social graphs? We will discuss some selected concepts in social network analysis, such as one- and two mode networks, prestige and centrality, and cliques, clans and clubs. Readings: Web tool predicts election results and stock prices, J. Palmer, New Scientist, 07 February (2008) [Protected Access] Optional: Social Network Analysis, Methods and Applications, S. Wasserman and K. Faust (1994)

A matrix iteration for dynamic network summaries

We propose a new algorithm for summarizing properties of large-scale time-evolving networks. This type of data, recording connections that come and go over time, is being generated in many modern applications, including telecommunications and on-line human social behavior. The algorithm computes a dynamic measure of how well pairs of nodes can communicate by taking account of routes through the network that respect the arrow of time. We take the conventional approach of downweighting for length (messages become corrupted as they are passed along) and add the novel feature of downweighting for age (messages go out of date). This allows us to generalize widely used Katz-style centrality measures that have proved popular in network science to the case of dynamic networks sampled at non-uniform points in time. We illustrate the new approach on synthetic and real data.

Centrality and spectral radius in dynamic communication networks

We explore the influence of the choice of attenuation factor on Katz centrality indices for evolving communication networks. For given snapshots of a network observed over a period of time, recently developed communicability indices aim to identify best broadcasters and listeners in the network. In this article, we looked into the sensitivity of communicability indices on the attenuation factor constraint, in relation to spectral radius (the largest eigenvalue) of the network at any point in time and its computation in the case of large networks. We proposed relaxed communicability measures where the spectral radius bound on attenuation factor is relaxed and the adjacency matrix is normalised in order to maintain the convergence of the measure. Using a vitality based measure of both standard and relaxed communicability indices we looked at the ways of establishing the most important individuals for broadcasting and receiving of messages related to community bridging roles. We illustrated our findings with two examples of real-life networks, MIT reality mining data set of daily communications between 106 individuals during one year and UK Twitter mentions network, direct messages on Twitter between 12.4k individuals during one week.

On the radius of centrality in evolving communication networks

In this article, we investigate how the choice of the attenuation factor in an extended version of Katz centrality influences the centrality of the nodes in evolving communication networks. For given snapshots of a network, observed over a period of time, recently developed communicability indices aim to identify the best broadcasters and listeners (receivers) in the network. Here we explore the attenuation factor constraint, in relation to the spectral radius (the largest eigenvalue) of the network at any point in time and its computation in the case of large networks. We compare three different communicability measures: standard, exponential, and relaxed (where the spectral radius bound on the attenuation factor is relaxed and the adjacency matrix is normalised, in order to maintain the convergence of the measure). Furthermore, using a vitality-based measure of both standard and relaxed communicability indices, we look at the ways of establishing the most important individuals for broadcasting and receiving of messages related to community bridging roles. We compare those measures with the scores produced by an iterative version of the PageRank algorithm and illustrate our findings with two examples of real-life evolving networks: the MIT reality mining data set, consisting of daily communications between 106 individuals over the period of one year, a UK Twitter mentions network, constructed from the direct \emph{tweets} between 12.4k individuals during one week, and a subset the Enron email data set.

Interventions in social networks: impact on mood and network dynamics

Results from two studies on longitudinal friendship networks are presented, exploring the impact of a gratitude intervention on positive and negative affect dynamics in a social network. The gratitude intervention had been previously shown to increase positive affect and decrease negative affect in an individual but dynamic group effects have not been considered. In the first study the intervention was administered to the whole network. In the second study two social networks are considered and in each only a subset of individuals, initially low/high in negative affect respectively received the intervention as `agents of change'. Data was analyzed using stochastic actor based modelling techniques to identify resulting network changes, impact on positive and negative affect and potential contagion of mood within the group. The first study found a group level increase in positive and a decrease in negative affect. Homophily was detected with regard to positive and negative affect but no evidence of contagion was found. The network itself became more volatile along with a fall in rate of change of negative affect. Centrality measures indicated that the best broadcasters were the individuals with the least negative affect levels at the beginning of the study. In the second study, the positive and negative affect levels for the whole group depended on the initial levels of negative affect of the intervention recipients. There was evidence of positive affect contagion in the group where intervention recipients had low initial level of negative affect and contagion in negative affect for the group where recipients had initially high level of negative affect.

What makes a species central in a cleaning mutualism network?

Mutualisms often form networks of interacting species, characterized by the existence of a central core of species that potentially drive the ecology and the evolution of the whole community. Centrality measures allow quantification of how central or peripheral a species is within a network, thus informing about the role of each species in network organization, dynamics, and stability. In the present study we addressed the question whether the structural position of species in the network (i.e. their topological importance) relates to their ecological traits. We studied interactions between cleaner and client reef fishes to identify central and peripheral species within a mutualistic network, and investigated five ecological correlates. We used three measures to estimate the level of centrality of a species for distinct structural patterns, such as the number of interactions and the structural proximity to other species. Through the use of a principal component analysis (PCA) we observed that the centrality measures were highly correlated (92.5%) in the studied network, which indicates that the same species plays a similar role for the different structural patterns. Three cleaner and ten client species had positive values of centrality, which suggests that these species are modulating ecological and evolutionary dynamics within the network. Higher centralities were related to higher abundances and feeding habits for client fishes, but not for cleaners. The high correlation between centrality measures in the present study is likely related to the nested structure of the cleaning network. The cleaner species` set, by having central species that are not necessarily the most abundant ones, bears potentially more vulnerable points for network cohesiveness. Additionally, the present study generalizes previous findings for plant-animal mutualisms, as it shows that the structure of marine mutualisms is also related to a complex interplay between abundance and niche-related features.

The roles of social bonds in the Australian tourism network

There is limited published research on the social bonds between employees in two organizations. This paper aims to examine 1) relationships in the Australian tourism industry, 2) the nature and role of social bonds and commercial friendships, 3) the nature and roles of the investments in economic and social resources, and 4) the nature of personal relationships in the tourism network. The perspective and attitudes of the tourism network participants become clear and their vested interests are highlighted. Network pictures are developed for the 5 key sectors of this industry. The adaptations of these sectors are also discussed. The nature and role of social bonds and commercial friendships is examined. The Leximancer program is used to qualitatively analyze interview transcripts. Findings show the centrality of relationships in this industry and the importance of social bonds to the travel agency sector. This study provides additional insight into the nature of social bonds in the development of successful business to business relationships. A discussion of antecedents and outcomes of social bonds will be further developed.

An improved physarum centrality measure for weighted networks

Identification of the most central node within a network is one of the primary problems in network analysis. Among various centrality measures for weighted networks, most are based on the assumption that information only spreads through the shortest paths. Then, a mathematical model of an amoeboid organism has been used by Physarum centrality to relax the assumption. However, its computational complexity is relatively high by finding competing paths between all pairs of nodes in networks. In this paper, with the idea of a ground node, an improved Physarum centrality is proposed by maintaining the feature of original measure with the performance is greatly enhanced. Examples and applications are given to show the efficiency and effectiveness of our proposed measure in weighted networks.

Using social network analysis to identify key child care center staff for obesity prevention interventions: a pilot study

Introduction. Interest has grown in how systems thinking could be used in obesity prevention. Relationships between key actors, represented by social networks, are an important focus for considering intervention in systems. Method. Two long day care centers were selected in which previous obesity prevention programs had been implemented. Measures showed ways in which physical activity and dietary policy are conversations and actions transacted through social networks (interrelationships) within centers, via an eight item closed-ended social network questionnaire. Questionnaire data were collected from (17/20; response rate 85%) long day care center staff. Social network density and centrality statistics were calculated, using UCINET social network software, to examine the role of networks in obesity prevention. Results. “Degree” (influence) and “betweeness” (gatekeeper) centrality measures of staff inter-relationships about physical activity, dietary, and policy information identified key players in each center. Network density was similar and high on some relationship networks in both centers but markedly different in others, suggesting that the network tool identified unique center social dynamics. These differences could potentially be the focus of future team capacity building. Conclusion. Social network analysis is a feasible and useful method to identify existing obesity prevention networks and key personnel in long day care centers.

Temporal analysis of tourism research collaboration network

Network analysis is an effective tool for the study of collaboration relationships among researchers. Collaboration networks constructed from previous studies, and their changes over time have been studied. However, the impact of individual researchers in collaboration networks has not been investigated systematically. We introduce a new method of measuring the contribution of researchers to the connectivity of collaboration networks and evaluate the importance of researchers by considering both contribution and productivity. Betweenness centrality is found to be better than degree centrality in terms of reflecting the changes of importance of researchers. Accordingly, a method is further proposed to identify key researchers at certain periods. The performance of the identified researchers demonstrates the effectiveness of the proposed method.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Scientific collaboration network among Brazilian universities: an analysis in Dentistry area

This paper analyses the scientific collaboration network formed by the Brazilian universities that investigate in dentistry area. The constructed network is based on the published documents in the Scopus (Elsevier) database covering a period of 10 (ten) years. It is used social network analysis as the best methodological approach to visualize the capacity for collaboration, dissemination and transmission of new knowledge among universities. Cohesion and density of the collaboration network is analyzed, as well as the centrality of the universities as key-actors and the occurrence of subgroups within the network. Data were analyzed using the software UCINET and NetDraw. The number of documents published by each university was used as an indicator of its scientific production.

Functional brain network efficiency predicts intelligence

The neuronal causes of individual differences in mental abilities such as intelligence are complex and profoundly important. Understanding these abilities has the potential to facilitate their enhancement. The purpose of this study was to identify the functional brain network characteristics and their relation to psychometric intelligence. In particular, we examined whether the functional network exhibits efficient small-world network attributes (high clustering and short path length) and whether these small-world network parameters are associated with intellectual performance. High-density resting state electroencephalography (EEG) was recorded in 74 healthy subjects to analyze graph-theoretical functional network characteristics at an intracortical level. Ravens advanced progressive matrices were used to assess intelligence. We found that the clustering coefficient and path length of the functional network are strongly related to intelligence. Thus, the more intelligent the subjects are the more the functional brain network resembles a small-world network. We further identified the parietal cortex as a main hub of this resting state network as indicated by increased degree centrality that is associated with higher intelligence. Taken together, this is the first study that substantiates the neural efficiency hypothesis as well as the Parieto-Frontal Integration Theory (P-FIT) of intelligence in the context of functional brain network characteristics. These theories are currently the most established intelligence theories in neuroscience. Our findings revealed robust evidence of an efficiently organized resting state functional brain network for highly productive cognitions.

Validation of network communicability metrics for the analysis of brain structural networks.

Computational network analysis provides new methods to analyze the brain's structural organization based on diffusion imaging tractography data. Networks are characterized by global and local metrics that have recently given promising insights into diagnosis and the further understanding of psychiatric and neurologic disorders. Most of these metrics are based on the idea that information in a network flows along the shortest paths. In contrast to this notion, communicability is a broader measure of connectivity which assumes that information could flow along all possible paths between two nodes. In our work, the features of network metrics related to communicability were explored for the first time in the healthy structural brain network. In addition, the sensitivity of such metrics was analysed using simulated lesions to specific nodes and network connections. Results showed advantages of communicability over conventional metrics in detecting densely connected nodes as well as subsets of nodes vulnerable to lesions. In addition, communicability centrality was shown to be widely affected by the lesions and the changes were negatively correlated with the distance from lesion site. In summary, our analysis suggests that communicability metrics that may provide an insight into the integrative properties of the structural brain network and that these metrics may be useful for the analysis of brain networks in the presence of lesions. Nevertheless, the interpretation of communicability is not straightforward; hence these metrics should be used as a supplement to the more standard connectivity network metrics.