Subsampling for Chain-Referral Methods

• Published in: Analytical and Stochastic Modelling Techniques and Applications Vol. 9845; pp. 17 - 31
• Main Authors: Avrachenkov, Konstantin, Neglia, Giovanni, Tuholukova, Alina
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Gibbs Distribution; Random Geometric Graph; Random Graph; Random Walk; Software Engineering; Synthetic Dataset
• ISBN: 3319439030; 9783319439037
• ISSN: 0302-9743; 1611-3349; 1611-3349
• DOI: 10.1007/978-3-319-43904-4_2

We study chain-referral methods for sampling in social networks. These methods rely on subjects of the study recruiting other participants among their set of connections. This approach gives us the possibility to perform sampling when the other methods, that imply the knowledge of the whole network or its global characteristics, fail. Chain-referral methods can be implemented with random walks or crawling in the case of online social networks. However, the estimations made on the collected samples can have high variance, especially with small sample size. The other drawback is the potential bias due to the way the samples are collected. We suggest and analyze a subsampling technique, where some users are requested only to recruit other users but do not participate to the study. Assuming that the referral has lower cost than actual participation, this technique takes advantage of exploring a larger variety of population, thus decreasing significantly the variance of the estimator. We test the method on real social networks and on synthetic ones. As by-product, we propose a Gibbs like method for generating synthetic networks with desired properties.