migraph (version 0.12.1)

diversity: Measures of network diversity

Description

These functions offer ways to summarise the heterogeneity of an attribute across a network, within groups of a network, or the distribution of ties across this attribute.

Usage

network_diversity(object, attribute, clusters = NULL)
network_homophily(object, attribute)
network_assortativity(object)

Arguments

object

An object of a migraph-consistent class:

• matrix (adjacency or incidence) from {base} R

• edgelist, a data frame from {base} R or tibble from {tibble}

• igraph, from the {igraph} package

• network, from the {network} package

• tbl_graph, from the {tidygraph} package

attribute

Name of a nodal attribute or membership vector to use as categories for the diversity measure.

clusters

A nodal cluster membership vector or name of a vertex attribute.

Functions

• network_diversity(): Calculates the heterogeneity of ties across a network or within clusters by node attributes.

• network_homophily(): Calculates the embeddedness of a node within the group of nodes of the same attribute

• network_assortativity(): Calculates the degree assortativity in a graph.

network_diversity

Blau's index (1977) uses a formula known also in other disciplines by other names (Gini-Simpson Index, Gini impurity, Gini's diversity index, Gibbs-Martin index, and probability of interspecific encounter (PIE)): $$1 - \sum\limits_{i = 1}^k {p_i^2 }$$, where \(p_i\) is the proportion of group members in \(i\)th category and \(k\) is the number of categories for an attribute of interest. This index can be interpreted as the probability that two members randomly selected from a group would be from different categories. This index finds its minimum value (0) when there is no variety, i.e. when all individuals are classified in the same category. The maximum value depends on the number of categories and whether nodes can be evenly distributed across categories.

network_homophily

Given a partition of a network into a number of mutually exclusive groups then The E-I index is the number of ties between (or external) nodes grouped in some mutually exclusive categories minus the number of ties within (or internal) these groups divided by the total number of ties. This value can range from 1 to -1, where 1 indicates ties only between categories/groups and -1 ties only within categories/groups.

References

Blau, Peter M. (1977). Inequality and heterogeneity. New York: Free Press.

Krackhardt, David and Robert N. Stern (1988). Informal networks and organizational crises: an experimental simulation. Social Psychology Quarterly 51(2), 123-140.

See Also

Other measures: centralisation, centrality, closure, cohesion(), features, holes, tie_centrality

Examples

marvel_friends <- to_unsigned(ison_marvel_relationships, "positive")
network_diversity(marvel_friends, "Gender")
network_diversity(marvel_friends, "Attractive")
network_diversity(marvel_friends, "Gender", "Rich")
network_homophily(marvel_friends, "Gender")
network_homophily(marvel_friends, "Attractive")
network_assortativity(mpn_elite_mex)