A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Estimating Clustering Coefficients and Size of Social Networks via Random Walk
2015
ACM Transactions on the Web
Online social networks have become a major force in today's society and economy. The largest of today's social networks may have hundreds of millions to more than a billion users. Such networks are too large to be downloaded or stored locally, even if terms of use and privacy policies were to permit doing so. This limitation complicates even simple computational tasks. One such task is computing the clustering coefficient of a network. Another task is to compute the network * Research was
doi:10.1145/2790304
fatcat:5w3wwkxbcfecrlizm442mhzsr4