These functions return logical vectors the length of the ties in a network:

  • tie_is_random() marks one or more nodes at random.

  • tie_is_max() and tie_is_min() are more generally useful for converting the results from some node measure into a mark-class object. They can be particularly useful for highlighting which node or nodes are key because they minimise or, more often, maximise some measure.

tie_is_random(.data, size = 1)

tie_is_max(tie_measure)

tie_is_min(tie_measure)

Arguments

.data

An object of a manynet-consistent class:

  • matrix (adjacency or incidence) from {base} R

  • edgelist, a data frame from {base} R or tibble from {tibble}

  • igraph, from the {igraph} package

  • network, from the {network} package

  • tbl_graph, from the {tidygraph} package

size

The number of nodes to select (as TRUE).

tie_measure

An object created by a tie_ measure.

See also

Examples

# tie_is_max(migraph::tie_betweenness(ison_brandes))
#tie_is_min(migraph::tie_betweenness(ison_brandes))