A Study About Complexity of Social Network

Artificial intelligence discusses social networks as one of the themes based on unraveling complexity. \(\mathcal{O}(n^2)\) is the core problem of the complexity of social networks and continues to increase when the construction of social networks follows the interests of social actors or by recognizing them through keywords (node and edge labels). The study aims to reveal a possible method to avoid that complexity. With the help of computations on several experiments, it shows that the potential is linearization in social networks and that potential from several sides gets a social network.