Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53145#.VLXdcMnQrzE Author(s) Bilal Khan 1 , Kirk Dombrowski 2 , Ric Curtis 2 , Travis Wendel 3 Affiliation(s) 1 Department of Math and Computer Science, John Jay College (CUNY), New York, USA . 2 Department of Sociology, University of Nebraska-Lincoln, Lincoln, USA . 3 St. Ann’s Corner of Harm Reduction, Bronx, USA . ABSTRACT 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...
Scientific Research Publishing