NDLI: Estimating Clustering Coefficients and Size of Social Networks via Random Walk

Please wait, while we are loading the content...

Estimating Clustering Coefficients and Size of Social Networks via Random Walk

Content Provider	ACM Digital Library
Author	Katzir, Liran Hardiman, Stephen J.
Copyright Year	2015
Abstract	This work addresses the problem of estimating social network measures. Specifically, the measures at hand are the network average and global clustering coefficients and the number of registered users. The algorithms at hand (1) assume no prior knowledge about the network and (2) access the network using only the publicly available interface. More precisely, this work provides (a) a unified approach for clustering coefficients estimation and (b) a new network size estimator. The unified approach for the clustering coefficients yields the first external access algorithm for estimating the global clustering coefficient. The new network size estimator offers improved accuracy compared to prior art estimators. Our approach is to view a social network as an undirected graph and use the public interface to retrieve a random walk. To estimate the clustering coefficient, the connectivity of each node in the random walk sequence is tested in turn. We show that the error drops exponentially in the number of random walk steps. For the network size estimation we offer a generalized view of prior art estimators that in turn yields an improved estimator. All algorithms are validated on several publicly available social network datasets.
Starting Page	1
Ending Page	20
Page Count	20
File Format	PDF
ISSN	15591131
e-ISSN	1559114X
DOI	10.1145/2790304
Volume Number	9
Issue Number	4
Journal	ACM Transactions on the Web (TWEB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-09-28
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Estimation Clustering coefficient Sampling Social network
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Estimating clustering coefficients and size of social networks via random walk

Estimating Clustering Coefficients and Size of Social Networks via Random Walk

Estimating clustering coefficients and size of social networks via random walk.

Inference in OSNs via Lightweight Partial Crawls

Estimating the Bot Population on Twitter via Random Walk Based Sampling

Random walk based biased sampling for data collection on communication networks

Sampling online social networks by random walk (2012)

Efficiently Estimating Motif Statistics of Large Networks

Random walk based node sampling in self-organizing networks

Estimating Clustering Coefficients and Size of Social Networks via Random Walk

Similar Documents

Estimating clustering coefficients and size of social networks via random walk

Estimating Clustering Coefficients and Size of Social Networks via Random Walk

Estimating clustering coefficients and size of social networks via random walk.

Inference in OSNs via Lightweight Partial Crawls

Estimating the Bot Population on Twitter via Random Walk Based Sampling

Random walk based biased sampling for data collection on communication networks

Sampling online social networks by random walk (2012)

Efficiently Estimating Motif Statistics of Large Networks

Random walk based node sampling in self-organizing networks

Estimating Clustering Coefficients and Size of Social Networks via Random Walk