Edited by Peter J. Carrington
Edited by John Scott
Edited by Stanley Wasserman
Publisher: Cambridge University Press
Print Publication Year: 2005
Online Publication Date:June 2012
Chapter DOI: http://dx.doi.org/10.1017/CBO9780511811395.010
In this chapter, we discuss the importance of the concept of dependence in social network data. Dependence is usually treated as a technical statistical issue, but in the case of social networks, the type of dependencies that might be expected in the data reflect underlying social processes that generate network structures. Consequently, we argue that possible dependencies need to be thought about explicitly when modeling social networks. We present a hierarchy of increasingly more complex dependence assumptions and show how to represent these in terms of dependence graphs. We show how dependence graphs are used in exponential random graph (p*) models for social networks. The most commonly used dependence assumption for p* models is that of Markov random graphs, but we summarize new developments that introduce higher-order dependence structures, Markov assumptions constrained within social settings, and dependencies involving individual-level attributes. We conclude by conceptualizing our general approach in terms of social space, with different types of dependence structures construed as forms of abstract proximity between elements of that social space.
Social Phenomena, Networks, and Dependence
An event or process is a social phenomenon precisely because behaviors by the individuals involved are interrelated. The form of interrelation may be particularly complex. As Solomon Asch argued half a century ago, social phenomena have the reflexive quality of being psychologically represented in each of the participating individuals.