Rethinking Centrality: The Role of Dynamical Processes in Social Network
Analysis
R. Ghosh, and K. Lerman. (2012)cite arxiv:1209.4616Comment: submitted to Discrete and Continuous Dynamical Systems.
Abstract
Many popular measures used in social network analysis, including measures of
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.
However, 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
between 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 leads to a better agreement
with an empirical ranking scheme than the conservative PageRank.
Description
Rethinking Centrality: The Role of Dynamical Processes in Social Network
Analysis
%0 Generic
%1 ghosh2012rethinking
%A Ghosh, Rumi
%A Lerman, Kristina
%D 2012
%K article dynamical network social socialnetwork
%T Rethinking Centrality: The Role of Dynamical Processes in Social Network
Analysis
%U http://arxiv.org/abs/1209.4616
%X Many popular measures used in social network analysis, including measures of
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.
However, 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
between 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 leads to a better agreement
with an empirical ranking scheme than the conservative PageRank.
@misc{ghosh2012rethinking,
abstract = {Many popular measures used in social network analysis, including measures of
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.
However, 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
between 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 leads to a better agreement
with an empirical ranking scheme than the conservative PageRank.},
added-at = {2013-02-07T18:58:45.000+0100},
author = {Ghosh, Rumi and Lerman, Kristina},
biburl = {https://www.bibsonomy.org/bibtex/29717a6b5a5966257add34c327a9050fc/abhishek.chak},
description = {Rethinking Centrality: The Role of Dynamical Processes in Social Network
Analysis},
interhash = {df55dd84541ab11671de04dee7229d7a},
intrahash = {9717a6b5a5966257add34c327a9050fc},
keywords = {article dynamical network social socialnetwork},
note = {cite arxiv:1209.4616Comment: submitted to Discrete and Continuous Dynamical Systems},
timestamp = {2013-02-07T18:58:46.000+0100},
title = {Rethinking Centrality: The Role of Dynamical Processes in Social Network
Analysis},
url = {http://arxiv.org/abs/1209.4616},
year = 2012
}