Uncovering nodes that spread information between communities in social networks

From many datasets gathered in online social networks, well defined community structures have been observed. A large number of users participate in these networks and the size of the resulting graphs poses computational challenges. There is a particular demand in identifying the nodes responsible for information flow between communities; for example, in temporal Twitter networks edges between communities play a key role in propagating spikes of activity when the connectivity between communities is sparse and few edges exist between different clusters of nodes. The new algorithm proposed here is aimed at revealing these key connections by measuring a node's vicinity to nodes of another community. We look at the nodes which have edges in more than one community and the locality of nodes around them which influence the information received and broadcasted to them. The method relies on independent random walks of a chosen fixed number of steps, originating from nodes with edges in more than one community. For the large networks that we have in mind, existing measures such as betweenness centrality are difficult to compute, even with recent methods that approximate the large number of operations required. We therefore design an algorithm that scales up to the demand of current big data requirements and has the ability to harness parallel processing capabilities. The new algorithm is illustrated on synthetic data, where results can be judged carefully, and also on a real, large scale Twitter activity data, where new insights can be gained

Infering and calibrating triadic closure in a dynamic network

In the social sciences, the hypothesis of triadic closure contends that new links in a social contact network arise preferentially between those who currently share neighbours. Here, in a proof-of-principle study, we show how to calibrate a recently proposed evolving network model to time-dependent connectivity data. The probabilistic edge birth rate in the model contains a triadic closure term, so we are also able to assess statistically the evidence for this effect. The approach is shown to work on data generated synthetically from the model. We then apply this methodology to some real, large-scale data that records the build up of connections in a business-related social networking site, and find evidence for triadic closure

Examining collusion and voting biases between countries during the Eurovision song contest since 1957

The Eurovision Song Contest (ESC) is an annual event which attracts millions of viewers. It is an interesting activity to examine since the participants of the competition represent a particular country's musical performance that will be awarded a set of scores from other participating countries based upon a quality assessment of a performance. There is a question of whether the countries will vote exclusively according to the artistic merit of the song, or if the vote will be a public signal of national support for another country. Since the competition aims to bring people together, any consistent biases in the awarding of scores would defeat the purpose of the celebration of expression and this has attracted researchers to investigate the supporting evidence for biases. This paper builds upon an approach which produces a set of random samples from an unbiased distribution of score allocation, and extends the methodology to use the full set of years of the competition's life span which has seen fundamental changes to the voting schemes adopted. By building up networks from statistically significant edge sets of vote allocations during a set of years, the results display a plausible network for the origins of the culture anchors for the preferences of the awarded votes. With 60 years of data, the results support the hypothesis of regional collusion and biases arising from proximity, culture and other irrelevant factors in regards to the music which that alone is intended to affect the judgment of the contest.Comment: to be published in JASS

Class, community, language and struggle: Hebrew against Yiddish in South Africa 1900-1914

Paper presented at the Wits History Workshop: The Making of Class, 9-14 February, 198

Twitter’s big hitters

We describe the results of a new computational experiment on Twitter data. By listening to Tweets on a selected topic, we generate a dynamic social interaction network. We then apply a recently proposed dynamic network analysis algorithm that ranks Tweeters according to their ability to broadcast information. In particular, we study the evolution of importance rankings over time. Our presentation will also describe the outcome of an experiment where results from automated ranking algorithms are compared with the views of social media experts

A model for dynamic communicators

We develop and test an intuitively simple dynamic network model to describe the type of time-varying connectivity structure present in many technological settings. The model assumes that nodes have an inherent hierarchy governing the emergence of new connections. This idea draws on newly established concepts in online human behaviour concerning the existence of discussion catalysts, who initiate long threads, and online leaders, who trigger feedback. We show that the model captures an important property found in e-mail and voice call data – ‘dynamic communicators’ with sufficient foresight or impact to generate effective links and having an influence that is grossly underestimated by static measures based on snaphots or aggregated data

Dynamic communicability predicts infectiousness

Using real, time-dependent social interaction data, we look at correlations between some recently proposed dynamic centrality measures and summaries from large-scale epidemic simulations. The evolving network arises from email exchanges. The centrality measures, which are relatively inexpensive to compute, assign rankings to individual nodes based on their ability to broadcast information over the dynamic topology. We compare these with node rankings based on infectiousness that arise when a full stochastic SI simulation is performed over the dynamic network. More precisely, we look at the proportion of the network that a node is able to infect over a fixed time period, and the length of time that it takes for a node to infect half the network.We find that the dynamic centrality measures are an excellent, and inexpensive, proxy for the full simulation-based measures