Estimating Vertex Measures in Social Networks by Sampling Completions of RDS Trees

• 作者: Bilal Khan Kirk Dombrowski Ric Curtis Travis Wendel
• 来源期刊: 社交网络(英文)
• 学科: 数学
• 关键词: Network IMPUTATION MISSING Data SPANNING Tree COMPLETIONS Respondent-Driven Sampling
• 年，卷（期）: 2015,（1）
• 页码范围: 1-16
• 页数: 16页
• 分类号: O1

摘要

This paper presents a new method for obtaining network properties from incomplete data sets. Problems associated with missing data represent well-known stumbling blocks in Social Network Analysis. The method of “estimating connectivity from spanning tree completions” (ECSTC) is specifically designed to address situations where only spanning tree(s) of a network are known, such as those obtained through respondent driven sampling (RDS). Using repeated random completions derived from degree information, this method forgoes the usual step of trying to obtain final edge or vertex rosters, and instead aims to estimate network-centric properties of vertices probabilistically from the spanning trees themselves. In this paper, we discuss the problem of missing data and describe the protocols of our completion method, and finally the results of an experiment where ECSTC was used to estimate graph dependent vertex properties from spanning trees sampled from a graph whose characteristics were known ahead of time. The results show that ECSTC methods hold more promise for obtaining network-centric properties of individuals from a limited set of data than researchers may have previously assumed. Such an approach represents a break with past strategies of working with missing data which have mainly sought means to complete the graph, rather than ECSTC’s approach, which is to estimate network properties themselves without deciding on the final edge set.