Grindrod, P, Higham, DJ, Laflin, P et al. (2 more authors) (2016) Inverse network sampling to explore online brand allegiance. European Journal of Applied Mathematics, 27 (6). pp. 958-970. ISSN 0956-7925
Abstract
Within the online media universe there are many underlying communities.
These may be defined, for example, through politics, location, health, occupation, extracurricular interests or retail habits. Government departments, charities and commercial organisations can benefit greatly from insights about the structure of these communities; the move to customer-centered practices requires knowledge of the customer base. Motivated by this issue, we address the fundamental question of whether a subnetwork looks like a collection of individuals who have effectively been picked at random from the whole, or instead forms a distinctive community with a new, discernible structure. In the former case, to spread a message to the intended user base it may be best to use traditional broadcast media (TV, billboard), whereas in the latter case a more targeted approach could be more effective. In this work, we therefore formalize a concept of testing for substructure and apply it to social interaction data. First, we develop a statistical test to determine whether a given subnetwork (induced subgraph) is likely to have been generated by sampling nodes from the full network uniformly at random. This tackles an interesting inverse alternative to the more widely studied “forward” problem. We then apply the test to a Twitter reciprocated mentions network where a range of brand name based subnetworks are created via tweet content. We correlate the computed results against the independent views of sixteen digital marketing professionals. We conclude that there is great potential for social media based analytics to quantify, compare and interpret on-line brand allegiances systematically, in real time and at large scale.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © Cambridge University Press 2016. This is an author produced version of a paper published in European Journal of Applied Mathematics. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Generating function; mentions; networks; p-value; random graph; sampling; statistics; Twitter |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Applied Mathematics (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 29 Apr 2016 09:58 |
Last Modified: | 18 Feb 2022 15:25 |
Published Version: | https://doi.org/10.1017/S0956792516000085 |
Status: | Published |
Publisher: | Cambridge University Press |
Identification Number: | 10.1017/S0956792516000085 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:96482 |