Skip to main content Accessibility help
×
Hostname: page-component-8448b6f56d-cfpbc Total loading time: 0 Render date: 2024-04-25T05:59:07.324Z Has data issue: false hasContentIssue false

10 - Exponential Random Graph Model Extensions: Models for Multiple Networks and Bipartite Networks

Published online by Cambridge University Press:  05 April 2013

Dean Lusher
Affiliation:
Swinburne University of Technology, Victoria
Johan Koskinen
Affiliation:
University of Manchester
Garry Robins
Affiliation:
University of Melbourne
Get access

Summary

In previous chapters, we presented details of models for univariate one-mode network data. Exponential random graph models (ERGMs), however, can also be applied to other relational data types. In this chapter, we extend ERGM specifications to (1) multivariate analysis of two networks and (2) bipartite (or two-mode) networks. We discuss model specifications and possible parameter interpretations for both classes of models.

Multiple Networks

Social network analyses are not limited to one type of network, and it is often the case that more than one type of relational tie can be defined among a given set of nodes – for example, we can define both friendship and advice-giving ties among staff of an organization. When we have multiple network ties, we can then ask the research question about how different types of networks interact with each other, and how these interactions affect the structure of each network. For example, do friends seek advice from each other in the organization? We refer to the statistical analysis of multiple networks as “multivariate network analysis.”

Several techniques have been developed for the analysis of multiple networks, including blockmodels for multiple networks (White, Boorman, & Breiger, 1976), quadratic assignment procedures (Dekker, Krackhardt, & Snijders, 2007; Krackhardt, 1987), network algebraic models (Pattison, 1993), and ERGMs (Pattison & Wasserman, 1999). In this chapter, we focus on the simplest multivariate ERGM specifications for networks involving two types of ties defined on a common set of nodes.

Type
Chapter
Information
Exponential Random Graph Models for Social Networks
Theory, Methods, and Applications
, pp. 115 - 129
Publisher: Cambridge University Press
Print publication year: 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×