Network Basics

Notes from Kadushin, Charles. 2012. Understanding Social Networks: Theories, Concepts, and Findings. New York, NY: Oxford University Press.

Chapter 1:

Human beings have always been defined, in one way or another by networks:

Some suggest that urban Americans are becoming more and more socially isolated:

However, what we are seeing may be best describe as a movement away from place-based communities to an interlinked web of connections

Networks:

Chapter 2: Basic Network Concepts, Part I

What Is a Network?

Core questions:

Three kinds of networks:

  1. Ego-centric-connected via a single node
  2. Socio­centric--connected within a broader social/organizational context (students in a classroom)
  3. Open-system networks--boundaries not necessarily clear.

Propinquity: for all networks, geographical closeness is associated with a greater likelihood of connection.

Homophily

Individual-Level Homophily

Homophily and Collectivities

Dyads and Mutuality

Balance and Triads


Chapter 3: Basic Network Concepts, Part II

WHOLE SOCIAL NETWORKS

A sociogram, the graph or diagram of a whole network, examples of which were shown in the first chapter, is one way to understand an entire network. As Yogi Berra reputedly said, "You can observe a lot by watching." However, sociograms that contain more than ten nodes are hard to grasp and subject to different interpretations depending on who is "watching." Analytic concepts and methods that account for the entire network and describe and summarize various aspects of it are necessary.

Distributions of network properties are the first set of key descriptors:

  1. The number of dyads and triads in the network.
  2. Density, the number of connections contained within the network
  3. Structural Holes, a category concerned with the lack of connections.
  4. Popularity and Centrality demonstrate that some nodes have more connections than others and those connections serve as links to other nodes.
  5. The Distance across the network between nodes. The radius of distances from any given node is an important descriptor.
  6. Multiplexity recognizes that there may be many networks that connect, in different ways, the same nodes.
  7. Position or Role is a concept that is not distributional but invokes how nodes relate to other nodes in the network.

Dyads and Triads:

Density:

Structural Holes:

Weak Ties:

"The Strength of Weak Ties" is the title of an article by Mark Granovetter (1973) that has achieved almost as much fame and certainly more citations than the more popularly known "small world" described by Stanley Milgram in his Psychology Today article (Milgram 1967). Like structural holes, "weak ties" also focuses on holes in the network. The most authoritative statement of the idea is Granovetter's 1982 reprise:

[O]ur acquaintances ("weak ties') are less likely to be socially involved with one another than are our dose friends ("strong ties'). Thus the set of people made up of any individual and his or her acquaintances will constitute allow-density network (one in which many of the possible ties are absent), whereas the set consisting of the same individual and his or her close friends will be densely knit (many of the possible lines present). ...Ego will have a collection of close friends, most of whom are in touch with one another-a dense "dump" of social structure. Ego will [also] have a collection of acquaintances, few of whom know one another. Each of these acquaintances, how­ ever, is likely to have dose friends in his or her own right and therefore to be enmeshed in a closely knit dump of social structure, but one different from Ego's ...These dumps would not ...be connected with one another at all were it not for the existence of weak ties. (Granovetter 1982, 105-106)

Complications to the analysis of weak ties.

"Popularity" or Centrality:

Popularity can be broken down into several different ideas relating to centrality:

Distance:


Size of the Interpersonal Environment:

Multiplexity (multiple connections between nodes):

Roles and Positions

Chapter 4: Network Basics, part 3 Network Segmentation

Separate whole networks into smaller meaningful segments.

As with network position, there are emic and etic clusters or groups.

Emic groups are named and recognized by the "natives."

Etic segments of a network are those that are identified by observers. Examples are the "C's"2: clusters, cliques, clacks, circles, cabals, (but not clubs-they are emic), coalitions, and also some non-"C's" such as "group" and "block."

PRIMARY GROUPS, CLIQUES, AND CLUSTERS

The concept of primary group was introduced by Charles Cooley in 1909:

By primary groups are characterized by intimate face-to-face association and cooperation.

Clusters

SEGMENTING NETWORKS ON THE BASIS OF COHESION

Cohesiveness defines "cliques."


RESISTANCE TO DISRUPTION

White and Harary (2001) utilize the sociological concept of group cohesion. In a further elaboration (Moody and White 2003, 106) observe, "A collectivity is structurally cohesive to the extent that the social relations of its members hold it together." Furthermore, "A group is structurally cohesive to the extent that multiple independent relational paths among all pairs of members hold it together ...The strongest cohesive groups are those in which every person is directly connected to every other person (cliques), though this level of cohesion is rarely observed except in small primary groups."

The cohesiveness of a group can be gauged by looking at two processes that are the obverse of one another.

  1. Cohesion: A group is cohesive to the extent that the members are pulled together when confronted with disruptive forces.
  2. Adhesion: Cohesiveness can be estimated by seeing what happens to the disconnectedness of a group when one or more members (nodes) are removed or, keeping the same number of nodes, when one or more paths or connections between the members or nodes are removed.
  3. A group may have low density of relations between its members and be relatively resistant to disruption, while an equally dense group may be less resistant to disruption, less cohesive in these terms. Especially interesting is the possibility that there are groups with sparse connectedness that can actually be quite cohesive in terms of their resistance to forces that would break them up. The method creates nested hierarchical trees but also allows for overlaps between groups within those trees.

STRUCTURAL SIMILARITY AND STRUCTURAL EQUIVALENCE

The other way of partitioning or segmenting networks utilizes the master idea of reaching out to other nodes and examining the pattern of a node's relations with the other nodes in the network, rather than looking for cohesion in terms of relations between the nodes. Nodes that have similar patterns of relationships with other nodes are grouped together. This idea is called structural similarity (Burt 1992; Borgatti and Everett 1992). Managers may have similar patterns in their relations to employees in their units. Structural equivalence, a more strict formulation, is defined as nodes that are connected to the same other nodes in identical ways. To be structurally equivalent, two managers would have to have the same relationships to the same employees, an unlikely situation. Since identical relations are relatively infrequent, there are ways of modeling "ideal" patterns and then assessing how well these patterns fit the data (Doreian, Batagelj, and Ferligoj 2005) or how similar they are (Breiger, Boorman, and Arabie 1975). The method was first developed by White, Boorman, and Breiger (1976) and was called "blockmodeling." Blockmodels partition networks into non-overlapping segments-an advantage or a disadvantage depending on what one is trying to do. The modeling aspect comes from the fact that blocks so constructed are abstractions from the data and can be algebraically manipulated.' Clusters or blocks can be represented by a matrix of i's and o's. In the following example (table41), there are two blocks, A and B, each consisting of a number of nodes. The 1's represent the presence of a relationship; the o's the absence of a relationship. The tables are read in terms of the rows relating to the columns. In the first row, block A relates to block A and to block B. In the second row, B relates to A but not to itself. Remember, these are not individual nodes, but clusters of nodes.5


Core/Periphery Structures

Core/periphery structures are the simplest forms of network segmentation. The reason core/periphery structures are so familiar to us is that we have all experienced them, starting from our days in a playground. There were kids who were on the inside while others were on the outside. This patterning continues through grade school, high school, and throughout life. However, even in this apparently simple structure, there are different patterns to explore.

There are several other kinds of elite cores." There is a "caucus" type of core. Breiger (1979) suggests that this type of cluster can be applied to the community power literature. Those active in block A "run" the community and do not pay much attention to the others who do not have political relationships (though they might have other kinds of relationships) with each other or with the core. The core does not take account of the periphery, and the periphery has no relationship with the core or with others.
If we consider directed graphs, those that are not necessarily symmetrical, then we can have the Groucho Marx situation as in his famous line, "I sent the club [the Friars Club] a wire stating, 'Please accept my resignation. I don't want to belong to any dub that will accept me as a member'" (Marx 1959, 321).

More generally, this is a diffusion model from a core: The core has what other nodes want, so they look to it. Unlike a trading situation, the core does not want anything from the periphery. The relation is not symmetric.

There can be a situation, shown in table 4.6 in which A remains the elite in that A relates only to other N.s, but B also has some density of relating to other B's, and also to A. Breiger calls this situation one of "deference."A wants nothing from B, but the B's have something to offer to one another.

To complete the logic of core/periphery, there can be the following kind of relation­ ships (table 4.7), in which the last come first and "the meek inherit the earth."

This simply turns the caucus or the elite core blockmodel on its head, assuming that the B block has fewer power attributes. We suspect that in reality this model is largely empirically absent. The "meek" blockmodel (table 4.7), however, suggests a proposition about core/ periphery networks.Cores possess whatever attributes are most valued by the network. While this seems like a simple tautology, it is not and may be the result of extremely complex processes. 1he network is about relationships and flows, not about the attri­ butes of the nodes. This proposition says that in core/periphery structures, the valua­ tion of the attributes is related to the structure.8 1he proposition does not state which comes first, however one must ask, do the nodes that have the most of what is valued come to be the core, or do the nodes that already have the most of what is valued impose their values on others who have less and confine them to the periphery? This proposi­ tion was first formally noted in terms ofleadership and norms by George Homans in his reinterpretation of the "Norton Street Gang" in The Human Group (Homans 1950). Leaders were said to embody more of the norms of the group than the followers. Simi­ larly, the core in world/systems theory has the more advanced economy; political core elites have more power; the core in overlapping corporate boards of governors have more control; and the core in cultural diffusion has cultural hegemony. 1his proposition will be elaborated upon in the chapters that follow.


Thus far it seems that network analysis is a scheme that merely enforces the status quo. 1hat is, the network embodies the values of the system, and the core/periphery model allows for no change. Yet there is one logical possibility that has not yet been examined. In terms of the network relations in the political arena, there could be a situation of two dusters or caucuses polarizing the community (table 4.8). They relate to themselves but not to one another.


This polarizing situation occurs in a modern community in which there is some overlap of circles in an unstable situation. Coleman describes this kind of structure as the second stage in community conflict after an issue is introduced (Coleman 1957). This blockrnodel implies the following idea: network polarization is central to social change. Social transformation leads to polarization of networks, or, the reverse, polar­ ization of networks leads to social change in terms of norms, values, and other social structures. The karate club, above, was an example of polarization. The ramifications of this model for social change will be discussed in the chapters that follow.


In the real world there are rarely two chokes, and blockmodels can be complicated by incorporating additional blocks, C, D, . . . N. The models above that depict just two blocks are intended to present the basic idea of core/periphery models-the most simple of networks. Even they can be complex.

Bow best to partition networks, especially large ones, remains one of the frontiers of network analysis, though much progress has been made recently (see chapter 8). Whole large networks are messy matters, but the network field has gone a long way from talking about social relations and networks as metaphors to analyzing them and building testable models. The following chapters will review and expand upon some of the things we have learned.

URL: http://www.umsl.edu/~keelr/3280/3280_lecture_notes/Understanding_Social _Networks.html
Owner: Robert O. Keel:
rok@umsl.edu
Last Updated: Wednesday, February 4, 2015 12:01 PM

Unless otherwise noted, all pages within the web site http://www.umsl.edu/~keelr/ ©2015 by Robert O. Keel.
Click here to Report Copyright Problems