Reflective Centralities in Two Mode Data

Generalized similarities
Two-mode networks
Reflections
Complexity
Author

Omar Lizardo

Published

January 24, 2023

Introduction

In a 2018 piece published in Poetics I adapted an approach to computing “reflective centralities” in two-mode data developed by Hidalgo & Hausmann (2009)—hereafter HH—to generalize basic formal notions in the study of cultural taste. Namely, “omnivorousness” on the side of people and “popularity” on the side of genres. The basic idea is that people can be characterized by the formal properties of the genres they choose (e.g., popularity versus nicheness) and genres can be characterized by the formal properties of the people who choose them (e.g., omnivores versus univores), at various levels of “reflections” (see the paper for more details).

Of course, the HH reflective approach is not restricted to any type of data—although I would argue there is a particular elective affinity between this formalization and the substantive subject of cultural taste. In fact, it can be considered part of a family of reflective methods to compute the centralities of object in one node set in two-mode networks using relational information from the objects in the other node set.

Table 1: Southern Women Data.
E1 E2 E3 E4 E5 E6 E7 E8 E9 E10 E11 E12 E13 E14
EVELYN 1 1 1 1 1 1 0 1 1 0 0 0 0 0
LAURA 1 1 1 0 1 1 1 1 0 0 0 0 0 0
THERESA 0 1 1 1 1 1 1 1 1 0 0 0 0 0
BRENDA 1 0 1 1 1 1 1 1 0 0 0 0 0 0
CHARLOTTE 0 0 1 1 1 0 1 0 0 0 0 0 0 0
FRANCES 0 0 1 1 1 1 0 1 0 0 0 0 0 0
ELEANOR 0 0 0 1 1 1 1 1 0 0 0 0 0 0
RUTH 0 0 0 1 1 0 1 1 1 0 0 0 0 0
VERNE 0 0 0 0 0 0 1 1 1 0 0 1 0 0
MYRA 0 0 0 0 0 0 0 1 1 1 0 1 0 0
KATHERINE 0 0 0 0 0 0 0 1 1 1 0 1 1 1
SYLVIA 0 0 0 0 0 0 1 1 1 1 0 1 1 1
NORA 0 0 0 0 0 0 1 0 1 1 1 1 1 1
HELEN 0 0 0 0 0 0 1 1 0 1 1 1 0 0
OLIVIA 0 0 0 0 0 0 0 0 1 0 1 0 0 0
FLORA 0 0 0 0 0 0 0 0 1 0 1 0 0 0
PEARL 0 0 0 0 0 1 0 1 1 0 0 0 0 0
DOROTHY 0 0 0 0 0 0 0 1 1 0 0 0 0 0
Note:
Rows ordered according to the generalized blockmodeling solution of Doreian et al. (2004, Table 4).

Reflective Centralities of Persons and Groups

Take the classic case of the duality of persons and groups (Breiger, 1974). At the first level, the most basic measure of centrality is degree centrality. Recall that a two-mode network composed of a set of people \(P\) and their affiliation relations to a set of groups \(P\) can be represented by an affiliation matrix \(\mathbf{A}\) of dimensions \(|P| \times |G|\) with people along the rows and groups across the columns, where \(|P|\) is the cardinality of the people set and \(|G|\) is the cardinality of the group set, with cell entries \(a_{pg}= 1\) if person p is affiliated with group g and \(a_{pg}= 0\) otherwise.

In this case, the degree centrality of people is given by:

\[ C^R_p(1) = \sum_g a_{pg} \tag{1}\]

And for groups:

\[ C^R_g(1) = \sum_p a_{pg} \tag{2}\]

For instance, for the classic Davis et al. (1941) Southern Women Data shown in Table 1, the centrality of the degree centralities of the people are:

EVELYN LAURA THERESA BRENDA CHARLOTTE FRANCES ELEANOR RUTH VERNE MYRA KATHERINE SYLVIA NORA HELEN OLIVIA FLORA PEARL DOROTHY
8 7 8 7 4 5 5 5 4 4 6 7 7 5 2 2 3 2

And for the groups:

E1 E2 E3 E4 E5 E6 E7 E8 E9 E10 E11 E12 E13 E14
3 3 6 7 8 7 10 14 12 5 4 6 3 3

The key to the reflective approach, is the observation that, once we have these first-order quantities, it is possible to compute a “second order centralities” for both people and groups using the centralities of the other mode.

For people this is:

\[ C^R_p(2) = \frac{1}{C^R_p(1)}\sum_g a_{pg}C^R_g(1) \tag{3}\]

And for groups:

\[ C^R_g(2) = \frac{1}{C^R_g(1)}\sum_p a_{pg}C^R_p(1) \tag{4}\]

Equation 3 says “people are more central when the average membership of the groups they belong to is large” (e.g., \(a_{pg} = 1\) and \(C^R_g(1)\) is a big number). Equation 4 says “groups are more central when the average number of memberships of their members is large” (e.g., \(a_{pg} = 1\) and \(C^R_p(1)\) is a big number).

Of course, we can keep on going and define third order reflections:

\[ C^R_p(3) = \frac{1}{C^R_p(1)}\sum_g a_{pg}C^R_g(2) \tag{5}\]

\[ C^R_g(3) = \frac{1}{C^R_g(1)}\sum_p a_{pg}C^R_p(2) \tag{6}\]

Equation 5 says something like “people are more central when the average of the average number of memberships of the members of the groups they belong to is large” (e.g., \(a_{pg} = 1\) and \(C^R_g(2)\) is a big number). Equation 6 says something like “groups are more central when the average of the average number of members of the groups their members belong to is large” (e.g., \(a_{pg} = 1\) and \(C^R_p(2)\) is a big number).

Note that for the people, the even numbered reflection \(C^R_p(2)\) assigns centrality based on a formal feature of the groups they belong to (in this case, their degree centrality). The odd numbered reflection \(C^R_p(3)\), on the other hand, assigns centrality based on a formal feature of the members of the groups they belong to.

In the same way, for the groups, the even-numbered reflection \(C^R_g(2)\) assigns centrality based on a formal feature of the people who belong to them (in this case, their degree centrality). The odd numbered reflection \(C^R_g(3)\), on the other hand, assigns centrality based on a formal feature of the groups their members they belong to.

More generally, we can define a series of reflective quantities for people and groups (whose verbal interpretation becomes more complex as the number of iterations increases):

\[ C^R_p(q) = \frac{1}{C^R_p(1)}\sum_g a_{pg}C^R_g(q-1) \]

\[ C^R_g(q) = \frac{1}{C^R_g(1)}\sum_p a_{pg}C^R_p(q-1) \tag{7}\]

For all \(q>1\) (Hidalgo & Hausmann, 2009). This results in a series of vectors of reflective centrality scores for both people and groups across iterations \(q =\{1, 2, 3, ....Q\}\), which can be arranged into a \(P \times Q\) matrix (for people) and \(G \times Q\) matrix (for groups).

here() starts at C:/Users/Omar Lizardo/Google Drive/UCLA/mysite
Cr_2 Cr_4 Cr_6 Cr_8 Cr_10 Cr_12 Cr_14 Cr_16 Cr_18 Cr_20
EVELYN 15.0 9.0 7.0 4.0 5.0 5.0 5.0 5.0 5.0 5.0
LAURA 16.0 14.0 10.0 5.0 3.0 3.0 3.0 3.0 3.0 3.0
THERESA 8.0 7.0 6.0 7.0 7.0 7.0 7.0 7.0 7.0 7.0
BRENDA 11.0 10.0 8.0 3.0 4.0 4.0 4.0 4.0 4.0 4.0
CHARLOTTE 13.0 11.0 9.0 2.0 2.0 2.0 2.0 2.0 2.0 2.0
FRANCES 7.0 6.0 2.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0
ELEANOR 6.0 5.0 3.0 6.0 6.0 6.0 6.0 6.0 6.0 6.0
RUTH 4.0 3.0 5.0 8.0 8.0 8.0 8.0 8.0 8.0 8.0
VERNE 3.0 4.0 11.0 11.0 11.0 11.0 11.0 11.0 11.0 11.0
MYRA 5.0 8.0 12.0 12.0 13.0 13.0 13.0 13.0 13.0 13.0
KATHERINE 17.0 17.0 17.0 17.0 17.0 17.0 17.0 15.0 15.0 15.0
SYLVIA 14.0 16.0 16.0 16.0 16.0 14.0 14.0 14.0 14.0 14.0
NORA 18.0 18.0 18.0 18.0 18.0 18.0 18.0 18.0 18.0 18.0
HELEN 12.0 15.0 15.0 15.0 12.0 12.0 12.0 12.0 12.0 12.0
OLIVIA 9.5 12.5 13.5 13.5 14.5 15.5 15.5 16.5 16.5 16.5
FLORA 9.5 12.5 13.5 13.5 14.5 15.5 15.5 16.5 16.5 16.5
PEARL 2.0 2.0 1.0 9.0 9.0 9.0 9.0 9.0 9.0 9.0
DOROTHY 1.0 1.0 4.0 10.0 10.0 10.0 10.0 10.0 10.0 10.0
Table 2: Even numbered reflective centralities for people in the Southern Women Data

Results

Persons

Table 2 shows the results of the even numbered reflections for the people in the Southern women data, using an R function called reflections that can be found here. Table 3 show the corresponding odd numbered reflections. Each entry in the table is the rank (ordered so that smaller means higher rank) of standardized centrality score for each reflection.

Cr_3 Cr_5 Cr_7 Cr_9 Cr_11 Cr_13 Cr_15 Cr_17 Cr_19
EVELYN 2.0 5.0 5.0 5.0 5.0 5.0 5.0 5.0 5.0
LAURA 1.0 1.0 3.0 3.0 3.0 3.0 3.0 3.0 3.0
THERESA 5.0 6.0 7.0 7.0 7.0 7.0 7.0 7.0 7.0
BRENDA 3.0 2.0 4.0 4.0 4.0 4.0 4.0 4.0 4.0
CHARLOTTE 4.0 3.0 1.0 2.0 2.0 2.0 2.0 2.0 2.0
FRANCES 6.0 4.0 2.0 1.0 1.0 1.0 1.0 1.0 1.0
ELEANOR 7.0 7.0 6.0 6.0 6.0 6.0 6.0 6.0 6.0
RUTH 10.0 8.0 8.0 8.0 8.0 8.0 8.0 8.0 8.0
VERNE 13.0 11.0 11.0 11.0 11.0 11.0 11.0 11.0 11.0
MYRA 14.0 14.0 13.0 12.0 12.0 12.0 12.0 12.0 12.0
KATHERINE 9.0 12.0 14.0 15.0 15.0 15.0 15.0 15.0 15.0
SYLVIA 8.0 10.0 12.0 13.0 14.0 14.0 14.0 14.0 14.0
NORA 11.0 15.0 16.0 16.0 16.0 16.0 18.0 18.0 18.0
HELEN 15.0 16.0 15.0 14.0 13.0 13.0 13.0 13.0 13.0
OLIVIA 17.5 17.5 17.5 17.5 17.5 17.5 16.5 16.5 16.5
FLORA 17.5 17.5 17.5 17.5 17.5 17.5 16.5 16.5 16.5
PEARL 12.0 9.0 9.0 9.0 9.0 9.0 9.0 9.0 9.0
DOROTHY 16.0 13.0 10.0 10.0 10.0 10.0 10.0 10.0 10.0
Table 3: Odd numbered reflective centralities for people in the Southern Women Data

The reflective centrality pattern encoded in the tabular data can be more easily apprehended using a bump chart. Figure 1 and Figure 2 show such charts for the data corresponding to Table 2 and Table 3 respectively.1 As the tables show, in all cases, the rankings “freeze” after a relatively small number of iterations (\(q \approx 18\))


Attaching package: 'cowplot'
The following object is masked from 'package:lubridate':

    stamp

Figure 1: Even numbered reflective centrality trajectories for actors in Southern Women Data.

As Figure 1 shows, \(NORA\), \(FLORA\), \(CHARLOTTE\) and \(EVELYN\) are the top-ranked actors when it comes to \(C^R(2)\): The average number of members of the groups they belong to. However, their fates in this reflective metric diverges at higher reflections, with Nora and Flora maintaining their top positions but \(CHARLOTTE\) and \(EVELYN\) tumbling down the ranks, suggesting that the members of the groups they belong to affiliate with smaller groups than the members of the groups \(NORA\) and \(FLORA\) belong to (and so on for higher reflections).

Notably, the reflective centrality ranks at the highest reflection (\(q = 20\)) in Table 2, recovers the Doreian et al. (2004) block partition (see Table 1), but this time with Dorothy and Pearl in the middle separating the two largest blocks of women.

Figure 2: Odd numbered reflective centrality trajectories for actors in Southern Women Data.

Groups

Figure 3 and Figure 4 show the corresponding bump charts for the events. Just like for this actors, the equilibrium reflective centralities recover the ordering of the columns according to Doreian et al. generalized blockmodel with events 1-6 separated from events 10-15 by events 7-9 (see also Kovacs, 2010).

Figure 3: Even numbered reflective centrality trajectories for events in Southern Women Data.

Figure 3 shows that \(E14\) experiences the most dramatic improvement in status as we move to higher reflections. Relatively low ranked when it comes to the average number of memberships of its members, it increases in standing when considering the average of the average number memberships of its members (and so forth).

The most dramatic change in status is for \(E1\) in Figure 4, which begins as the top event when centrality is measured as the average size of the memberships of its members, but ends up dead last at higher reflections, suggesting that the average size of the events attended by the members of the groups its members belong to are smaller than other events (and so forth).

Figure 4: Odd numbered reflective centrality trajectories for events in Southern Women Data.

Conclusion

The H-H reflective metric can be an insightful tool to analyze centralities in two-mode data, respecting the principle of duality (Breiger, 1974). In this post, I showed the approach can reveal substantive meaningful patterns in the position of persons and groups in a classic two-mode network data set.

References

Breiger, R. L. (1974). The duality of persons and groups. Social Forces, 53(2), 181-190.

Davis, A., Gardner, B. B., & Gardner, M. R. (1941). Deep South A Social Anthropological Study of Caste and Class. University of Chicago Press.

Doreian, P., Batagelj, V., & Ferligoj, A. (2004). Generalized blockmodeling of two-mode network data. Social Networks, 26(1), 29-53.

Hidalgo, C. A., & Hausmann, R. (2009). The building blocks of economic complexity. Proceedings of the National Academy of Sciences, 106(26), 10570-10575.

Kovács, B. (2010). A generalized model of relational similarity. Social Networks, 32(3), 197-211.

Lizardo, O. (2018). The mutual specification of genres and audiences: Reflective two-mode centralities in person-to-culture data. Poetics, 68, 52-71.

Footnotes

  1. The plots were rendered using the package ggbump. Color palette is “cols25” from the pals package.↩︎