A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
On the clustering property of the random intersection graphs
A random intersection graph mtlmcalG_V,W,p is induced from a random bipartite graph mtlmcalG^*_V,W,p with vertices classes mtlV, mtlW and the edges incident between mtlv in V and mtlw in W with probability mtlp. Two vertices in mtlV are considered to be connected with each other if both of them connect with some common vertices in mtlW. The clustering properties of the random intersection graph are investigated completely in this article. Suppose that the vertices number be mtlN = mabsV anddoi:10.34657/2840 fatcat:6gbflbpmfbgltndtrynkmjucdu