swan_efficiency

<code>swan_efficiency</code> measures the change in the sum of distances between all node pairs
when excluding a node from the network.

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

swan_efficiency function

<dl><dt>g</dt>
<dd>An <code>igraph</code> object representing the graph to analyze.
<code>swan_efficiency</code> is based on geographic accessibility, similar to indices used for
assessing transportation network performance, such as closeness accessibility.
It quantifies the impact of node removal by calculating the change in the sum of
distances between all node pairs.
The code is an adaptation from the NetSwan package that was archived on CRAN.</dd></dl>

Arguments

Impact on farness when a node is removed — swan_efficiency

<dl>

<dt>g</dt>
<dd>An <code>igraph</code> object representing the graph to analyze.
<code>swan_efficiency</code> is based on geographic accessibility, similar to indices used for
assessing transportation network performance, such as closeness accessibility.
It quantifies the impact of node removal by calculating the change in the sum of
distances between all node pairs.
The code is an adaptation from the NetSwan package that was archived on CRAN.</dd>

</dl>

swan_efficiency: Impact on farness when a node is removed

Description

Usage

Value

Arguments

References

Examples