assort_discrete: Newmans' Assortativity Coefficient

In knapply/homophily: Measuring Network Homophily

Description

Given a categorical vertex attribute describing mutually exclusive groups, the assortativity coefficient represents the tendency for nodes to form ties with similar alters.

Usage

assort_discrete(g, node_attr_name, ...)

assort_scalar(g, val1, val2 = NULL)

assort_degree(g)

Arguments

g	<igraph>, <network>
node_attr_name	<chr> The name of a node/vertex attribute in g.
...	Arguments passed to or from other methods.
val1	Continuous vector.
val2	Continuous vector.

Details

r = \frac{ ∑_i{e_{ii} - ∑_i{a_ib_i}} } {1 - ∑_i{a_ib_i} }

• e: mixing matrix

• e_{ii}: diagonal of mixing matrix

• a_i: row sums of mixing matrix

• b_i: column sums of mixing matrix

Author(s)

Brendan Knapp [e-mail]

References

M. E. J. Newman, Mixing patterns in networks, Physical Review E, 67 026126, 2003. https://arxiv.org/pdf/cond-mat/0209450.pdf.

Examples

data("faux.desert.high", package = "ergm")
assort_discrete(faux.desert.high, node_attr_name = "race")


data("sampson", package = "ergm")
assort_discrete(samplike, "group")

knapply/homophily documentation built on Nov. 4, 2019, 3:54 p.m.