bmgraph: Bipartite multigraph

Description

A function to create and manipulate bipartite multigraphs with different layouts

Usage

bmgraph(net, layout = c("bip", "bip3", "bip3e", "bip4", "force", "rand", "circ"),  coord = NULL, tcex = NULL, alpha = c(1, 1, 1), showLbs = TRUE,  showAtts = TRUE, att = NULL, lbat = "1", main = NULL, cex.main, bg, mar,  cex, pos, lwd, lty, ecol, vcol, vcol0, asp, directed, collRecip,  seed = NULL, maxiter, bwd, clu, pch, tcol, hds, vedist, rot,  mirrorX, mirrorY, col, ...)

Arguments

net

data frame or array representing the two-mode network (see details)

layout

the layout for the visualization:

bip (default) bipartite graph

bip3 bipartite graph with three columns

bip3e bipartite graph with three columns for events

bip4 ``square'' bipartite graph

force force-directed algorithm

rand random

circ circular

coord

(optional) data frame with the coordinates of the vertices. If given layout is ignored

tcex

size of the vertex labels. If NULL, it depends on the value of cex

alpha

vector (vertex, edge, bg) with the alpha color transparecy

showLbs

(logical) whether or not show the vertex labels

showAtts

(logical) whether or not show the vertex attribute labels

att

(optional) a vector or an array representing the vertices' attributes

lbat

(optional) the labels for the vertices' attributes

main

(optional) title of the plot

cex.main

(optional) the size of the plot's title

(optional) the background color of the plot

mar

(optional) the margins of the plot

cex

(optional) the size of the vertices

pos

(optional) the position of the vertices' labels (0 means ``in the middle of the vertex'')

lwd

(optional) the width of the edges

lty

(optional) the shape of the edges

ecol

(optional) the color of the edges

vcol

(optional) the color of the vertices

vcol0

(optional) the color of the vertices' contour (only works for pch 21 through 25

asp

(optional) the aspect ratio of the plot

directed

(optional, logical) whether or not graph is unidrected (default)

collRecip

(optional, logical) whether or not collapse reciprocated edges in the unidrected graph (default TRUE)

seed

(optional) the random seed number for the vertices' initial coordinates. Ignored for other than force or rand

maxiter

(optional) the maximum number of iterations in the force directed algorithm (default 60 plus number of elements)

bwd

(optional) the width of the bundle edges. Ranges from 0 (edges collapsed) to the default 1 (depending on the vertices' size)

clu

(optional) the clustering of the vertices (see details)

pch

(optional) the symbol representing the vertices

tcol

(optional) the color of the vertices' labels

hds

(optional, experimental) arcs' head scale

vedist

(optional, experimental) a real with vertex - edge distance

rot

(optional) rotation of the graph in degrees

mirrorX

(optional) mirror of the X axis

mirrorY

(optional) mirror of the Y axis

col

(optional) same as vcol

...

Additional items

Value

A plot of the two-mode networks as bipartite graph or multigraph

Details

Bipartite graphs are visualization devices for two-mode networks. Although this type of data would typically record as a data frame, it is possible to use even three dimensional arrays where each level corresponds to a particular type of tie, and thus the bipartite graphs in this case will be depicted with parallel edges. Besides, it is possible to obtain a graph of the bipartite network using the binomial approach to two-mode data, and plot it with a forced directed algorithm.

Examples

Run this code

## Create the data: two binary relations among three elements
arr <- round( replace( array(runif(18), c(3,3,2)), array(runif(18),
       c(3,3,2))>.5, 3 ) )

## Plot this network as bipartite graph
bmgraph(arr)