DocumentCode :
2742089
Title :
Identifying key players in a social network: Measuring the extent of an individual´s Neighbourhood Connectivity
Author :
Bhola, Vivek ; Grover, Mahesh Kumar ; Sinha, Madhavi ; Singh, Gurminder
Author_Institution :
Dept. of Comput. Sci., Birla Inst. of T echnology Jaipur, Jaipur, India
fYear :
2010
fDate :
15-15 Dec. 2010
Firstpage :
1
Lastpage :
6
Abstract :
In this paper, we argue that only sufficient increase in distance between the nodes which can virtually disconnect the graph is necessary instead of the physical disconnection of the network to identify the key players in a network. A procedure is described for finding sets of key players in a social network. A key assumption is that the importance of a node v not only depends on the cohesion of its personal network but also depends on, to which extent the immediate neighbors and indirect contacts of node v are connected with each other. Therefore, a new measure of importance of a node in a network has been described which suggests the best node whose removal maximally increases the distances between rests of the nodes to virtually disconnect the graph at-least. Moreover, an algorithm based on network disruption has also been described which uses the proposed measure and chooses a single or group of nodes as key players in a network.
Keywords :
social networking (online); individual neighbourhood connectivity; key player identification; network disruption; network importance measurement; social network; Algorithm design and analysis; Computer science; Equations; Mathematical model; Object recognition; Social network services; Terrorism;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Business Applications of Social Network Analysis (BASNA), 2010 IEEE International Workshop on
Conference_Location :
Bangalore
Print_ISBN :
978-1-4244-8999-2
Type :
conf
DOI :
10.1109/BASNA.2010.5730305
Filename :
5730305
Link To Document :
بازگشت