Information dissemination in socially aware networks under the linear threshold model

Venkatramanan, Srinivasan and Kumar, Anurag Anil (2011) Information dissemination in socially aware networks under the linear threshold model. In: 2011 National Conference on Communications (NCC), 28-30 Jan. 2011, Bangalore.

PDF Nati_Confe_Comm_1_2011.pdf - Published Version Restricted to Registered users only Download (329kB) | Request a copy

Abstract

We provide new analytical results concerning the spread of information or influence under the linear threshold social network model introduced by Kempe et al. in, in the information dissemination context. The seeder starts by providing the message to a set of initial nodes and is interested in maximizing the number of nodes that will receive the message ultimately. A node's decision to forward the message depends on the set of nodes from which it has received the message. Under the linear threshold model, the decision to forward the information depends on the comparison of the total influence of the nodes from which a node has received the packet with its own threshold of influence. We derive analytical expressions for the expected number of nodes that receive the message ultimately, as a function of the initial set of nodes, for a generic network. We show that the problem can be recast in the framework of Markov chains. We then use the analytical expression to gain insights into information dissemination in some simple network topologies such as the star, ring, mesh and on acyclic graphs. We also derive the optimal initial set in the above networks, and also hint at general heuristics for picking a good initial set.

Item Type:	Conference Proceedings
Publisher:	IEEE
Additional Information:	Copyright of this article belongs to IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	16 Apr 2013 05:56
Last Modified:	16 Apr 2013 05:56
URI:	http://eprints.iisc.ac.in/id/eprint/46213

Actions (login required)

View Item