Exponential random graph models for multilevel networks

Peng Wang (1) , Garry Robins (1) , Philippa Pattison (1) , Emmanuel Lazega (2)

1 University of Melbourne
2 CSO - Centre de sociologie des organisations (Sciences Po, CNRS)

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.

Mots clés: Multilevel networks; Exponential random graph models

Domaines: Sociologie

Peng Wang, Garry Robins, Philippa Pattison, Emmanuel Lazega. Exponential random graph models for multilevel networks. Social Networks, 2013, 35 (1), pp.96 - 115. ⟨10.1016/j.socnet.2013.01.004⟩. ⟨hal-01521673⟩