Title: BDD-based two-party trust sensitivity analysis for social networks

Authors: Liudong Xing; Honggang Wang; Chaonan Wang; Yujie Wang

Addresses: Department of Electrical and Computer Engineering, University of Massachusetts, Dartmouth, USA ' Department of Electrical and Computer Engineering, University of Massachusetts, Dartmouth, USA ' Department of Electrical and Computer Engineering, University of Massachusetts, Dartmouth, USA ' Department of Electrical and Computer Engineering, University of Massachusetts, Dartmouth, USA

Abstract: This paper presents a binary decision diagrams (BDD)-based algorithm for the trust sensitivity analysis in social networks. Trust is a crucial basis for interactions among parties in social networks. Based on trust scores of direct links between parties, the trust sensitivity analysis can help identify which direct link(s) in the social network contributes the most to a trust relationship between two particular parties who are not directly connected in the network. Three different sensitivity measures including Birnbaum's measure, criticality importance factor, and structural importance measure are investigated and adapted for the two-party trust sensitivity analysis for social networks. Several examples are given to illustrate the application of the presented BDD-based method and sensitivity measures.

Keywords: trust sensitivity analysis; social networks; binary decision diagramd; sensitivity measures; BDD.

DOI: 10.1504/IJSN.2012.053462

International Journal of Security and Networks, 2012 Vol.7 No.4, pp.242 - 251

Available online: 23 Apr 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article