Block Modeling

Overview•Social life can be described (at least in part) through social roles.•To the extent that roles can be characterized by regular interaction patterns, we can summarize roles through common relational patterns.•Identifying these sets is the goal of block-model analyses.

Nadel: The Coherence of Role Systems•Background ideas for White, Boorman and Brieger. Social life as interconnected system of roles•Important feature: thinking of roles as connected in a role system = social structure

White, Boorman and Breiger: Social structure from Multiple Networks I. Blockmodels of Roles and Positions

•The key article describing the theoretical and technical elements of block-modeling

Nadel: The Coherence of Role Systems

Elements of a Role:

Rights and obligations with respect to other people or classes of people

Roles require a ‘role compliment’ another person who the role-occupant acts with respect to

Examples:Parent - child, Teacher - student, Lover - lover, Friend - Friend,

Husband - Wife, etc.

Nadel (Following functional anthropologists and sociologists) defines ‘logical’ types of roles, and then examines how they can be linked together.

Nadel describes role patterns in book. In the chapter we read, he focuses on how these various roles fit together to form a coherent whole. Roles are collected in people through the ‘summation of roles”

Necessary:Some roles fit together necessarily. For example, the expected

interaction patterns of “son-in-law” are implied through the joint roles of “Husband” and “Spouse-Parent”

Coincidental:Some roles tend to go together empirically, but they need not

(businessman & club member, for example).

Distinguishing the two is a matter of usefulness and judgement, but relates to social substitutability. The distinction reverts to how the system as a whole will be held together in the face of changes in role occupants.

Nadel: The Coherence of Role Systems

Nadel: The Coherence of Role Systems

Given that roles can be identified as ‘going together’ is there a logic that underlies their connection? Nadel uses a functional description based on ascription and achievement:

Nadel: The Coherence of Role Systems

And he gives an example of a simple role system:

Nadel’s task is to make sense of these roles, to identify how they are interconnected to form a system -- a coherent structure.

This is a difficult task to do analytically, as the eventual failure of Parsonian functionalism shows.

White et al: From logical role systems to empirical social structures

With the fall of parsons and functionalism in the late 60s, many of the ideas about social structure and system were also tossed. White et al demonstrate how we can understand social structure as the intercalation of roles, without the a priori logical categories.

Start with some basic ideas of what a role is: An exchange of something (support, ideas, commands, etc) between actors. Thus, we might represent a family as:

Start with some basic ideas of what a role is: An exchange of something (support, ideas, commands, etc) between actors. Thus, we might represent a family as:

H W

C

C

C

Provides food for

Romantic Love

Bickers with(and there are, of course, many other relations inside the family)

White et al: From logical role systems to empirical social structures

White et al: From logical role systems to empirical social structures

The key idea, is that we can express a role through a relation (or set of relations) and thus a social system by the inventory of roles. If roles equate to positions in an exchange system, then we need only identify particular aspects of a position. But what aspect?

Structural Equivalence

Two actors are structurally equivalent if they have the same types of ties to the same people.

Structural Equivalence

A single relation

Structural Equivalence

Graph reduced to positions

Alternative notions of equivalence

Instead of exact same ties to exact same alters, you look for nodes with similar ties to similar types of alters

Blockmodeling: basic steps

In any positional analysis, there are 4 basic steps:

1) Identify a definition of equivalence2) Measure the degree to which pairs of actors are equivalent3) Develop a representation of the equivalencies4) Assess the adequacy of the representation

1) Identify a definition of equivalence

Structural Equivalence: Two actors are equivalent if they have the same type of ties to the same people.

Automorphic Equivalence:Actors occupy indistinguishable structural locations in the network. That

is, that they are in isomorphic positions in the network.

Two graphs are isomorphic if there is some mapping of nodes to positions that equates the two. For example, all 030T triads are isomorphic.

A graph is automorphic, if there are patterns internal to the graph that are equated (if the mapping goes from the set of nodes in the graph to other nodes in the graph).

In general, automorphically equivalent nodes are equivalent with respect to all graph theoretic properties (I.e. degree, number of people reachable, centrality, etc.)

1) Identify a definition of equivalence

Automorphic Equivalence:

Regular Equivalence:Regular equivalence does not require actors to have

identical ties to identical actors or to be structurally indistinguishable.

Actors who are regularly equivalent have identical ties to and from equivalent actors.

If actors i and j are regularly equivalent, then for all relations and for all actors, if i k, then there exists some actor l such that j l and k is regularly equivalent to l.

1) Identify a definition of equivalence

Regular Equivalence:

There may be multiple regular equivalence partitions in a network, and thus we tend to want to find the maximal regular equivalence position, the one with the fewest positions.

Role or Local Equivalence:While most equivalence measures focus on position within the full

network, some measures focus only on the patters within the local tie neighborhood. These have been called ‘local role’ equivalence. In the example we’ve been using, they revert to automorphic equivalence

Note that:Structurally equivalent actors are automorphically equivalent,Automorphically equivalent actors are regularly equivalent.

Structurally equivalent and automorphically equivalent actors are role equivalent

In practice, we tend to ignore some of these fine distinctions, as they get blurred quickly once we have to operationalize them in real graphs. It turns out that few people are ever exactly equivalent, and thus we approximate the links between the types.

In all cases, the procedure can work over multiple relations simultaneously.

The process of identifying positions is called blockmodeling, and requires identifying a measure of similarity among nodes.

0 1 1 1 0 0 0 0 0 0 0 0 0 01 0 0 0 1 1 0 0 0 0 0 0 0 01 0 0 1 0 0 1 1 1 1 0 0 0 01 0 1 0 0 0 1 1 1 1 0 0 0 00 1 0 0 0 1 0 0 0 0 1 1 1 10 1 0 0 1 0 0 0 0 0 1 1 1 10 0 1 1 0 0 0 0 0 0 0 0 0 00 0 1 1 0 0 0 0 0 0 0 0 0 00 0 1 1 0 0 0 0 0 0 0 0 0 00 0 1 1 0 0 0 0 0 0 0 0 0 00 0 0 0 1 1 0 0 0 0 0 0 0 00 0 0 0 1 1 0 0 0 0 0 0 0 00 0 0 0 1 1 0 0 0 0 0 0 0 00 0 0 0 1 1 0 0 0 0 0 0 0 0

Blockmodeling is the process of identifying these types of positions. A block is a section of the adjacency matrix - a “group” of people.

Here I have blocked structurally equivalent actors

. 1 1 1 0 0 0 0 0 0 0 0 0 01 . 0 0 1 1 0 0 0 0 0 0 0 01 0 . 1 0 0 1 1 1 1 0 0 0 01 0 1 . 0 0 1 1 1 1 0 0 0 00 1 0 0 . 1 0 0 0 0 1 1 1 10 1 0 0 1 . 0 0 0 0 1 1 1 10 0 1 1 0 0 . 0 0 0 0 0 0 00 0 1 1 0 0 0 . 0 0 0 0 0 00 0 1 1 0 0 0 0 . 0 0 0 0 00 0 1 1 0 0 0 0 0 . 0 0 0 00 0 0 0 1 1 0 0 0 0 . 0 0 00 0 0 0 1 1 0 0 0 0 0 . 0 00 0 0 0 1 1 0 0 0 0 0 0 . 00 0 0 0 1 1 0 0 0 0 0 0 0 .

1 2 3 4 5 61 0 1 1 0 0 02 1 0 0 1 0 03 1 0 1 0 1 04 0 1 0 1 0 1 5 0 0 1 0 0 06 0 0 0 1 0 0

Once you block the matrix, reduce it, based on the number of ties in the cell of interest. The key values are a zero block (no ties) and a one-block (all ties present):

Structural equivalence thus generates 6 positions in the network

1 2 3 4 5 6

12

3

4

5

6

. 1 1 1 0 0 0 0 0 0 0 0 0 01 . 0 0 1 1 0 0 0 0 0 0 0 01 0 . 1 0 0 1 1 1 1 0 0 0 01 0 1 . 0 0 1 1 1 1 0 0 0 00 1 0 0 . 1 0 0 0 0 1 1 1 10 1 0 0 1 . 0 0 0 0 1 1 1 10 0 1 1 0 0 . 0 0 0 0 0 0 00 0 1 1 0 0 0 . 0 0 0 0 0 00 0 1 1 0 0 0 0 . 0 0 0 0 00 0 1 1 0 0 0 0 0 . 0 0 0 00 0 0 0 1 1 0 0 0 0 . 0 0 00 0 0 0 1 1 0 0 0 0 0 . 0 00 0 0 0 1 1 0 0 0 0 0 0 . 00 0 0 0 1 1 0 0 0 0 0 0 0 .

1 2 31 1 1 02 1 1 1 3 0 1 0

Once you partition the matrix, reduce it:

Regular equivalence

1 2

3

(here I placed a one in the image matrix if there were any ties in the ij block)

To get a block model, you have to measure the similarity between each pair. If two actors are structurally equivalent, then they will have exactly similar patterns of ties to other people. Consider the example again:

. 1 1 1 0 0 0 0 0 0 0 0 0 01 . 0 0 1 1 0 0 0 0 0 0 0 01 0 . 1 0 0 1 1 1 1 0 0 0 01 0 1 . 0 0 1 1 1 1 0 0 0 00 1 0 0 . 1 0 0 0 0 1 1 1 10 1 0 0 1 . 0 0 0 0 1 1 1 10 0 1 1 0 0 . 0 0 0 0 0 0 00 0 1 1 0 0 0 . 0 0 0 0 0 00 0 1 1 0 0 0 0 . 0 0 0 0 00 0 1 1 0 0 0 0 0 . 0 0 0 00 0 0 0 1 1 0 0 0 0 . 0 0 00 0 0 0 1 1 0 0 0 0 0 . 0 00 0 0 0 1 1 0 0 0 0 0 0 . 00 0 0 0 1 1 0 0 0 0 0 0 0 .

1 2 3 4 5 6

12

3

4

5

6

C D1 10 0. 11 .0 00 01 11 11 11 10 00 00 00 0

C and D match on 12 other people

If the model is going to be based on asymmetric or multiple relations, you simply stack the various relations:

H W

CC

C

Provides food for

Romantic Love

Bickers with

Romance0 1 0 0 01 0 0 0 00 0 0 0 00 0 0 0 00 0 0 0 0

Feeds0 0 1 1 10 0 1 1 10 0 0 0 00 0 0 0 00 0 0 0 0

Bicker0 0 0 0 00 0 0 0 00 0 0 1 10 0 1 0 00 0 1 1 0

0 1 0 0 01 0 0 0 00 0 0 0 00 0 0 0 00 0 0 0 00 0 1 1 10 0 1 1 10 0 0 0 00 0 0 0 00 0 0 0 00 0 0 0 00 0 0 0 01 1 0 0 01 1 0 0 01 1 0 0 00 0 0 0 00 0 0 0 00 0 0 1 10 0 1 0 00 0 1 1 0

Stacked

0 8 7 7 5 5 11 11 11 11 7 7 7 7 8 0 5 5 7 7 7 7 7 7 11 11 11 11 7 5 0 12 0 0 8 8 8 8 4 4 4 4 7 5 12 0 0 0 8 8 8 8 4 4 4 4 5 7 0 0 0 12 4 4 4 4 8 8 8 8 5 7 0 0 12 0 4 4 4 4 8 8 8 811 7 8 8 4 4 0 12 12 12 8 8 8 811 7 8 8 4 4 12 0 12 12 8 8 8 811 7 8 8 4 4 12 12 0 12 8 8 8 811 7 8 8 4 4 12 12 12 0 8 8 8 8 7 11 4 4 8 8 8 8 8 8 0 12 12 12 7 11 4 4 8 8 8 8 8 8 12 0 12 12 7 11 4 4 8 8 8 8 8 8 12 12 0 12 7 11 4 4 8 8 8 8 8 8 12 12 12 0

For the entire matrix, we get:

(number of agreements for each ij pair)

1.00 -0.20 0.08 0.08 -0.19 -0.19 0.77 0.77 0.77 0.77 -0.26 -0.26 -0.26 -0.26-0.20 1.00 -0.19 -0.19 0.08 0.08 -0.26 -0.26 -0.26 -0.26 0.77 0.77 0.77 0.77 0.08 -0.19 1.00 1.00 -1.00 -1.00 0.36 0.36 0.36 0.36 -0.45 -0.45 -0.45 -0.45 0.08 -0.19 1.00 1.00 -1.00 -1.00 0.36 0.36 0.36 0.36 -0.45 -0.45 -0.45 -0.45-0.19 0.08 -1.00 -1.00 1.00 1.00 -0.45 -0.45 -0.45 -0.45 0.36 0.36 0.36 0.36-0.19 0.08 -1.00 -1.00 1.00 1.00 -0.45 -0.45 -0.45 -0.45 0.36 0.36 0.36 0.36 0.77 -0.26 0.36 0.36 -0.45 -0.45 1.00 1.00 1.00 1.00 -0.20 -0.20 -0.20 -0.20 0.77 -0.26 0.36 0.36 -0.45 -0.45 1.00 1.00 1.00 1.00 -0.20 -0.20 -0.20 -0.20 0.77 -0.26 0.36 0.36 -0.45 -0.45 1.00 1.00 1.00 1.00 -0.20 -0.20 -0.20 -0.20 0.77 -0.26 0.36 0.36 -0.45 -0.45 1.00 1.00 1.00 1.00 -0.20 -0.20 -0.20 -0.20-0.26 0.77 -0.45 -0.45 0.36 0.36 -0.20 -0.20 -0.20 -0.20 1.00 1.00 1.00 1.00-0.26 0.77 -0.45 -0.45 0.36 0.36 -0.20 -0.20 -0.20 -0.20 1.00 1.00 1.00 1.00-0.26 0.77 -0.45 -0.45 0.36 0.36 -0.20 -0.20 -0.20 -0.20 1.00 1.00 1.00 1.00-0.26 0.77 -0.45 -0.45 0.36 0.36 -0.20 -0.20 -0.20 -0.20 1.00 1.00 1.00 1.00

The metric used to measure structural equivalence by White, Boorman and Brieger is the correlation between each node’s set of ties. For the example, this would be:

Another common metric is the Euclidean distance between pairs of actors, which you then use in a standard cluster analysis.

The initial method for finding structurally equivalent positions was CONCOR, the CONvergence of iterated CORrelations.

1.00 -.77 0.55 0.55 -.57 -.57 0.95 0.95 0.95 0.95 -.75 -.75 -.75 -.75-.77 1.00 -.57 -.57 0.55 0.55 -.75 -.75 -.75 -.75 0.95 0.95 0.95 0.950.55 -.57 1.00 1.00 -1.0 -1.0 0.73 0.73 0.73 0.73 -.75 -.75 -.75 -.750.55 -.57 1.00 1.00 -1.0 -1.0 0.73 0.73 0.73 0.73 -.75 -.75 -.75 -.75-.57 0.55 -1.0 -1.0 1.00 1.00 -.75 -.75 -.75 -.75 0.73 0.73 0.73 0.73-.57 0.55 -1.0 -1.0 1.00 1.00 -.75 -.75 -.75 -.75 0.73 0.73 0.73 0.730.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.770.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.770.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.770.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.77-.75 0.95 -.75 -.75 0.73 0.73 -.77 -.77 -.77 -.77 1.00 1.00 1.00 1.00-.75 0.95 -.75 -.75 0.73 0.73 -.77 -.77 -.77 -.77 1.00 1.00 1.00 1.00-.75 0.95 -.75 -.75 0.73 0.73 -.77 -.77 -.77 -.77 1.00 1.00 1.00 1.00-.75 0.95 -.75 -.75 0.73 0.73 -.77 -.77 -.77 -.77 1.00 1.00 1.00 1.00

Concor iteration 1:

Concor iteration 2:1.00 -.99 0.94 0.94 -.94 -.94 0.99 0.99 0.99 0.99 -.99 -.99 -.99 -.99-.99 1.00 -.94 -.94 0.94 0.94 -.99 -.99 -.99 -.99 0.99 0.99 0.99 0.990.94 -.94 1.00 1.00 -1.0 -1.0 0.97 0.97 0.97 0.97 -.97 -.97 -.97 -.970.94 -.94 1.00 1.00 -1.0 -1.0 0.97 0.97 0.97 0.97 -.97 -.97 -.97 -.97-.94 0.94 -1.0 -1.0 1.00 1.00 -.97 -.97 -.97 -.97 0.97 0.97 0.97 0.97-.94 0.94 -1.0 -1.0 1.00 1.00 -.97 -.97 -.97 -.97 0.97 0.97 0.97 0.970.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.990.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.990.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.990.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.99-.99 0.99 -.97 -.97 0.97 0.97 -.99 -.99 -.99 -.99 1.00 1.00 1.00 1.00-.99 0.99 -.97 -.97 0.97 0.97 -.99 -.99 -.99 -.99 1.00 1.00 1.00 1.00-.99 0.99 -.97 -.97 0.97 0.97 -.99 -.99 -.99 -.99 1.00 1.00 1.00 1.00-.99 0.99 -.97 -.97 0.97 0.97 -.99 -.99 -.99 -.99 1.00 1.00 1.00 1.00

The initial method for finding structurally equivalent positions was CONCOR, the CONvergence of iterated CORrelations.

1.00 -1.0 1.00 1.00 -1.0 -1.0 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0-1.0 1.00 -1.0 -1.0 1.00 1.00 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.001.00 -1.0 1.00 1.00 -1.0 -1.0 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.01.00 -1.0 1.00 1.00 -1.0 -1.0 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0-1.0 1.00 -1.0 -1.0 1.00 1.00 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00-1.0 1.00 -1.0 -1.0 1.00 1.00 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.001.00 -1.0 1.00 1.00 -1.0 -1.0 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.01.00 -1.0 1.00 1.00 -1.0 -1.0 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.01.00 -1.0 1.00 1.00 -1.0 -1.0 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.01.00 -1.0 1.00 1.00 -1.0 -1.0 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0-1.0 1.00 -1.0 -1.0 1.00 1.00 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00-1.0 1.00 -1.0 -1.0 1.00 1.00 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00-1.0 1.00 -1.0 -1.0 1.00 1.00 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00-1.0 1.00 -1.0 -1.0 1.00 1.00 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00

Concor iteration 3:

The initial method for finding structurally equivalent positions was CONCOR, the CONvergence of iterated CORrelations.

Concor iteration 3:1.00 1.00 1.00 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.01.00 1.00 1.00 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.01.00 1.00 1.00 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.01.00 1.00 1.00 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.01.00 1.00 1.00 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.01.00 1.00 1.00 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.01.00 1.00 1.00 1.00 1.00 1.00 1.00 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0-1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00 1.00 1.00 1.00-1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00 1.00 1.00 1.00-1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00 1.00 1.00 1.00-1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00 1.00 1.00 1.00-1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00 1.00 1.00 1.00-1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00 1.00 1.00 1.00-1.0 -1.0 -1.0 -1.0 -1.0 -1.0 -1.0 1.00 1.00 1.00 1.00 1.00 1.00 1.00

1347891025611121314

The initial method for finding structurally equivalent positions was CONCOR, the CONvergence of iterated CORrelations.

Repeat the process on the resulting 1-blocks until you have reached structural equivalent blocks

Because CONCOR splits every sub-group into two groups, you get a partition tree that looks something like this:

Automorphic and Regular equivalence are more difficult to find, and require iteratively searching over possible class assignments for sets that have the same graph theoretic patterns. Usually start with a set of nodes defined as similar on a number of network measures, then look within these classes for automorphic equivalence classes.

A theoretically appealing method for finding structures that are very similar to regular equivalence, role equivalence, uses the triad census. Each node is involved in (n-1)(n-2)/2 triads, and occupies a particular position in each of these triads. These positions are summarized in the following figure:

003

012_S

012_E

012_I

102_D

102_I

021D_S

021D_E

021U_S

021U_E

021C_S

021C_B

021C_E

111D_S

111D_B

111D_E

111U_S

111U_B

111U_E

030T_S

030T_B

030T_E

030C

201_S

201_B

120D_S

120D_E

120U_S

120U_E

120C_S

120C_B

120C_E

210_S

210_B

210_B

300

Triadic Position Census: 36 Positions within 16 Directed TriadsIndicates the position.

36 36 10 10 10 10 43 43 43 43 43 43 43 43 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 020 20 41 41 41 41 14 14 14 14 14 14 14 14 9 9 11 11 11 11 12 12 12 12 12 12 12 12 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 010 10 1 1 1 1 8 8 8 8 8 8 8 8 2 2 10 10 10 10 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 5 5 5 5 1 1 1 1 1 1 1 1

Triad position vectors for the example network, resulting in 3 positions:

1.00 1.00 0.64 0.64 0.64 0.64 0.98 0.98 0.98 0.98 0.98 0.98 0.98 0.981.00 1.00 0.64 0.64 0.64 0.64 0.98 0.98 0.98 0.98 0.98 0.98 0.98 0.980.64 0.64 1.00 1.00 1.00 1.00 0.50 0.50 0.50 0.50 0.50 0.50 0.50 0.500.64 0.64 1.00 1.00 1.00 1.00 0.50 0.50 0.50 0.50 0.50 0.50 0.50 0.500.64 0.64 1.00 1.00 1.00 1.00 0.50 0.50 0.50 0.50 0.50 0.50 0.50 0.500.64 0.64 1.00 1.00 1.00 1.00 0.50 0.50 0.50 0.50 0.50 0.50 0.50 0.500.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.000.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.000.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.000.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.000.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.000.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.000.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.000.98 0.98 0.50 0.50 0.50 0.50 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00

Correlating each person’s triad position vector with each other persons results in the following table, which clearly shows the positions that are equivalent:

Moving from a similarity/distance matrix to a blockmodel: number of groups and determining blocks:

“An important decision in an analysis using CONCOR is how fine the partition should be; in other words, when should one stop splitting positions? Theory and the interpretability of the solution are the primary consideration in deciding how many positions to produce.” (W&F, p.378)

“In defining positions of actors, the ‘trick’ is to choose the point along the series that gives a useful and interpretable partition of the actors into equivalence classes.” (W&F p.383)

Once you have decided on a number of blocks, you need to determine what counts as a ‘one’ block or a ‘zero’ block. Usually this is a some function of the density of the resulting block.

General rules:“Fat Fit” Only put a one in blocks with all ones in the adjacency matrix“Lean Fit” Put a zero if all the cells are zero, else put a one“Density fit” If the average value of the cell is above a certain cutoff.

White, Boorman and Breiger used a ‘lean fit’ (zeroblock) rule for the examples in their paper:

An example: White et al, figure 1.Biomedical Specialty data:

White et al, figure 3.Biomedical Specialty data: Key to structure lies in zero blocks

The foundation of the block model rests on a set of 16 two-position blocks. White et al claim these are the tools you can use to interpret the role system

Changes over time. Two arguments:

a) that stable structures develop

b) that the global structure might be stable, even if the micro-structure is not.

(note that this is exactly what Bearman did with the protest data)

Compound Relations.

One of the most powerful tools in role analysis involves looking at role systems through compound relations.

A compound relation is formed by combining relations in single dimensions. The best example of compound relations come from kinship.

SiblingChild of

Sibling0 1 0 0 01 0 0 0 00 0 0 1 00 0 1 0 00 0 0 0 0

Child of0 0 1 1 00 0 0 0 10 0 0 0 00 0 0 0 00 0 0 0 0

x =

Nephew/Niece0 0 0 0 10 0 1 1 00 0 0 0 00 0 0 0 00 0 0 0 0

SC = SC

An example of compound relations can be found in W&F. This role table catalogues the compounds for two relations “Is boss of” and “Is on the same level as”

A real example:Relations among Italian families.

Marriage and economic ties

An example:Relations among Italian families.

Political and friendship ties