Rethinking Centrality: The Role of Dynamical Processes in Social Network Analysis

Rethinking Centrality: The Role of Dynamical Processes in Social Network Analysis. Ghosh, R. & Lerman, K. Discrete and Continuous Dynamical Systems Series B, 19(5):1355 – 1372, July, 2014.

Paper abstract bibtex 46 downloads

Many popular measures used in social network analysis, including centrality, are based on the random walk. The random walk is a model of a stochastic process where a node interacts with one other node at a time. How- ever, the random walk may not be appropriate for modeling social phenomena, including epidemics and information diffusion, in which one node may interact with many others at the same time, for example, by broadcasting the virus or information to its neighbors. To produce meaningful results, social network analysis algorithms have to take into account the nature of interactions be- tween the nodes. In this paper we classify dynamical processes as conservative and non-conservative and relate them to well-known measures of centrality used in network analysis: PageRank and Alpha-Centrality. We demonstrate, by ranking users in online social networks used for broadcasting information, that non-conservative Alpha-Centrality generally leads to a better agreement with an empirical ranking scheme than the conservative PageRank. http://arxiv.org/abs/1209.4616

@ARTICLE{Ghosh14dcds,
  AUTHOR =       {Rumi Ghosh and Kristina Lerman},
  TITLE =        {Rethinking Centrality: The Role of Dynamical Processes in Social Network Analysis},
  JOURNAL =      {Discrete and Continuous Dynamical Systems Series B},
  YEAR =         {2014},
  volume =       {19},
  number =       {5},
  pages =        {1355 -- 1372},
  month =        {July},
  note =         {},
  abstract =     {Many popular measures used in social network analysis, including
centrality, are based on the random walk. The random walk is a model of a
stochastic process where a node interacts with one other node at a time. How-
ever, the random walk may not be appropriate for modeling social phenomena,
including epidemics and information diffusion, in which one node may interact
with many others at the same time, for example, by broadcasting the virus or
information to its neighbors. To produce meaningful results, social network
analysis algorithms have to take into account the nature of interactions be-
tween the nodes. In this paper we classify dynamical processes as conservative
and non-conservative and relate them to well-known measures of centrality
used in network analysis: PageRank and Alpha-Centrality. We demonstrate,
by ranking users in online social networks used for broadcasting information,
that non-conservative Alpha-Centrality generally leads to a better agreement
with an empirical ranking scheme than the conservative PageRank. http://arxiv.org/abs/1209.4616},
  keywords =     {social-networks},
    url = {http://aimsciences.org/journals/displayArticlesnew.jsp?paperID=9862},
}

Downloads: 46