Skip to main content
eScholarship
Open Access Publications from the University of California

UCLA

UCLA Electronic Theses and Dissertations bannerUCLA

Exponential Family Random Network Models

Abstract

Random graphs, where the presence of connections between nodes are considered random variables, have wide applicability in the social sciences. Exponential- family Random Graph Models (ERGM) have shown themselves to be a useful class of models for representing complex social phenomena. We generalize ERGM by also modeling nodal attributes as random variates, thus creating a random model of the full network, which we call Exponential-family Random Network Models (ERNM). We demonstrate how this framework allows a new formulation for logistic regression in network data. We develop likelihood-based inference for the model in the case of a fully observed network and an MCMC algorithm to implement it.

We then develop a theory of inference for ERNM when only part of the net- work is observed, as well as specific methodology for missing data, including non- ignorable mechanisms for network-based sampling designs and for latent class models. We also consider contact tracing sampling designs which are of con- siderable importance to infectious disease epidemiology and public health. This culminates in a treatment of respondent driven sampling (RDS), which is a widely used link tracing design.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View