edgeList: Edge list.

Description Usage Arguments Details Value Author(s) References Examples

View source: R/netcoin.R

Description

Convert a coincidence/similarity/distance matrix into an edge list form.

Usage

1
2
3
4
edgeList(data, procedures="Haberman", 
         criteria="Z", level=.95, Bonferroni=FALSE, 
         min=-Inf, max=Inf, support=-Inf, directed=FALSE, 
         diagonal=FALSE, sort=NULL, decreasing=TRUE, pairwise=FALSE)

Arguments

data

a coin object, let's say an R matrix with frequencies and an attribute (n) giving the number of scenarios. In case of change of shape, data should be a matrix.

procedures

a vector of statistics of similarity. See below.

criteria

statistic to be use for selection criteria.

level

confidence level

Bonferroni

Bonferroni criterium of the signification test.

min

minimum value of the statistic to include the edge in the list.

max

maximum value of the statistic to include the edge in the list.

support

minimum value of the frequency of the coincidence to be edged

directed

includes same edges only once.

diagonal

includes auto-links

sort

sort the list according to the values of a statistic. See below

decreasing

order in a decreasing way.

pairwise

Pairwise mode of handling missing values if TRUE. Listwise by default.

Details

Possible measures in procedures are

Value

A data frame in which the two first columns are source and target. The rest of the columns are the different statistics explicited in funcs parameter.

Author(s)

Modesto Escobar, Department of Sociology and Communication, University of Salamanca. See https://sociocav.usal.es/blog/modesto-escobar/

References

Escobar, M. and Martinez-Uribe, L. (2020) Network Coincidence Analysis: The netCoin R Package. Journal of Statistical Software, 93, 1-32. doi: 10.18637/jss.v093.i11.

Examples

1
2
3
4
5
# From a random incidence matrix I(25X4)
I<-matrix(rbinom(100,1,.5),nrow=25,ncol=4,
dimnames=list(NULL,c("A","B","C","D")))
C<-coin(I)
edgeList(C)

netCoin documentation built on Oct. 29, 2021, 1:06 a.m.