journal article·2022Open access

Model for Generating Scale-Free Artificial Social Networks Using Small-World Networks

Farhan Amin, Gyu Sang Choi

Computers, Materials & Continua· Volume 73· Issue 3

Abstract

The Internet of Things (IoT) has the potential to be applied to social networks due to innovative characteristics and sophisticated solutions that challenge traditional uses. Social network analysis (SNA) is a good example that has recently gained a lot of scientific attention. It has its roots in social and economic research, as well as the evaluation of network science, such as graph theory. Scientists in this area have subverted predefined theories, offering revolutionary ones regarding interconnected networks, and they have highlighted the mystery of six degrees of separation with confirmation of the small-world phenomenon. The motivation of this study is to understand and capture the clustering properties of large networks and social networks. We present a network growth model in this paper and build a scale-free artificial social network with controllable clustering coefficients. The random walk technique is paired with a triangle generating scheme in our proposed model. As a result, the clustering control mechanism and preferential attachment (PA) have been realized. This research builds on the present random walk model. We took numerous measurements for validation, including degree behavior and the measure of clustering decay in terms of node degree, among other things. Finally, we conclude that our suggested random walk model is more efficient and accurate than previous state-of-the-art methods, and hence it could be a viable alternative for societal evolution.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Complex Network Analysis Techniques · Opinion Dynamics and Social Influence · Peer-to-Peer Network Technologies

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (60)

Show source-provided references
1. On the evolution of user interaction in facebook
2. Growing networks through random walks without restarts
3. Growing scale-free networks with tunable clustering
4. SNAP datasets: Stanford large network dataset collection
5. Scale-free networks generated by random walkers10.1016/j.physa.2004.04.110 ↗
6. Modeling network growth under resource constraints
7. Average path length estimation of social networks by random walk
8. Community detection and mining using complex networks tools in social internet of things
9. Hotspots analysis using cyber-physical-social system for a smart city10.1109/ACCESS.2020.3003030 ↗
10. A new method for link prediction using various features in social networks
11. Link prediction based on common-neighbors for dynamic social network10.1016/j.procs.2016.04.102 ↗
12. Statistical mechanics of complex networks10.1103/RevModPhys.74.47 ↗
13. Towards trust and friendliness approaches in the social internet of things10.3390/app9010166 ↗
14. Collective dynamics of ‘small-world’ networks10.1038/30918 ↗
15. Exploiting small world problems in a SIoT environment10.3390/en11082089 ↗
16. The small-world phenomenon: An algorithmic perspective
17. An advanced algorithm for higher network navigation in social internet of things using small-world networks10.3390/s19092007 ↗
18. Epidemics and percolation in small-world networks10.1103/PhysRevE.61.5678 ↗
19. Classes of small-world networks10.1073/pnas.200327197 ↗
20. Diameter of the world-wide web10.1038/43601 ↗
21. Growing scale-free networks with small-world behavior10.1103/PhysRevE.65.057102 ↗
22. Emergence of scaling in random networks10.1126/science.286.5439.509 ↗
23. Energy-efficient clustering scheme for multihop wireless sensor network (ECMS)
24. Community detection based on social Influence in large scale networks
25. To study and analyse human behaviours on social networks
26. Practical recommendations on crawling online social networks10.1109/JSAC.2011.111011 ↗
27. Estimating clustering coefficients and size of social networks via random walk10.1145/2790304 ↗
28. Attack-resilient TLS certificate transparency10.1109/ACCESS.2020.2996997 ↗
29. Accountable and transparent TLS certificate management: An alternate public-key infrastructure with verifiable trusted parties10.1155/2018/8527010 ↗
30. 2-Hopper: Accurately estimate individual and social attributes of social networks with fewer repeats via random walk10.1109/ACCESS.2019.2942216 ↗
31. A local random walk method for identifying communities in social networks
32. Walking in facebook: A case study of unbiased sampling of OSNs
33. Calculating statistics of complex networks through random walks with an application to the on-line social network bebo10.1140/epjb/e2009-00292-2 ↗
34. Estimating and sampling graphs with multidimensional random walks
35. Estimating sizes of social networks via biased sampling
36. Evolution of the social network of scientific collaborations10.1016/S0378-4371(02)00736-7 ↗
37. Finding community structure in networks using the eigenvectors of matrices10.1103/PhysRevE.74.036104 ↗
38. Mixing patterns in networks10.1103/PhysRevE.67.026126 ↗
39. The web of human sexual contacts10.1038/35082140 ↗
40. On the evolution of random graphs
41. Growing small-world networks based on a modified BA model10.1088/0256-307X/23/3/062 ↗
42. Evolution of networks10.1080/00018730110112519 ↗
43. Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations10.1103/PhysRevE.67.056104 ↗
44. Realistic control of network dynamics10.1038/ncomms2939 ↗
45. Scale-free networks from self-organization10.1103/PhysRevE.72.026138 ↗
46. Random walk based fake account detection in online social networks
47. Inferring friendship from check-in data of location-based social networks
48. Co-occurrence prediction in a large location-based social network10.1007/s11704-013-3902-8 ↗
49. Estimating clustering coefficients and size of social networks via random walk10.1145/2790304 ↗
50. Estimating the clustering coefficient of a social network by a non-backtracking random walk
51. Efficient immunization strategies for computer networks and populations10.1103/PhysRevLett.91.247901 ↗
52. Graphs over time: Densification laws, shrinking diameters and possible explanations
53. Analysis of topological characteristics of huge online social networking services
54. Generating scale-free networks with adjustable clustering coefficient via random walks
55. Characterization of complex networks: A survey of measurements
56. Size-dependent degree distribution of a scale-free growing network
57. Construction of scale-free networks with adjustable clustering
58. Exploring network structure, dynamics, and function using networkX
59. Scale-free networks generated by random walkers10.1016/j.physa.2004.04.110 ↗
60. Tuning clustering in random networks with arbitrary degree distributions