Bayesian exponential random graph models with nodal random effects

We extend the well-known and widely used exponential random graph model (ERGM) by including nodal random effects to compensate for heterogeneity in the nodes of a network. The Bayesian framework for ERGMs proposed by Caimo and Friel (2011) yields the basis of our modelling algorithm. A central question in network models is the question of model selection and following the Bayesian paradigm we focus on estimating Bayes factors. To do so we develop an approximate but feasible calculation of the Bayes factor which allows one to pursue model selection. Three data examples and a small simulation study illustrate our mixed model approach and the corresponding model selection.     

The Statistical Evaluation of Social Network Dynamics

A class of statistical models is proposed for longitudinal network data. The dependent variable is the changing (or evolving) relation network, represented by two or more observations of a directed graph with a fixed set of actors. The network evolution is modeled as the consequence of the actors making new choices, or withdrawing existing choices, on the basis of functions, with fixed and random components, that the actors try to maximize. Individual and dyadic exogenous variables can be used as covariates. The change in the network is modeled as the stochastic result of network effects (reciprocity, transitivity, etc.) and these covariates. The existing network structure is a dynamic constraint for the evolution of the structure itself. The models are continuous-time Markov chain models that can be implemented as simulation models. The model parameters are estimated from observed data. For estimating and testing these models, statistical procedures are proposed that are based on the method of moments. The statistical procedures are implemented using a stochastic approximation algorithm based on computer simulations of the network evolution process.     

Spectral goodness of fit for network models

We introduce a new statistic, ‘spectral goodness of fit’ (SGOF) to measure how well a network model explains the structure of the pattern of ties in an observed network. SGOF provides a measure of fit analogous to the standard R² in linear regression. Additionally, as it takes advantage of the properties of the spectrum of the graph Laplacian, it is suitable for comparing network models of diverse functional forms, including both fitted statistical models and algorithmic generative models of networks. After introducing, defining, and providing guidance for interpreting SGOF, we illustrate the properties of the statistic with a number of examples and comparisons to existing techniques. We show that such a spectral approach to assessing model fit fills gaps left by earlier methods and can be widely applied.     

Latent Class Marginal Models for Cross-Classifications of Counts

The standard latent class model is a finite mixture of indirectly observed multinomial distributions, each of which is assumed to exhibit statistical independence. Latent class analysis has been applied in a wide variety of research contexts, including studies of mobility, educational attainment, agreement, and diagnostic accuracy, and as measurement error models in social research. One of the attractive features of the latent class model in these settings is that the parameters defining the individual multinomials are readily interpretable marginal probabilities, conditional on the unobserved latent variable(s), that are often of substantive interest. There are, however, settings where the local-independence axiom is not supported, and hence it is useful to consider some form of local dependence. In this paper we consider a family of models defined in terms of finite mixtures of multinomial models where the multinomials are parameterized in terms of a set of models for the univariate marginal distributions and for marginal associations. Local dependence is introduced through the models for marginal associations, and the standard latent class model obtains as a special case. Three examples are analyzed with the models to illustrate their utility in analyzing complex cross-classifications.     

MULTIPLE IMPUTATION OF INCOMPLETE CATEGORICAL DATA USING LATENT CLASS ANALYSIS

We propose using latent class analysis as an alternative to log-linear analysis for the multiple imputation of incomplete categorical data. Similar to log-linear models, latent class models can be used to describe complex association structures between the variables used in the imputation model. However, unlike log-linear models, latent class models can be used to build large imputation models containing more than a few categorical variables. To obtain imputations reflecting uncertainty about the unknown model parameters, we use a nonparametric bootstrap procedure as an alternative to the more common full Bayesian approach. The proposed multiple imputation method, which is implemented in Latent GOLD software for latent class analysis, is illustrated with two examples. In a simulated data example, we compare the new method to well-established methods such as maximum likelihood estimation with incomplete data and multiple imputation using a saturated log-linear model. This example shows that the proposed method yields unbiased parameter estimates and standard errors. The second example concerns an application using a typical social sciences data set. It contains 79 variables that are all included in the imputation model. The proposed method is especially useful for such large data sets because standard methods for dealing with missing data in categorical variables break down when the number of variables is so large.     

Strategy formulation in nonprofit social services organizations: A proposed framework social services organizations

This article proposes a framework for determining strategies in nonprofit social services organizations. A review of the literature concerning strategy choice models is combined with an analysis of the unique characteristics of nonprofit social services organizations to develop the proposed framework, which improves on existing models by encompassing a wider array of strategic factors and being applicable to a wide variety of nonprofit organizations. The author provides examples of the model's applications, discusses the usefulness and limitations of the model, and concludes with suggestions for future research.     

Recent developments in exponential random graph (p*) models for social networks

This article reviews new specifications for exponential random graph models proposed by Snijders et al. [Snijders, T.A.B., Pattison, P., Robins, G.L., Handcock, M., 2006. New specifications for exponential random graph models. Sociological Methodology] and demonstrates their improvement over homogeneous Markov random graph models in fitting empirical network data. Not only do the new specifications show improvements in goodness of fit for various data sets, but they also help to avoid the problem of near-degeneracy that often afflicts the fitting of Markov random graph models in practice, particularly to network data exhibiting high levels of transitivity. The inclusion of a new higher order transitivity statistic allows estimation of parameters of exponential graph models for many (but not all) cases where it is impossible to estimate parameters of homogeneous Markov graph models. The new specifications were used to model a large number of classical small-scale network data sets and showed a dramatically better performance than Markov graph models. We also review three current programs for obtaining maximum likelihood estimates of model parameters and we compare these Monte Carlo maximum likelihood estimates with less accurate pseudo-likelihood estimates. Finally, we discuss whether homogeneous Markov random graph models may be superseded by the new specifications, and how additional elaborations may further improve model performance.     

Change we can believe in: Comparing longitudinal network models on consistency,interpretability and predictive power

While several models for analysing longitudinal network data have been proposed, their main differences, especially regarding the treatment of time, have not been discussed extensively in the literature. However, differences in treatment of time strongly impact the conclusions that can be drawn from data. In this article we compare auto-regressive network models using the example of TERGMs – a temporal extensions of ERGMs – and process-based models using SAOMs as an example. We conclude that the TERGM has, in contrast to the ERGM, no consistent interpretation on tie-level probabilities, as well as no consistent interpretation on processes of network change. Further, parameters in the TERGM are strongly dependent on the interval length between two time-points. Neither limitation is true for process-based network models such as the SAOM. Finally, both compared models perform poorly in out-of-sample prediction compared to trivial predictive models.     

Multilevel Latent Class Models

The latent class (LC) models that have been developed so far assume that observations are independent. Parametric and nonparametric random–coefficient LC models are proposed here, which will make it possible to modify this assumption. For example, the models can be used for the analysis of data collected with complex sampling designs, data with a multilevel structure, and multiple–group data for more than a few groups. An adapted EM algorithm is presented that makes maximum–likelihood estimation feasible. The new model is illustrated with examples from organizational, educational, and cross–national comparative research.     

A comparative study of social network models: Network evolution models and nodal attribute models

This paper reviews, classifies and compares recent models for social networks that have mainly been published within the physics-oriented complex networks literature. The models fall into two categories: those in which the addition of new links is dependent on the (typically local) network structure (network evolution models, NEMs), and those in which links are generated based only on nodal attributes (nodal attribute models, NAMs). An exponential random graph model (ERGM) with structural dependencies is included for comparison. We fit models from each of these categories to two empirical acquaintance networks with respect to basic network properties. We compare higher order structures in the resulting networks with those in the data, with the aim of determining which models produce the most realistic network structure with respect to degree distributions, assortativity, clustering spectra, geodesic path distributions, and community structure (subgroups with dense internal connections). We find that the nodal attribute models successfully produce assortative networks and very clear community structure. However, they generate unrealistic clustering spectra and peaked degree distributions that do not match empirical data on large social networks. On the other hand, many of the network evolution models produce degree distributions and clustering spectra that agree more closely with data. They also generate assortative networks and community structure, although often not to the same extent as in the data. The ERGM model, which turned out to be near-degenerate in the parameter region best fitting our data, produces the weakest community structure.     

Reinterpreting network measures for models of disease transmission

In the wake of AIDS and HIV, a better framework is needed to model the pattern of contacts between infectious and susceptible individuals. Several network measures have been defined elsewhere which quantify the distance between 2 nodes, and the centrality of a node, in a network. Stephenson and Zelen (S-Z), however, have recently presented a new measure based on statistical estimation theory and applied it to a network of AIDS cases. This paper shows that the closeness measure proposed by S-Z is equivalent to the effective conductance in an electrical network, fits the measure into the existing theory of percolation, and provides a more efficient algorithm for computing S-Z closeness. The S-Z methodology is compared with the closeness measures of maximal flow, first passage time, and random hitting time. Computational problems associated with the measure are discussed in a closing section.     

Conditionally exponential random models for individual properties and network structures: Method and application

Exponential random models have been widely adopted as a general probabilistic framework for complex networks and recently extended to embrace broader statistical settings such as dynamic networks, valued networks or two-mode networks. Our aim is to provide a further step into the generalization of this class of models by considering sample spaces which involve both families of networks and nodal properties verifying combinatorial constraints. We propose a class of probabilistic models for the joint distribution of nodal properties (demographic and behavioral characteristics) and network structures (friendship and professional partnership). It results in a general and flexible modeling framework to account for homophily in social structures. We present a Bayesian estimation method based on the full characterization of their sample spaces by systems of linear constraints. This provides an exact simulation scheme to sample from the likelihood, based on linear programming techniques. After a detailed analysis of the proposed statistical methodology, we illustrate our approach with an empirical analysis of co-authorship of journal articles in the field of neuroscience between 2009 and 2013.     

FOUR USEFUL FINITE MIXTURE MODELS FOR REGRESSION ANALYSES OF PANEL DATA WITH A CATEGORICAL DEPENDENT VARIABLE

This paper describes and contrasts two useful ways to employ a latent class variable as a mixture variable in regression analyses of panel data with a categorical dependent variable. One way is to model unobserved heterogeneity in the trajectory, or change in the distribution, of the dependent variable. Two models that accomplish this are the latent trajectory model and latent growth curve model for a categorical dependent variable having ordered categories. Each latent class here represents a distinct trajectory of the dependent variable. The latent trajectory model introduces covariate effects on the composition of latent classes, while the latent growth curve model introduces covariate effects on both the "intercept" and the "slope" of growth in logit, which may vary among latent classes.
The other useful way is to model unobserved heterogeneity in the state dependence of the dependent variable. Two models that accomplish this are introduced for a simultaneous analysis of response probability and response stability, and the latent class variable is employed to distinguish two latent populations that differ in the stability of responses over time. One of them is the switching multinomial logit model with a time-lagged dependent variable as its separation indicator, and the other is the mover-stayer regression model.
By applying these four models to empirical data, this paper demonstrates the usefulness of these models for panel-data analyses. Example programs for specifying these models based on the LEM program are also provided.     

Information communities: The network structure of communication

This study puts forward a variable clique overlap model for identifying information communities, or potentially overlapping subgroups of network actors among whom reinforced independent links ensure efficient communication. We posit that the average intensity of communication between related individuals in information communities is greater than in other areas of the network. Empirical tests show that the variable clique overlap model is indeed more effective in identifying groups of individuals that have strong internal relationships in communication networks relative to prior cohesive subgroup models; the pathways generated by such an arrangement of connections are particularly robust against disruptions of information transmission. Our findings extend the scope of network closure effects proposed by other researchers working with communication networks using social network methods and approaches, a tradition which emphasizes ties between organizations, groups, individuals, and the external environment.     

The evaluation and selection of adequate causal models: a compensatory education example

Procedures for ascertaining relative model adequacy in latent variable structural relations models are discussed. Under diverse methods of estimation, this determination may be assessed using the chi square goodness of fit statistic, incremental fit indices for covariance structure models, and latent variable coefficients of determination. An example from evaluation research is taken (cf. Magidson, 1977; Bentler & Woodward, 1978). Numerical sensitivity of parameter estimates under alternative model specifications is demonstrated. Interpretive implications based on these procedures are discussed in terms of parameter sensitivity to alternative model specifications.     

Exponential random graph models for multilevel networks

Modern multilevel analysis, whereby outcomes of individuals within groups take into account group membership, has been accompanied by impressive theoretical development (e.g. Kozlowski and Klein, 2000) and sophisticated methodology (e.g. Snijders and Bosker, 2012). But typically the approach assumes that links between groups are non-existent, and interdependence among the individuals derives solely from common group membership. It is not plausible that such groups have no internal structure nor they have no links between each other. Networks provide a more complex representation of interdependence. Drawing on a small but crucial body of existing work, we present a general formulation of a multilevel network structure. We extend exponential random graph models (ERGMs) to multilevel networks, and investigate the properties of the proposed models using simulations which show that even very simple meso effects can create structure at one or both levels. We use an empirical example of a collaboration network about French cancer research elites and their affiliations (0125 and 0120) to demonstrate that a full understanding of the network structure requires the cross-level parameters. We see these as the first steps in a full elaboration for general multilevel network analysis using ERGMs.     

Parameter estimation procedures for exponential-family random graph models on count-valued networks: A comparative simulation study

The exponential-family random graph models (ERGMs) have emerged as an important framework for modeling social networks for a wide variety of relational types. ERGMs for valued networks are less well-developed than their unvalued counterparts, and pose particular computational challenges. Network data with edge values on the non-negative integers (count-valued networks) is an important such case, with examples ranging from the magnitude of migration and trade flows between places to the frequency of interactions and encounters between individuals. Here, we propose an efficient parallelizable subsampled maximum pseudo-likelihood estimation (MPLE) scheme for count-valued ERGMs, and compare its performance with existing Contrastive Divergence (CD) and Monte Carlo Maximum Likelihood Estimation (MCMLE) approaches via a simulation study based on migration flow networks in two U.S. states. Our results suggest that edge value variance is a key factor in method performance, while network size mainly influences their relative merits in computational time. For small-variance networks, all methods perform well in point estimations while CD greatly overestimates uncertainties, and MPLE underestimates them for dependence terms; all methods have fast estimation for small networks, but CD and subsampled multi-core MPLE provides speed advantages as network size increases. For large-variance networks, both MPLE and MCMLE offer high-quality estimates of coefficients and their uncertainty, but MPLE is significantly faster than MCMLE; MPLE is also a better seeding method for MCMLE than CD, as the latter makes MCMLE more prone to convergence failure. The study suggests that MCMLE and MPLE should be the default approach to estimate ERGMs for small-variance and large-variance valued networks, respectively. We also offer further suggestions regarding choice of computational method for valued ERGMs based on data structure, available computational resources and analytical goals.     

USING INSTRUMENTAL VARIABLE TESTS TO EVALUATE MODEL SPECIFICATION IN LATENT VARIABLE STRUCTURAL EQUATION MODELS

Structural equation modeling (SEM) with latent variables is a powerful tool for social and behavioral scientists, combining many of the strengths of psychometrics and econometrics into a single framework. The most common estimator for SEM is the full-information maximum likelihood (ML) estimator, but there is continuing interest in limited information estimators because of their distributional robustness and their greater resistance to structural specification errors. However, the literature discussing model fit for limited information estimators for latent variable models is sparse compared with that for full-information estimators. We address this shortcoming by providing several specification tests based on the 2SLS estimator for latent variable structural equation models developed by Bollen (1996) . We explain how these tests can be used not only to identify a misspecified model but to help diagnose the source of misspecification within a model. We present and discuss results from a Monte Carlo experiment designed to evaluate the finite sample properties of these tests. Our findings suggest that the 2SLS tests successfully identify most misspecified models, even those with modest misspecification, and that they provide researchers with information that can help diagnose the source of misspecification.     

MEANINGFUL REGRESSION AND ASSOCIATION MODELS FOR CLUSTERED ORDINAL DATA

Many proposed methods for analyzing clustered ordinal data focus on the regression model and consider the association structure within a cluster as a nuisance. However, the association structure is often of equal interest—for example, temporal association in longitudinal studies and association between responses to similar questions in a survey. We discuss the use, appropriateness, and interpretability of various latent variable and Markov models for the association structure and propose a new structure that exploits the ordinality of the response. The models are illustrated with a study concerning opinions regarding government spending and an analysis of stability and change in teenage marijuana use over time, where we reveal different behavioral patterns for boys and girls through a comprehensive investigation of individual response profiles.