Estimating Clustering Coefficients and Size of Social Networks via Random Walk

Liran Katzir, Stephen J. Hardiman
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
more » ... ted while the author was unaffiliated. Copyright is held by the International World Wide Web Conference Committee (IW3C2). IW3C2 reserves the right to provide a hyperlink to the author's site if the Material is used in electronic media.
doi:10.1145/2790304 fatcat:5w3wwkxbcfecrlizm442mhzsr4