Skip to main content Accessibility help
×
Hostname: page-component-6d856f89d9-72csx Total loading time: 0 Render date: 2024-07-16T05:45:08.956Z Has data issue: false hasContentIssue false

13 - Random Graph Models

from Part V - Roles

Published online by Cambridge University Press:  05 June 2012

Wouter de Nooy
Affiliation:
Universiteit van Amsterdam
Andrej Mrvar
Affiliation:
University of Ljubljana
Vladimir Batagelj
Affiliation:
University of Ljubljana
Get access

Summary

Introduction

The main purpose of social network analysis is detecting and interpreting patterns of social ties among actors (Chapter 1). A pattern of social ties is meaningful if it expresses choices by social actors or the impact of the social system on actors’ behavior and attitudes. Until now, we have implicitly assumed that the observed network expresses choices or social constraint, although we have pointed out that our behavioral interpretations should be checked by comparing them with other indicators – for example, see the discussion on structural and social prestige in Chapter 9.

In the current chapter, we accept the idea that at least part of the structure of the observed network is random. As a consequence, we should not assume that every pattern found in a network is meaningful. Statistical inference should tell us whether a network characteristic is random. We do not use statistical inference in the classic sense, assuming that the observed network is a random sample from a larger network (design-based inference). For some basic network properties, statistical inference based on a random sample is possible, but that is not what we pursue here. Instead, we present statistical network models that tell us which network characteristics to expect if the lines are assigned to pairs of vertices according to a random process (model-based inference). This approach assumes that network structure could have been different; for example, the line between actors v and u (Figure 128, network C) could have been replaced by a line between v and w (Figure 128, network D), but not every network structure is necessarily equally probable.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2011

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
×