Skip to main content icon/video/no-internet

In social network analysis, the term network cohesion refers to a measure of the connectedness and togetherness among actors within a network. A social network can be defined as a network formed by a set of interacting social entities (actors) and the linkages (relations or edges) among them. The index of network cohesion is a single value that captures the togetherness of the group. Network cohesion can be measured in a variety of different ways, most of which are based on the dyadic cohesion. Dyadic cohesion refers to the closeness between a pair of actors. It should be differentiated from the closeness centrality, which measures how close an actor is to all other actors within a network. However, from the angle of cohesion, closeness centrality can be seen as a measure for the actor-level cohesion. This entry introduces several different measures for network cohesion and demonstrates how to calculate each index through examples of both undirected and directed networks.

Measures for Network Cohesion

The simplest way to measure network cohesion is to examine how many ties that a network contains. In this sense, network cohesion can be simply expressed as the sum of all observed edges from a network. This index has a disadvantage in that the sum of edges is dependent on the size of a network. A poorly connected network with more actors may have the same total number of edges as a small cohesive network. For this reason, in order to compare across networks of different size, a standardized index is needed. The standardized index can be obtained by dividing the sum of edges by the maximum possible edges of a network. In social network analysis, this standardized index is also known as network density, denoted as D. Let N be the size of a network, and E denote the number of observed edges. Then, the network density for an undirected network can be expressed as

D= 2EN (N1),

and for a directed network:

D= EN (N1).

Network cohesion can also be measured by the average degree of the network (d). In social network analysis, degree can be simply interpreted as how active an actor is in a network and can be measured by the number of ties the actor has to other actors. Thus, the average degree is simply the average number of ties each actor has. For an undirected network,

d¯= 2EN =D×(N1),

and for a directed network,

d¯= EN =D×(N1).

Actually, both network density and average degree are measures that are directly built upon the dyadic cohesion. Measures for network cohesion can also be built upon the subgroup-level cohesion, namely, structural cohesion. These measures not only consider the number of ties but also the structure and clustering among ties. Sometimes the subgroup is also termed as a component, which refers to the substructure of networks connected internally but disconnected between each other. One of the measures under this umbrella is component ratio (CR). Let C denote the number of components and N denote the number of actors in a network, then:

CR= C1N1.

Another component-based measure for network cohesion is fragmentation (F). Fragmentation is defined as the proportion of pairs of actors that are not located in the same component. Let rij be any pair of actors i and j in a network. If i and j are observed in the same component, rij = 1; otherwise, rij = 0. Let N be the number of actors, and the fragmentation can then be calculated

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading