×

Inverse network sampling to explore online brand allegiance. (English) Zbl 1408.91177

Summary: 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-centred practices requires knowledge of the customer base. Motivated by this issue, we address the fundamental question of whether a sub-network 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 formalise a concept of testing for sub-structure and apply it to social interaction data. First, we develop a statistical test to determine whether a given sub-network (induced sub-graph) 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 sub-networks are created via tweet content. We correlate the computed results against the independent views of 16 digital marketing professionals. We conclude that there is great potential for social media based analytics to quantify, compare and interpret online brand allegiances systematically, in real time and at large scale.

MSC:

91D30 Social networks; opinion dynamics
90B60 Marketing, advertising
05C90 Applications of graph theory
68M11 Internet topics
62P25 Applications of statistics to social sciences
Full Text: DOI

References:

[1] Aral, S., Social science: Poked to vote., Nature, 489, 212-214, (2012)
[2] Aral, S.; Walker, D., Identifying influential and susceptible members of social networks., Science, 337, 337-341, (2012) · Zbl 1355.91065
[3] Bakshy, E.; Hofman, J. M.; Mason, W. A.; Watts, D. J., (2011)
[4] Bakshy, E.; Rosenn, I.; Marlow, C.; Adamic, L., (2012)
[5] Boutet, A.; Kim, H.; Yoneki, E., Whats in Twitter, I know what parties are popular and who you are supporting now!, Soc. Netw. Anal. Min., 3, 1379-1391, (2013)
[6] Brodie, R. J.; Ilic, A.; Juric, B.; Hollebeek, L., Consumer engagement in a virtual brand community: An exploratory analysis., J. Bus. Res., 66, 105-114, (2013)
[7] Chana, K. W.; Lib, S. Y., Understanding consumer-to-consumer interactions in virtual communities: The salience of reciprocity., J. Bus. Res., 63, 1033-1040, (2010)
[8] Chua, J.; Arce-Urrizab, M.; Cebollada-Calvoc, J.-J.; Chintaguntad, P. K., An empirical analysis of shopping behavior across online and offline channels for grocery products: The moderating effects of household and product characteristics., J. Interact. Mark., 24, 251-268, (2010)
[9] Ciulla, F.; Mocanu, D.; Baronchelli, A.; Gonçalves, B.; Perra, N.; Vespignani, A., Beating the news using social media: The case study of American Idol., EPJ Data Sci., 1, 1-11, (2012)
[10] Danaher, P. J.; Wilson, I. W.; Davis, R. A., A comparison of online and offline consumer brand loyalty., Mark. Sci., 22, 461-476, (2003)
[11] Farhi, P., Oreo’s Tweeted ad was Super Bowl blackout’s Big Winner, (2013), Washington Post
[12] Feld, S. L., Why your friends have more friends than you do., Am. J. Sociol., 96, 1464-1477, (1991)
[13] García-Herranz, M.; Moro, E.; Cebrián, M.; Christakis, N. A.; Fowler, J. H., Using friends as sensors to detect global-scale contagious outbreaks, PLOS ONE, 9, e92413, (2014)
[14] Grindrod, P., Mathematical Underpinnings of Analytics: Theory and Applications, (2014), Oxford University Press: Oxford University Press, Oxford
[15] Kuehn, C.; Martens, E. A.; Romero, D. M., Critical transitions in social network activity., J. Complex Netw., 2, 141-152, (2014)
[16] Kwak, H.; Lee, C.; Park, H.; Moon, S., (2010)
[17] Laflin, P.; Mantzaris, A. V.; Ainley, F.; Otley, A.; Grindrod, P.; Higham, D. J., Discovering and validating influence in a dynamic online social network., Soc. Netw. Anal. Min., 3, 1311-1323, (2013)
[18] Laflin, P.; Mantzaris, A. V.; Ainley, F.; Otley, A.; Grindrod, P.; Higham, D. J., (2015)
[19] Laroche, M.; Habibi, M. R.; Richard, M.-O., To be or not to be in social media: How brand loyalty is affected by social media?, Int. J. Inform. Manage., 33, 76-82, (2013)
[20] Laroche, M.; Habibi, M. R.; Richard, M.-O.; Sankaranarayanan, R., The effects of social media based brand communities on brand community markers, value creation practices, brand trust and brand loyalty., Comput. Human Behav., 28, 1755-1767, (2012)
[21] Lazer, D.; Pentland, A.; Adamic, L.; Aral, S.; Barabási, A.-L.; Brewer, D.; Christakis, N.; Contractor, N.; Fowler, J.; Gutmann, M.; Jebara, T., Computational social science., Science, 323, 721-723, (2009)
[22] Lee, S. H.; Kim, P.-J.; Jeong, H., Statistical properties of sampled networks., Phys. Rev. E, 73, 016102, (2006)
[23] Leskovec, J.; Faloutsos, C., (2006)
[24] Lowcay, C.; Marsland, S.; Mccartin, C., Network parameters and heuristics in practice: A case study using the target set selection problem., J. Complex Netw., 2, 373-393, (2014)
[25] Maiya, A. S.; Berger-Wolf, T. Y., (2011)
[26] Stumpf, M.; Wiuf, C.; May, R., Subnets of scale-free networks are not scale-free: Sampling properties of networks., Proc. Nat. Acad. Sci., 102, 4221-4224, (2005)
[27] Wu, S.; Hofman, J. M.; Mason, W. A.; Watts, D. J., (2011)
[28] Zaglia, M. E., Brand communities embedded in social networks., J. Bus. Res., 66, 216-223, (2013)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.