relInv

relInv2

For a vector x, it computes <code>x[1]/x</code>. For <code>relInv2</code>, if certain elements of the result are not finite (e.g. if certain elements of x are 0), these elements are replaced with 0s.

manip

This is primarily meant as an implementation of generalized blockmodeling for valued networks.
In addition, measures of similarity or dissimilarity based on structural equivalence and
regular equivalence (REGE algorithms) can be computed and partitioned matrices can be plotted:
Žiberna (2007)<doi:10.1016/j.socnet.2006.04.002>, Žiberna (2008)<doi:10.1080/00222500701790207>,
Žiberna (2014)<doi:10.1016/j.socnet.2014.04.002>.

Ales Ziberna

blockmodeling

Generalized and Classical Blockmodeling of Valued Networks

Aleš Žiberna

Marjan Cugmas

relInv function

<dl><dt>x</dt>
<dd>A numeric vector. For <code>relInv</code> it should not contain 0s (while for <code>relInv2</code> it can).</dd></dl>

Arguments

Author

Functions for computing "relative inverse" (x[1]/x). — relInv

<dl>

<dt>x</dt>
<dd>A numeric vector. For <code>relInv</code> it should not contain 0s (while for <code>relInv2</code> it can).</dd>

</dl>

relInv: Functions for computing "relative inverse" (`x[1]/x`).

Description

Usage

Value

Arguments

Author