Node influence is yet another useful concept to quantify how important each node is over a network and can share the same role that other centrality measures have. It can provide new insight into the information diffusion phenomena such as existence of epidemic threshold which the other topology-based centralities cannot do. We focus on information diffusion process based on the SIR model, and address the problem of efficiently estimating the influence degree for all the nodes in the network. The proposed approach is a further improvement over the existing work of the bond percolation process [1], [2] which was demonstrated to be very effective, i.e., three orders of magnitude faster than direct Monte Carlo simulation, in approximately solving the influence maximization problem under a greedy search strategy. We introduce two pruning techniques which improve computational efficiency by an order of magnitude. This is a generic approach for the SIR model setting and can be instantiated to any specific diffusion model. It does not require any approximations or assumptions to the model, e.g., small diffusion probability, shortest path, maximum influence path, etc., that were needed in the existing approaches. We demonstrate its effectiveness by extensive experiments on two large real social networks. Main finding includes that different network structures have different epidemic thresholds and the node influence can identify influential nodes that the other centrality measures cannot.

Item Type:	Refereed Conference Paper
Research Division:	Information and Computing Sciences
Research Group:	Distributed Computing
Research Field:	Networking and Communications
Objective Division:	Expanding Knowledge
Objective Group:	Expanding Knowledge
Objective Field:	Expanding Knowledge in the Information and Computing Sciences
Author:	Motoda, H (Dr Hiroshi Motoda)
ID Code:	100270
Year Published:	2014
Deposited By:	Research Division
Deposited On:	2015-05-08
Last Modified:	2018-01-28
Downloads:	0