biconnected_network

The data set can be used to explore simple different embeddings methods on a very simple graph

datasets

An R implementation for the Strain Elevation and
Tension embedding algorithm from Bourne (2020)
<doi:10.1007/s41109-020-00329-4>. The package embeds graphs and
networks using the Strain Elevation and Tension embedding (SETSe)
algorithm. SETSe represents the network as a physical system, where
edges are elastic, and nodes exert a force either up or down based on
node features. SETSe positions the nodes vertically such that the
tension in the edges of a node is equal and opposite to the force it
exerts for all nodes in the network. The resultant structure can then
be analysed by looking at the node elevation and the edge strain and
tension. This algorithm works on weighted and unweighted networks as
well as networks with or without explicit node features. Edge
elasticity can be created from existing edge weights or kept as a
constant.

Jonathan Bourne

rsetse

Strain Elevation Tension Spring Embedding

biconnected_network function

An igraph network with 7 nodes and 19 edges which forms three biconnected components:<dl class="dl-horizontal">
 <dt>edge_name</dt><dd>The name of the edge connecting the two vertices</dd>
 <dt>weight</dt><dd>The edge weight connecting the two vertices. This value is 1000 for edges connecting nodes
 A to D, it is 500 for edges connecting nodes E to G, it is 100 connecting nodes D and E</dd>
 <dt>force</dt><dd>The force produced by each node. It was calculated by subtracting the mean node centrality for the network
 from the node centrality</dd>
 <dt>group</dt><dd>The group each node is in. This can be used to generate force if required</dd>
</dl>

Format

A simple network made of three bi-connected components — biconnected_network

An igraph network with 7 nodes and 19 edges which forms three biconnected components:<dl class='dl-horizontal'>
 <dt>edge_name</dt><dd>The name of the edge connecting the two vertices</dd>
 <dt>weight</dt><dd>The edge weight connecting the two vertices. This value is 1000 for edges connecting nodes
 A to D, it is 500 for edges connecting nodes E to G, it is 100 connecting nodes D and E</dd>
 <dt>force</dt><dd>The force produced by each node. It was calculated by subtracting the mean node centrality for the network
 from the node centrality</dd>
 <dt>group</dt><dd>The group each node is in. This can be used to generate force if required</dd>
</dl>

biconnected_network: A simple network made of three bi-connected components

Description

Usage

Arguments

Format

Examples