Survey of Influential Nodes Identification in Online Social Networks

Survey of Influential Nodes Identification in Online Social Networks

Dhrubasish Sarkar (Amity University Kolkata, Kolkata, India), Dipak K. Kole (Department of CSE, Jalpaiguri Government Engineering College, Jalpaiguri, India) and Premananda Jana (Department of CSE, MCKV Institute of Engineering, Howrah, India)
DOI: 10.4018/IJVCSN.2016100104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The increasing popularity of Online Social Networks (OSNs), its complex and rapidly growing structure, its potential impact on business, politics, healthcare and society has led to a great deal of interest in the development of efficient influential nodes identification algorithms. Different kind of business organizations are trying to use the social networking sites to reach the target audience quickly and efficiently in terms of cost and time. The influential nodes can play an important role in it. In this paper the features of social network, models of social networks and different models or approaches used for identifying influential nodes in online social networks have been studied.
Article Preview

Common Terms And Concepts

Graph theory is used for studying topological analysis of the social networks. A social Network structure is the collection of individual users and the association or links between them. The structure can be represented as an undirected graph where the users can be represented as vertex and the links or relationships are edges (Figure 1). The relationships between two nodes can be of different types with different weights.

Figure 1.

Representation of an OSN as a Graph

Graph: A graph is a way of specifying relationships among a collection of items. A graph consists of a set of objects, called nodes or vertex, with certain pairs of these objects connected by links called edges (Figure 1).

  • Path: A path is simply a sequence of nodes with the property that each consecutive pair in the sequence is connected by an edge.

  • Connectivity: A graph is connected if for every pair of nodes, there is a path between them.

  • Diameter: It is calculated as the length of the longest shortest path between any pair of nodes in the graph.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017): 2 Released, 2 Forthcoming
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing