SlideShare a Scribd company logo
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. Social life as interconnected system of roles Important feature: thinking of roles as connected in a role system = social structure
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.
Coherence of Role Systems 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 .
Empirical social structures With the fall of  f unctionalism 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. Em pirical  role  is:  A set of relations signifying exchange of something (support, ideas, commands, etc) between actors.
Family Structure 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 (and there are, of course, many other relations inside the family) Romantic Love Bickers with
Generalization 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
Basic Steps: Blockmodeling In any positional analysis, there are 4 basic steps: 1) Identify a definition of equivalence 2) Measure the degree to which pairs of actors are equivalent 3) Develop a representation of the equivalencies 4) Assess the adequacy of the representation 5) Repeat and refine
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.  In general, automorphically equivalent nodes are equivalent with respect to  all graph theoretic properties  (I.e. degree, number of people reachable, centrality, etc.)
Automorphic 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 . Regular Equivalence i j k l
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.
Practicality 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 0 1 0 0 0 1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 1 1 1 0 0 0 0 1 0 1 0 0 0 1 1 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 0 1 0 0 1 0 0 0 0 0 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 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 0 1 . 0 0 1 1 0 0 0 0 0 0 0 0 1 0 . 1 0 0 1 1 1 1 0 0 0 0 1 0 1 . 0 0 1 1 1 1 0 0 0 0 0 1 0 0 . 1 0 0 0 0 1 1 1 1 0 1 0 0 1 . 0 0 0 0 1 1 1 1 0 0 1 1 0 0 . 0 0 0 0 0 0 0 0 0 1 1 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 1 1 0 0 0 0 0 0 . 0 0 0 0 0 1 1 0 0 0 0 0 0 0 . 1 2 3 4 5 6 1 0 1 1 0 0 0 2 1 0 0 1 0 0 3 1 0 1 0 1 0 4 0 1 0 1 0 1  5 0 0 1 0 0 0 6 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 1 2 3 4 5 6
. 1 1 1 0 0 0 0 0 0 0 0 0 0 1 . 0 0 1 1 0 0 0 0 0 0 0 0 1 0 . 1 0 0 1 1 1 1 0 0 0 0 1 0 1 . 0 0 1 1 1 1 0 0 0 0 0 1 0 0 . 1 0 0 0 0 1 1 1 1 0 1 0 0 1 . 0 0 0 0 1 1 1 1 0 0 1 1 0 0 . 0 0 0 0 0 0 0 0 0 1 1 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 1 1 0 0 0 0 0 0 . 0 0 0 0 0 1 1 0 0 0 0 0 0 0 . 1 2 3 1 1 1 0 2 1 1 1  3 0 1 0 Once you partition the matrix, reduce it: Regular equivalence 1 2 3
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 0 1 . 0 0 1 1 0 0 0 0 0 0 0 0 1 0 . 1 0 0 1 1 1 1 0 0 0 0 1 0 1 . 0 0 1 1 1 1 0 0 0 0 0 1 0 0 . 1 0 0 0 0 1 1 1 1 0 1 0 0 1 . 0 0 0 0 1 1 1 1 0 0 1 1 0 0 . 0 0 0 0 0 0 0 0 0 1 1 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 1 1 0 0 0 0 0 0 . 0 0 0 0 0 1 1 0 0 0 0 0 0 0 . 1 2 3 4 5 6 1 2 3 4 5 6 C D  Match 1   1  1 0   0  1 .  1  0 1  .  0 0   0  1 0   0  1 1   1  1  1   1  1  1   1  1 1   1  1 0   0  1 0   0  1 0   0  1 0   0  1 Sum:  12 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 C C C Provides food  for Romantic Love Bickers with Romance 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Feeds 0 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Bicker 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 0 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 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 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  8 11  7  8  8  4  4  0  12 12 12   8  8  8  8 11  7  8  8  4  4  12   0  12 12   8  8  8  8 11  7  8  8  4  4  12 12   0  12   8  8  8  8 11  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)
Measuring similarity 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 Correlation  between each node’s set of ties.  For the example, this would be:
The initial method for finding structurally equivalent positions was CONCOR, the CONvergence of iterated  COR relations.  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.95 0.55 -.57 1.00 1.00 -1.0 -1.0 0.73 0.73 0.73 0.73 -.75 -.75 -.75 -.75 0.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.73 0.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.77 0.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.77 0.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.77 0.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.99 0.94 -.94 1.00 1.00 -1.0 -1.0 0.97 0.97 0.97 0.97 -.97 -.97 -.97 -.97 0.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.97 0.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.99 0.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.99 0.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.99 0.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  COR relations.
Padget and Ansell: “ Robust Action and the Rise of the Medici” Substantive question relates to effective state-building: there is a tension between the need to control and organization and the ability to build the legitimacy and recognition required for reproduction. The distinction between “boss” and “judge” They use the marriage, economic and patronage networks Empirically, we know that the state oligarchy structure of Florence stabilized after the rise of the medici:
Padget and Ansell: “ Robust Action and the Rise of the Medici” Medici  Takeover
Padget and Ansell: “ Robust Action and the Rise of the Medici” The story they tell revolves around how Cosimo de’Medici was able to found a system that lasted nearly 300 years, uniting a fractured political structure. The paradox of Cosimo is that he didn’t  seem  to fit the role of a Machiavellian leader as decisive and goal oriented. The answer lies in the power resulting from ‘robust action’ embedded in a network of relations that gives rise to no  clear  meaning and obligation, but instead allows for  multiple  meanings and obligations.
A real example: Padget and Ansell: “ Robust Action and the Rise of the Medici” “ Political Groups” in the attribute sense do not seem to exist, so P&A turn to the pattern of network relations among families. This is the BLOCK reduction of the full 92 family network.
An example: Relations among Italian families. Political and friendship ties
Generalized Block Models The recent work on generalization focuses on the patterns that determine a block. Instead of focusing on just the  density  of a block, you can identify a block as any set that has a particular pattern of ties to any other set. Examples include:
Generalized Block Models
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.  Sibling Child of Sibling 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 Child of 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 x = Nephew/Niece 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 S  C = 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”

More Related Content

PPTX
Troubleshooting bifocals
PPTX
Visioary ophthalmology tbi presentation 9.7.14
PPTX
Special type of contact lens
PPT
Ordering of ophthalmic lens
PPTX
PPTX
Ophthalmic assistant
PPT
Slit Lamp Illumination Techniques
Troubleshooting bifocals
Visioary ophthalmology tbi presentation 9.7.14
Special type of contact lens
Ordering of ophthalmic lens
Ophthalmic assistant
Slit Lamp Illumination Techniques

What's hot (20)

PDF
Duane Retraction Syndrome
PPTX
Pal by nandini and jinal
PPTX
17 Optometrists role in school eye health programme.pptx
PDF
Five completely different methods of optical design
PPTX
Cylinder prescription guidelines
PPT
Orthokeratology_Refractive treatment
PPTX
04 prism
PPT
Magnification and it's clinical uses
PPTX
Prism.ppt
PPTX
Corneal topography
PDF
Understanding corneal-topography
PPT
Ophthalmic lens reflections & ARC
PPTX
A HISTORY OF CONTACT LENSES
PPTX
divergent squint.pptx
PPTX
Progressive addition lenses and brands
PPTX
RGP TORIC LENS presentation slideshow.pptx
PPTX
Optical aids for low vision patients : is it all we need to do ?
PPTX
METHODS OF PRESBYOPIC CORRECTION
PPTX
Astigmatism
Duane Retraction Syndrome
Pal by nandini and jinal
17 Optometrists role in school eye health programme.pptx
Five completely different methods of optical design
Cylinder prescription guidelines
Orthokeratology_Refractive treatment
04 prism
Magnification and it's clinical uses
Prism.ppt
Corneal topography
Understanding corneal-topography
Ophthalmic lens reflections & ARC
A HISTORY OF CONTACT LENSES
divergent squint.pptx
Progressive addition lenses and brands
RGP TORIC LENS presentation slideshow.pptx
Optical aids for low vision patients : is it all we need to do ?
METHODS OF PRESBYOPIC CORRECTION
Astigmatism
Ad

Similar to 6 Block Modeling (20)

PPTX
Social Network Analysis:Methods and Applications Chapter 9
DOC
PDF
Social Network Analysis [1994]
PDF
Social Network Analysis
PPTX
social.pptx
PDF
Public thesis defence: groups and reputation in social networks
PPT
PPT
Social Network Analysis
PDF
Prediction of Changes That May Occur in the Neutral Cases in Conflict Theory ...
PDF
Graph Algebra
PPTX
06 Regression with Networks – EGO Networks and Randomization (2017)
PDF
Social network-analysis-in-python
PDF
Mining Social Graph Data
PDF
Lecture 07 leonidas guibas - networks of shapes and images
PDF
Social Networks
DOC
Study on Impact of Media on Education Using Fuzzy Relational Maps
PPTX
UNIT-V.pptx-big data notes-ccs334anna university syllabus
PDF
Generating synthetic online social network graph data and topologies
PPTX
Matrix representation of graph
PDF
BCA_Semester-II-Discrete Mathematics_unit-ii_Relation and ordering
Social Network Analysis:Methods and Applications Chapter 9
Social Network Analysis [1994]
Social Network Analysis
social.pptx
Public thesis defence: groups and reputation in social networks
Social Network Analysis
Prediction of Changes That May Occur in the Neutral Cases in Conflict Theory ...
Graph Algebra
06 Regression with Networks – EGO Networks and Randomization (2017)
Social network-analysis-in-python
Mining Social Graph Data
Lecture 07 leonidas guibas - networks of shapes and images
Social Networks
Study on Impact of Media on Education Using Fuzzy Relational Maps
UNIT-V.pptx-big data notes-ccs334anna university syllabus
Generating synthetic online social network graph data and topologies
Matrix representation of graph
BCA_Semester-II-Discrete Mathematics_unit-ii_Relation and ordering
Ad

More from Maksim Tsvetovat (16)

PPT
PPT
15 Orgahead
PPT
14 Dynamic Networks
PPT
11 Strength Of Strong Ties
PPT
12 Cognitive Social Structure
PPT
5 Structural Holes
PPT
11 Contagion
PPT
6 Block Modeling
PPT
PPT
10 Strength Of Weak Ties
PPT
3 Centrality
PPT
PPT
5 Structural Holes
PPT
4 Cliques Clusters
PPT
1 Mechanics
PDF
2 Graph Theory
15 Orgahead
14 Dynamic Networks
11 Strength Of Strong Ties
12 Cognitive Social Structure
5 Structural Holes
11 Contagion
6 Block Modeling
10 Strength Of Weak Ties
3 Centrality
5 Structural Holes
4 Cliques Clusters
1 Mechanics
2 Graph Theory

Recently uploaded (20)

PPTX
PPT- ENG7_QUARTER1_LESSON1_WEEK1. IMAGERY -DESCRIPTIONS pptx.pptx
PDF
Module 4: Burden of Disease Tutorial Slides S2 2025
PPTX
IMMUNITY IMMUNITY refers to protection against infection, and the immune syst...
PDF
Classroom Observation Tools for Teachers
PPTX
Cell Types and Its function , kingdom of life
PDF
FourierSeries-QuestionsWithAnswers(Part-A).pdf
PPTX
GDM (1) (1).pptx small presentation for students
PPTX
Cell Structure & Organelles in detailed.
PDF
BÀI TẬP BỔ TRỢ 4 KỸ NĂNG TIẾNG ANH 9 GLOBAL SUCCESS - CẢ NĂM - BÁM SÁT FORM Đ...
PPTX
Renaissance Architecture: A Journey from Faith to Humanism
PDF
Sports Quiz easy sports quiz sports quiz
PDF
Physiotherapy_for_Respiratory_and_Cardiac_Problems WEBBER.pdf
PDF
STATICS OF THE RIGID BODIES Hibbelers.pdf
PPTX
Microbial diseases, their pathogenesis and prophylaxis
PPTX
Pharmacology of Heart Failure /Pharmacotherapy of CHF
PDF
RMMM.pdf make it easy to upload and study
PDF
Pre independence Education in Inndia.pdf
PPTX
Final Presentation General Medicine 03-08-2024.pptx
PDF
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
PDF
Abdominal Access Techniques with Prof. Dr. R K Mishra
PPT- ENG7_QUARTER1_LESSON1_WEEK1. IMAGERY -DESCRIPTIONS pptx.pptx
Module 4: Burden of Disease Tutorial Slides S2 2025
IMMUNITY IMMUNITY refers to protection against infection, and the immune syst...
Classroom Observation Tools for Teachers
Cell Types and Its function , kingdom of life
FourierSeries-QuestionsWithAnswers(Part-A).pdf
GDM (1) (1).pptx small presentation for students
Cell Structure & Organelles in detailed.
BÀI TẬP BỔ TRỢ 4 KỸ NĂNG TIẾNG ANH 9 GLOBAL SUCCESS - CẢ NĂM - BÁM SÁT FORM Đ...
Renaissance Architecture: A Journey from Faith to Humanism
Sports Quiz easy sports quiz sports quiz
Physiotherapy_for_Respiratory_and_Cardiac_Problems WEBBER.pdf
STATICS OF THE RIGID BODIES Hibbelers.pdf
Microbial diseases, their pathogenesis and prophylaxis
Pharmacology of Heart Failure /Pharmacotherapy of CHF
RMMM.pdf make it easy to upload and study
Pre independence Education in Inndia.pdf
Final Presentation General Medicine 03-08-2024.pptx
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
Abdominal Access Techniques with Prof. Dr. R K Mishra

6 Block Modeling

  • 1. 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. Social life as interconnected system of roles Important feature: thinking of roles as connected in a role system = social structure
  • 2. 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.
  • 3. Coherence of Role Systems 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 .
  • 4. Empirical social structures With the fall of f unctionalism 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. Em pirical role is: A set of relations signifying exchange of something (support, ideas, commands, etc) between actors.
  • 5. Family Structure 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 (and there are, of course, many other relations inside the family) Romantic Love Bickers with
  • 6. Generalization 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 .
  • 7. Structural Equivalence A single relation
  • 8. Structural Equivalence Graph reduced to positions
  • 9. 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
  • 10. Basic Steps: Blockmodeling In any positional analysis, there are 4 basic steps: 1) Identify a definition of equivalence 2) Measure the degree to which pairs of actors are equivalent 3) Develop a representation of the equivalencies 4) Assess the adequacy of the representation 5) Repeat and refine
  • 11. 1) Identify a definition of equivalence Structural Equivalence: Two actors are equivalent if they have the same type of ties to the same people .
  • 12. 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. In general, automorphically equivalent nodes are equivalent with respect to all graph theoretic properties (I.e. degree, number of people reachable, centrality, etc.)
  • 14. 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 . Regular Equivalence i j k l
  • 15. 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.
  • 16. Practicality 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.
  • 17. 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 1 1 1 0 0 0 0 1 0 1 0 0 0 1 1 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 0 1 0 0 1 0 0 0 0 0 1 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 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
  • 18. . 1 1 1 0 0 0 0 0 0 0 0 0 0 1 . 0 0 1 1 0 0 0 0 0 0 0 0 1 0 . 1 0 0 1 1 1 1 0 0 0 0 1 0 1 . 0 0 1 1 1 1 0 0 0 0 0 1 0 0 . 1 0 0 0 0 1 1 1 1 0 1 0 0 1 . 0 0 0 0 1 1 1 1 0 0 1 1 0 0 . 0 0 0 0 0 0 0 0 0 1 1 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 1 1 0 0 0 0 0 0 . 0 0 0 0 0 1 1 0 0 0 0 0 0 0 . 1 2 3 4 5 6 1 0 1 1 0 0 0 2 1 0 0 1 0 0 3 1 0 1 0 1 0 4 0 1 0 1 0 1 5 0 0 1 0 0 0 6 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 1 2 3 4 5 6
  • 19. . 1 1 1 0 0 0 0 0 0 0 0 0 0 1 . 0 0 1 1 0 0 0 0 0 0 0 0 1 0 . 1 0 0 1 1 1 1 0 0 0 0 1 0 1 . 0 0 1 1 1 1 0 0 0 0 0 1 0 0 . 1 0 0 0 0 1 1 1 1 0 1 0 0 1 . 0 0 0 0 1 1 1 1 0 0 1 1 0 0 . 0 0 0 0 0 0 0 0 0 1 1 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 1 1 0 0 0 0 0 0 . 0 0 0 0 0 1 1 0 0 0 0 0 0 0 . 1 2 3 1 1 1 0 2 1 1 1 3 0 1 0 Once you partition the matrix, reduce it: Regular equivalence 1 2 3
  • 20. 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 0 1 . 0 0 1 1 0 0 0 0 0 0 0 0 1 0 . 1 0 0 1 1 1 1 0 0 0 0 1 0 1 . 0 0 1 1 1 1 0 0 0 0 0 1 0 0 . 1 0 0 0 0 1 1 1 1 0 1 0 0 1 . 0 0 0 0 1 1 1 1 0 0 1 1 0 0 . 0 0 0 0 0 0 0 0 0 1 1 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 0 0 1 1 0 0 0 0 . 0 0 0 0 0 0 0 1 1 0 0 0 0 0 . 0 0 0 0 0 0 1 1 0 0 0 0 0 0 . 0 0 0 0 0 1 1 0 0 0 0 0 0 0 . 1 2 3 4 5 6 1 2 3 4 5 6 C D Match 1 1 1 0 0 1 . 1 0 1 . 0 0 0 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 0 0 1 0 0 1 0 0 1 Sum: 12 C and D match on 12 other people
  • 21. If the model is going to be based on asymmetric or multiple relations, you simply stack the various relations: H W C C C Provides food for Romantic Love Bickers with Romance 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Feeds 0 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Bicker 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 1 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 0 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 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 Stacked
  • 22. 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 8 11 7 8 8 4 4 0 12 12 12 8 8 8 8 11 7 8 8 4 4 12 0 12 12 8 8 8 8 11 7 8 8 4 4 12 12 0 12 8 8 8 8 11 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)
  • 23. Measuring similarity 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 Correlation between each node’s set of ties. For the example, this would be:
  • 24. The initial method for finding structurally equivalent positions was CONCOR, the CONvergence of iterated COR relations. 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.95 0.55 -.57 1.00 1.00 -1.0 -1.0 0.73 0.73 0.73 0.73 -.75 -.75 -.75 -.75 0.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.73 0.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.77 0.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.77 0.95 -.75 0.73 0.73 -.75 -.75 1.00 1.00 1.00 1.00 -.77 -.77 -.77 -.77 0.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:
  • 25. 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.99 0.94 -.94 1.00 1.00 -1.0 -1.0 0.97 0.97 0.97 0.97 -.97 -.97 -.97 -.97 0.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.97 0.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.99 0.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.99 0.99 -.99 0.97 0.97 -.97 -.97 1.00 1.00 1.00 1.00 -.99 -.99 -.99 -.99 0.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 COR relations.
  • 26. Padget and Ansell: “ Robust Action and the Rise of the Medici” Substantive question relates to effective state-building: there is a tension between the need to control and organization and the ability to build the legitimacy and recognition required for reproduction. The distinction between “boss” and “judge” They use the marriage, economic and patronage networks Empirically, we know that the state oligarchy structure of Florence stabilized after the rise of the medici:
  • 27. Padget and Ansell: “ Robust Action and the Rise of the Medici” Medici Takeover
  • 28. Padget and Ansell: “ Robust Action and the Rise of the Medici” The story they tell revolves around how Cosimo de’Medici was able to found a system that lasted nearly 300 years, uniting a fractured political structure. The paradox of Cosimo is that he didn’t seem to fit the role of a Machiavellian leader as decisive and goal oriented. The answer lies in the power resulting from ‘robust action’ embedded in a network of relations that gives rise to no clear meaning and obligation, but instead allows for multiple meanings and obligations.
  • 29. A real example: Padget and Ansell: “ Robust Action and the Rise of the Medici” “ Political Groups” in the attribute sense do not seem to exist, so P&A turn to the pattern of network relations among families. This is the BLOCK reduction of the full 92 family network.
  • 30. An example: Relations among Italian families. Political and friendship ties
  • 31. Generalized Block Models The recent work on generalization focuses on the patterns that determine a block. Instead of focusing on just the density of a block, you can identify a block as any set that has a particular pattern of ties to any other set. Examples include:
  • 33. 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. Sibling Child of Sibling 0 1 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 Child of 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 x = Nephew/Niece 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 S  C = SC
  • 34. 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”