scholarly journals Network sampling coverage III: Imputation of missing network data under different network and missing data conditions

2022 ◽  
Vol 68 ◽  
pp. 148-178
Author(s):  
Jeffrey A. Smith ◽  
Jonathan H. Morgan ◽  
James Moody
2017 ◽  
Vol 48 ◽  
pp. 78-99 ◽  
Author(s):  
Jeffrey A. Smith ◽  
James Moody ◽  
Jonathan H. Morgan

2018 ◽  
Author(s):  
Babak ◽  
Steven Rytina

The structure of social networks is usually inferred from limited sets of observations via suitable network sampling designs. In offline social network sampling, for practical considerations, researchers sometimes build in a cap on the number of social ties any respondent may claim. It is commonly known in the literature that using a cap on the degrees begets methodologically undesirable features because it discards information about the network connections. In this paper, we consider a mathematical model of this sampling procedure and seek analytical solutions to recover some of the lost information about the underlying network. We obtain closed-form expressions for several network statistics, including the first and second moments of the degree distribution, network density, number of triangles, and clustering. We corroborate the accuracy of these estimators via simulated and empirical network data. Our contribution highlights notable room for improvement in the analysis of some existing social network data sets.


2018 ◽  
Vol 49 (4) ◽  
pp. 1018-1063 ◽  
Author(s):  
Jeffrey A. Smith ◽  
Jessica Burow

Agent-based modeling holds great potential as an analytical tool. Agent-based models (ABMs) are, however, also vulnerable to critique, as they often employ stylized social worlds, with little connection to the actual environment in question. Given these concerns, there has been a recent call to more fully incorporate empirical data into ABMs. This article falls in this tradition, exploring the benefits of using sampled ego network data in ABMs of cultural diffusion. Thus, instead of relying on full network data, which can be difficult and costly to collect, or no empirical network data, which is convenient but not empirically grounded, we offer a middle-ground, one combining ABMs with recent work on network sampling. The main question is whether this approach is effective. We provide a test of the approach using six complete networks; the test also includes a range of diffusion models (where actors follow different rules of adoption). For each network, we take a random ego network sample and use that sample to infer the full network structure. We then run a diffusion model through the known, complete networks, as well as the inferred networks, and compare the results. The results, on the whole, are quite strong: Across all analyses, the diffusion curves based on the sampled data are very similar to the curves based on the true, complete network. This suggests that ego network sampling can, in fact, offer a practical means of incorporating empirical data into an agent-based model.


Author(s):  
Justin H. Gross ◽  
Joshua M. Jansa

Political phenomena are inherently relational, so it is natural that network analysis should come to play an important role in the study of politics. And yet relational data present special practical and methodological problems. The network data scholars would like to collect are often incomplete or altogether inaccessible. It is tempting to take whatever data are available and treat these as a proxy for the desired variables. This chapter reviews the most prominent relational concepts in political science and the operationalization strategies and data collection techniques typically employed. It then examines common practices for handling missing data and identifies recent innovations in this area. Finally, the chapter recommends that political scientists give more consideration to the concept development and measurement phases of research design and proposes possible directions for the development of network measurement models.


2015 ◽  
Vol 21 ◽  
pp. 301
Author(s):  
Armand Krikorian ◽  
Lily Peng ◽  
Zubair Ilyas ◽  
Joumana Chaiban

Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 42-47 ◽  
Author(s):  
Bonne J. H. Zijlstra ◽  
Marijtje A. J. van Duijn ◽  
Tom A. B. Snijders

The p 2 model is a random effects model with covariates for the analysis of binary directed social network data coming from a single observation of a social network. Here, a multilevel variant of the p 2 model is proposed for the case of multiple observations of social networks, for example, in a sample of schools. The multilevel p 2 model defines an identical p 2 model for each independent observation of the social network, where parameters are allowed to vary across the multiple networks. The multilevel p 2 model is estimated with a Bayesian Markov Chain Monte Carlo (MCMC) algorithm that was implemented in free software for the statistical analysis of complete social network data, called StOCNET. The new model is illustrated with a study on the received practical support by Dutch high school pupils of different ethnic backgrounds.


Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 7-15 ◽  
Author(s):  
Joachim Gerich ◽  
Roland Lehner

Although ego-centered network data provide information that is limited in various ways as compared with full network data, an ego-centered design can be used without the need for a priori and researcher-defined network borders. Moreover, ego-centered network data can be obtained with traditional survey methods. However, due to the dynamic structure of the questionnaires involved, a great effort is required on the part of either respondents (with self-administration) or interviewers (with face-to-face interviews). As an alternative, we will show the advantages of using CASI (computer-assisted self-administered interview) methods for the collection of ego-centered network data as applied in a study on the role of social networks in substance use among college students.


Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 24-33 ◽  
Author(s):  
Susan Shortreed ◽  
Mark S. Handcock ◽  
Peter Hoff

Recent advances in latent space and related random effects models hold much promise for representing network data. The inherent dependency between ties in a network makes modeling data of this type difficult. In this article we consider a recently developed latent space model that is particularly appropriate for the visualization of networks. We suggest a new estimator of the latent positions and perform two network analyses, comparing four alternative estimators. We demonstrate a method of checking the validity of the positional estimates. These estimators are implemented via a package in the freeware statistical language R. The package allows researchers to efficiently fit the latent space model to data and to visualize the results.


1979 ◽  
Vol 24 (8) ◽  
pp. 670-670
Author(s):  
FRANZ R. EPTING ◽  
ALVIN W. LANDFIELD
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document