Discovering and validating influence in a dynamic online social network

Tools

Laflin, Peter and Mantzaris, Alexander Vassilios and Ainley, Fiona and Otley, Amanda and Grindrod, Peter and Higham, Desmond (2013) Discovering and validating influence in a dynamic online social network. Social Network Analysis and Mining, 3 (4). pp. 1311-1323. (https://doi.org/10.1007/s13278-013-0143-7)

Full text not available in this repository.Request a copy

Abstract

Online human interactions take place within a dynamic hierarchy, where social influence is determined by qualities such as status, eloquence, trustworthiness, authority and persuasiveness. In this work, we consider topic-based twitter interaction networks, and address the task of identifying influential players. Our motivation is the strong desire of many commercial entities to increase their social media presence by engaging positively with pivotal bloggers and tweeters. After discussing some of the issues involved in extracting useful interaction data from a twitter feed, we define the concept of an active node subnetwork sequence. This provides a time-dependent, topic-based, summary of relevant twitter activity. For these types of transient interactions, it has been argued that the flow of information, and hence the influence of a node, is highly dependent on the timing of the links. Some nodes with relatively small bandwidth may turn out to be key players because of their prescience and their ability to instigate follow-on network activity. To simulate a commercial application, we build an active node subnetwork sequence based on key words in the area of travel and holidays. We then compare a range of network centrality measures, including a recently proposed version that accounts for the arrow of time, with respect to their ability to rank important nodes in this dynamic setting. The centrality rankings use only connectivity information (who tweeted whom, when), without requiring further information about the account type or message content, but if we post-process the results by examining account details, we find that the time-respecting, dynamic approach, which looks at the follow-on flow of information, is less likely to be ‘misled’ by accounts that appear to generate large numbers of automatic tweets with the aim of pushing out web links. We then benchmark these algorithmically derived rankings against independent feedback from five social media experts, given access to the full tweet content, who judge twitter accounts as part of their professional duties. We find that the dynamic centrality measures add value to the expert view, and can be hard to distinguish from an expert in terms of who they place in the top ten. These algorithms, which involve sparse matrix linear system solves with sparsity driven by the underlying network structure, can be applied to very large-scale networks. We also test an extension of the dynamic centrality measure that allows us to monitor the change in ranking, as a function of time, of the twitter accounts that were eventually deemed influential.

ORCID iDs

Laflin, Peter, Mantzaris, Alexander Vassilios ORCID logoORCID: https://orcid.org/0000-0002-9138-1878, Ainley, Fiona, Otley, Amanda, Grindrod, Peter and Higham, Desmond ORCID logoORCID: https://orcid.org/0000-0002-6635-3461;
CORE (COnnecting REpositories)