Probabilistic Relation between Triadic Closure and the Balance of Social Networks in Presence of Influence
Data analysis in social networking is a major research concern in todays' environment in the field of interpretation models of data for any network. Social networking includes only two types of relationships: firstly, a friendly relation with whom one is having a link that can be considered as a positive relation and secondly, a relationship with which one is not connected or so called one's enemies labelled as negative relationships. Balanced theorem of social networking claims that all the nodes in the social network can be divided into two sets: a friendship set and an enemy set and provides the global view of relationships. In this paper, the authors have shown a probabilistic model to show that the global view of social links does not only depend on negative and positive relations to be distinguished, but it also depends on influences parameters.