6 Matching Annotations
 Feb 2019

methods.sagepub.com.ezp1.lib.umn.edu methods.sagepub.com.ezp1.lib.umn.edu

Network centralization
degree.cent < centr_degree(g, mode = "all") degree.cent$res degree.cent$centralization degree.cent$theoretical_max

Valente (2010) summarizes the calculation of network centralization. Network centralization is calculated by determining the highest individual centrality score (either indegree or outdegree) and then subtracting it from all the other individual scores in the network. Next, these differences are added and that total is divided by the maximum sum of differences theoretically possible in a network of that size. Freeman's (1979) formula for centralization degree (CD) is:
Measuring network centralization.

Degrees refers to the number of ties an actor either sends (outdegree) or receives (indegree).
Definition of Degrees

The average path length measures the mean distance between all pairs of actors in the network.
Distance

the density of transitive triples is the number of triples, which are transitive, divided by the number of paths of length two
This is the mathematical measure of transitivity.


bookdown.org bookdown.org

Honeycutt, T. (2009). Making Connections: Using Social Network Analysis for Program Evaluation. Mathematica Policy Research, (1), 1–4.
I claim this article.
