transitive_reduction

Calculates the transitive reduction of a partial ranking.

Implements methods for centrality related analyses of networks.
While the package includes the possibility to build more than 20 indices,
its main focus lies on index-free assessment of centrality via partial
rankings obtained by neighborhood-inclusion or positional dominance. These
partial rankings can be analyzed with different methods, including
probabilistic methods like computing expected node ranks and relative
rank probabilities (how likely is it that a node is more central than another?).
The methodology is described in depth in the vignettes and in
Schoch (2018) <doi:10.1016/j.socnet.2017.12.003>.

David Schoch

netrankr

Analyzing Partial Rankings in Networks

Julian Müller

transitive_reduction function

<dl><dt>P</dt>
<dd>A partial ranking as matrix object calculated with neighborhood_inclusion
or positional_dominance.</dd></dl>

Arguments

Author

Transitive Reduction — transitive_reduction

<dl>

<dt>P</dt>
<dd>A partial ranking as matrix object calculated with neighborhood_inclusion
or positional_dominance.</dd>

</dl>

transitive_reduction: Transitive Reduction

Description

Usage

Value

Arguments

Author

Examples