Adjusting for Network Size and Composition Effects in Exponential-Family Random Graph Models

Exponential-family random graph models (ERGMs) provide a principled way to model and simulate features common in human social networks, such as propensities for homophily and friend-of-a-friend triad closure. We show that, without adjustment, ERGMs preserve density as network size increases. Density invariance is often not appropriate for social networks. We suggest a simple modification based on an offset which instead preserves the mean degree and accommodates changes in network composition asymptotically. We demonstrate that this approach allows ERGMs to be applied to the important situation of egocentrically sampled data. We analyze data from the National Health and Social Life Survey (NHSLS).     

The state of decision support systems: A review

Many organisations are now realising that information technology can make a significant contribution to their operations. Recent developments in decision support software are such that the time may have come when information technology will contribute significantly to managerial decision-making. This paper considers these developments alongside the organisational issues involved in decision-making, and the current position of IT in many mature organisations. The conclusion is that the new range of decision support software, whilst opening up further areas for computerised decision support, is unlikely to compete successfully for corporate IT funds. Use of the new tools will be restricted to small, isolated applications.     

Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models

Social network data often involve transitivity, homophily on observed attributes, community structure, and heterogeneity of actor degrees. We propose a latent cluster random effects model to represent all of these features, and we develop Bayesian inference for it. The model is applicable to both binary and non-binary network data. We illustrate the model using two real datasets: liking between monks and coreaderships between Slovenian publications. We also apply it to two simulated network datasets with very different network structure but the same highly skewed degree sequence generated from a preferential attachment process. One has transitivity and community structure while the other does not. Models based solely on degree distributions, such as scale-free, preferential attachment and power-law models, cannot distinguish between these very different situations, but the latent cluster random effects model does.