scispace - formally typeset
Open AccessJournal ArticleDOI

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

Rumi Ghosh, +1 more
- 01 Apr 2014 - 
- Vol. 19, Iss: 5, pp 1355-1372
Reads0
Chats0
TLDR
It is demonstrated, 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.
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. 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 generally leads to a better agreement with an empirical ranking scheme than the conservative PageRank.

read more

Citations
More filters
Journal ArticleDOI

Random walks and diffusion on networks

TL;DR: The theory and applications of random walks on networks are surveyed, restricting ourselves to simple cases of single and non-adaptive random walkers, and three main types are distinguished: discrete-time random walks, node-centric continuous-timerandom walks, and edge-centric Continuous-Time random walks.
Journal ArticleDOI

Random walks and diffusion on networks

TL;DR: Random walks have been studied for many decades on both regular lattices and (especially in the last couple of decades) on networks with a variety of structures as discussed by the authors, and they are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including diffusion, interactions, and opinions among humans and animals; and can extract information about important entities or dense groups of entities in networks.
Journal ArticleDOI

Topological data analysis of contagion maps for examining spreading processes on networks

TL;DR: This work constructs “contagion maps” that use multiple contagions on a network to map the nodes as a point cloud and reveals insights to aid in the modeling, forecast, and control of spreading processes.
Journal ArticleDOI

Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs

TL;DR: In this article, the authors derived a graph curvature from the graph cut function, the natural graph counterpart of total variation (perimeter), and showed that the graph MBO scheme converges to a stationary state in a finite number of iterations.
Journal ArticleDOI

Simulation of rerouting phenomena in Dynamic Traffic Assignment with the Information Comply Model

TL;DR: The Information Comply Model (ICM) is presented, which extends the framework for macroscopic within-day DTA proposed by Gentile (2016) to represent the rerouting of drivers wrt a single traffic event and is capable of representing the evolution of rerouted phenomena in time and space.
References
More filters
Proceedings Article

The PageRank Citation Ranking : Bringing Order to the Web

TL;DR: This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
Journal ArticleDOI

A Set of Measures of Centrality Based on Betweenness

TL;DR: A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced in this paper, which define centrality in terms of the degree to which a point falls on the shortest path between others and there fore has a potential for control of communication.
Book

Infectious Diseases of Humans: Dynamics and Control

TL;DR: This book discusses the biology of host-microparasite associations, dynamics of acquired immunity heterogeneity within the human community indirectly transmitted helminths, and the ecology and genetics of hosts and parasites.
Journal ArticleDOI

The Mathematics of Infectious Diseases

Herbert W. Hethcote
- 01 Dec 2000 - 
TL;DR: Threshold theorems involving the basic reproduction number, the contact number, and the replacement number $R$ are reviewed for classic SIR epidemic and endemic models and results with new expressions for $R_{0}$ are obtained for MSEIR and SEIR endemic models with either continuous age or age groups.
Proceedings ArticleDOI

Maximizing the spread of influence through a social network

TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Related Papers (5)