Establishing ties with bounded capacity and limited network access

This paper explores how individuals build relationships in a social network from the perspective of computer science, mathematics and sociology. Interpersonal relationships in social networks can boost up information dissemination and enhance individuals' dominant position in the network. The following question is put forward in this paper: how do individuals build relationships with members of social networks in order to improve their self-importance? Therefore, three effective algorithms are raised to solve this problem from the perspective of network operators. Network operators can selectively provide users with different rights, which enables users to see the local information, global information and partial community information in the network, and develops corresponding social strategies from the perspective of the users' The paper also proposes a connection-based and time-based restriction model and compares the performance of the three strategies based on it. It then examines the different performance of these three strategies on network structure attributes, such as embeddedness and clustering coefficient. What is more, for the community strategy, the impact of different scales of community on the community strategy to improve users' centrality and embeddedness is also discussed. Experiments were conducted on simulated random networks and real dynamic network datasets. Finally, this paper compares the three strategies and makes detailed analysis.