Abstract

The purpose of the present study is to provide a method for implementing hiding operations through creating turbulence in the weight of the edges for large and complex grids. This proposed algorithm is a combination of two methods proposed by Liu and Yuk. For this purpose, we needed a method for predicting new nodes and their relationships with other nodes in social networks. The method of predicting the added nodes and their new edges in weighted and undirected graphs which was proposed by Yuk et al was used for the implementation of this part of the algorithm that the way of edges' formation for new nodes is based on the distribution of available nodes in the network.