A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In this paper, we propose that when a random network graph model that prefers to close two-hop chains and transform them to triangles as part of link formation. We hypothesize that such a model would generate random network graphs with high clustering coefficients and a larger variation in node degree, compared to that of the well-known Erdos-Renyi (ER) model. We refer to the proposed model as two-hop neighbor preference (THNP)-model that prefers to pair a node with any of its two-hop neighborsdoi:10.14257/ijca.2016.9.1.15 fatcat:enlw3dthfrghfoaii7pjicwb7a