A New Model for Probabilistic Polling on Social Network

One of the most important reasons of polling process study is originated from abundant applications of distribution systems. Agreement issue lets a group of calculation parameters to converge by starting initial values. We can assume in a very simple example, a state in which calculation elements start from values 0 and 1. The main goal is to obtain a state that all calculation elements agree in an identical value through the network that the identical value is either zero or one eventually. In this paper, first we explain Pleg and Nakata`s models briefly then we discuss about our suggested solution that guaranties getting an agreement by probable principles and finally we compare convergence time of Pelg and Nakata`s model with our model.