rank_intervals

Calculate the maximal and minimal rank possible for each node
in any ranking that is in accordance with the partial ranking <code>P</code>.

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

rank_intervals function

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

Arguments

Author

Rank interval of nodes — rank_intervals

<dl>

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

</dl>

rank_intervals: Rank interval of nodes

Description

Usage

Value

Arguments

Author

Details

See Also

Examples