Social networks and positive and negative affect

We followed 100 university students in the UK for one week, instructing them to record all face-to-face, phone and digital contacts during the day as well as their positive and negative affect. We wanted to see how positive and negative affect spread around a social network while taking into account participants’ socio-demographic data, personality, general health and gratitude scores. We focused on the participants’ connections with those in their class; excluding friends and family outside this group. The data was analysed using actor-based models implemented in SIENA. Results show differences between positive and negative affect dynamics in this environment and an influence of personality traits on the average number and rate of communication.

Social networks: evolving graphs with memory dependent edges

The plethora, and mass take up, of digital communication tech- nologies has resulted in a wealth of interest in social network data collection and analysis in recent years. Within many such networks the interactions are transient: thus those networks evolve over time. In this paper we introduce a class of models for such networks using evolving graphs with memory dependent edges, which may appear and disappear according to their recent history. We consider time discrete and time continuous variants of the model. We consider the long term asymptotic behaviour as a function of parameters controlling the memory dependence. In particular we show that such networks may continue evolving forever, or else may quench and become static (containing immortal and/or extinct edges). This depends on the ex- istence or otherwise of certain infinite products and series involving age dependent model parameters. To test these ideas we show how model parameters may be calibrated based on limited samples of time dependent data, and we apply these concepts to three real networks: summary data on mobile phone use from a developing region; online social-business network data from China; and disaggregated mobile phone communications data from a reality mining experiment in the US. In each case we show that there is evidence for memory dependent dynamics, such as that embodied within the class of models proposed here.

Evolving social networks, attitudes and beliefs and counter terrorism

'The Princeton Companion to Applied Mathematics' is an introduction to applied mathematics for students, teachers, and professionals. This article is for the "Application Areas" part of the book, which comprises articles on connections between applied mathematics and other disciplines.

Bayesian parameter estimation for latent Markov random fields and social networks

Undirected graphical models are widely used in statistics, physics and machine vision. However Bayesian parameter estimation for undirected models is extremely challenging, since evaluation of the posterior typically involves the calculation of an intractable normalising constant. This problem has received much attention, but very little of this has focussed on the important practical case where the data consists of noisy or incomplete observations of the underlying hidden structure. This paper specifically addresses this problem, comparing two alternative methodologies. In the first of these approaches particle Markov chain Monte Carlo (Andrieu et al., 2010) is used to efficiently explore the parameter space, combined with the exchange algorithm (Murray et al., 2006) for avoiding the calculation of the intractable normalising constant (a proof showing that this combination targets the correct distribution in found in a supplementary appendix online). This approach is compared with approximate Bayesian computation (Pritchard et al., 1999). Applications to estimating the parameters of Ising models and exponential random graphs from noisy data are presented. Each algorithm used in the paper targets an approximation to the true posterior due to the use of MCMC to simulate from the latent graphical model, in lieu of being able to do this exactly in general. The supplementary appendix also describes the nature of the resulting approximation.

Social networks and occupational choice: the endogenous formation of attitudes and beliefs about tax compliance

The paper analyses the emergence of group-specific attitudes and beliefs about tax compliance when individuals interact in a social network. It develops a model in which taxpayers possess a range of individual characteristics – including attitude to risk, potential for success in self-employment, and the weight attached to the social custom for honesty – and make an occupational choice based on these characteristics. Occupations differ in the possibility for evading tax. The social network determines which taxpayers are linked, and information about auditing and compliance is transmitted at meetings between linked taxpayers. Using agent-based simulations, the analysis demonstrates how attitudes and beliefs endogenously emerge that differ across sub-groups of the population. Compliance behaviour is different across occupational groups, and this is reinforced by the development of group-specific attitudes and beliefs. Taxpayers self-select into occupations according to the degree of risk aversion, the subjective probability of audit is sustained above the objective probability, and the weight attached to the social custom differs across occupations. These factors combine to lead to compliance levels that differ across occupations.

Weighted alpha-rate dominating sets in social networks

We are looking into variants of a domination set problem in social networks. While randomised algorithms for solving the minimum weighted domination set problem and the minimum alpha and alpha-rate domination problem on simple graphs are already present in the literature, we propose here a randomised algorithm for the minimum weighted alpha-rate domination set problem which is, to the best of our knowledge, the first such algorithm. A theoretical approximation bound based on a simple randomised rounding technique is given. The algorithm is implemented in Python and applied to a UK Twitter mentions networks using a measure of individuals’ influence (klout) as weights. We argue that the weights of vertices could be interpreted as the costs of getting those individuals on board for a campaign or a behaviour change intervention. The minimum weighted alpha-rate dominating set problem can therefore be seen as finding a set that minimises the total cost and each individual in a network has at least alpha percentage of its neighbours in the chosen set. We also test our algorithm on generated graphs with several thousand vertices and edges. Our results on this real-life Twitter networks and generated graphs show that the implementation is reasonably efficient and thus can be used for real-life applications when creating social network based interventions, designing social media campaigns and potentially improving users’ social media experience.

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.

Mapping power law distributions in digital health social networks: methods, interpretations, and practical implications

BACKGROUND: Social networks are common in digital health. A new stream of research is beginning to investigate the mechanisms of digital health social networks (DHSNs), how they are structured, how they function, and how their growth can be nurtured and managed. DHSNs increase in value when additional content is added, and the structure of networks may resemble the characteristics of power laws. Power laws are contrary to traditional Gaussian averages in that they demonstrate correlated phenomena. OBJECTIVES: The objective of this study is to investigate whether the distribution frequency in four DHSNs can be characterized as following a power law. A second objective is to describe the method used to determine the comparison. METHODS: Data from four DHSNs—Alcohol Help Center (AHC), Depression Center (DC), Panic Center (PC), and Stop Smoking Center (SSC)—were compared to power law distributions. To assist future researchers and managers, the 5-step methodology used to analyze and compare datasets is described. RESULTS: All four DHSNs were found to have right-skewed distributions, indicating the data were not normally distributed. When power trend lines were added to each frequency distribution, R(2) values indicated that, to a very high degree, the variance in post frequencies can be explained by actor rank (AHC .962, DC .975, PC .969, SSC .95). Spearman correlations provided further indication of the strength and statistical significance of the relationship (AHC .987. DC .967, PC .983, SSC .993, P<.001). CONCLUSIONS: This is the first study to investigate power distributions across multiple DHSNs, each addressing a unique condition. Results indicate that despite vast differences in theme, content, and length of existence, DHSNs follow properties of power laws. The structure of DHSNs is important as it gives insight to researchers and managers into the nature and mechanisms of network functionality. The 5-step process undertaken to compare actor contribution patterns can be replicated in networks that are managed by other organizations, and we conjecture that patterns observed in this study could be found in other DHSNs. Future research should analyze network growth over time and examine the characteristics and survival rates of superusers.

Social networks on the Internet: a practical investigation about file sharing on Facebook

The social networks on the internet have experienced rapid growth and joined millions of users in Brazil and throughout the world. Such networks allow groups of people to communicate and exchange information. Sharing information in files is also a growing activity on the internet and is done in various ways. However, applications are not yet available to enable file sharing on Facebook, the premier social network today. This study aims to investigate how users use Facebook, and their practices for file sharing. Due to the experimental nature of this research, we opted for a data collection survey, applied over the web. From the data analysis, we have found a frequent use of file sharing, but no interest in paid services. As for Facebook, there was an extensive use of applications. The set of results shows a favourable scenario for applications that allow file sharing on Facebook.

STATE INSTITUTIONS, POWER, AND SOCIAL NETWORKS IN BRAZILIAN URBAN POLICIES

A large historiographic tradition has studied the Brazilian state, yet we know relatively little about its internal dynamics and particularities. The role of informal, personal, and unintentional ties has remained underexplored in most policy network studies, mainly because of the pluralist origin of that tradition. It is possible to use network analysis to expand this knowledge by developing mesolevel analysis of those processes. This article proposes an analytical framework for studying networks inside policy communities. This framework considers the stable and resilient patterns that characterize state institutions, especially in contexts of low institutionalization, particularly those found in Latin America and Brazil. The article builds on research on urban policies in Brazil to suggest that networks made of institutional and personal ties structure state organizations internally and insert them,into broader political scenarios. These networks, which I call state fabric, frame politics, influence public policies, and introduce more stability and predictability than the majority of the literature usually considers. They also form a specific power resource-positional power, associated with the positions that political actors occupy-that influences politics inside and around the state.

Social Networks, Segregation and Poverty in Sao Paulo

The associations between segregation and urban poverty have been intensely scrutinized by the sociology and urban studies literatures. More recently, several studies have emphasized the importance of social networks for living conditions. Yet relatively few studies have tested the precise effects of social networks, and fewer still have focused on the joint effects of residential segregation and social networks on living conditions. This article explores the associations between networks, segregation and some of the most important dimensions of access to goods and services obtained in markets: escaping from social precariousness and obtaining monetary income. It is based on a study of the personal networks of 209 individuals living in situations of poverty in seven locales in the metropolitan area of Sao Paulo. Using network analysis and multivariate techniques, I show that relational settings strongly influence the access individuals have to markets, leading some individuals into worse living conditions and poverty. At the same time, although segregation plays an important role in poverty, its effects tend to be mediated by the networks in which individuals are embedded. Networks in this sense may enhance or mitigate the effects of isolation produced by space.

Multidimensional Projections for Visual Analysis of Social Networks

Visual analysis of social networks is usually based on graph drawing algorithms and tools. However, social networks are a special kind of graph in the sense that interpretation of displayed relationships is heavily dependent on context. Context, in its turn, is given by attributes associated with graph elements, such as individual nodes, edges, and groups of edges, as well as by the nature of the connections between individuals. In most systems, attributes of individuals and communities are not taken into consideration during graph layout, except to derive weights for force-based placement strategies. This paper proposes a set of novel tools for displaying and exploring social networks based on attribute and connectivity mappings. These properties are employed to layout nodes on the plane via multidimensional projection techniques. For the attribute mapping, we show that node proximity in the layout corresponds to similarity in attribute, leading to easiness in locating similar groups of nodes. The projection based on connectivity yields an initial placement that forgoes force-based or graph analysis algorithm, reaching a meaningful layout in one pass. When a force algorithm is then applied to this initial mapping, the final layout presents better properties than conventional force-based approaches. Numerical evaluations show a number of advantages of pre-mapping points via projections. User evaluation demonstrates that these tools promote ease of manipulation as well as fast identification of concepts and associations which cannot be easily expressed by conventional graph visualization alone. In order to allow better space usage for complex networks, a graph mapping on the surface of a sphere is also implemented.