ネットワーク分析の再勉強。
# snaパッケージ library(sna) el.sna <- matrix(c( 1, 2, 1, 2, 1, 1, 1, 3, 1, 3, 1, 1, 1, 4, 1, 4, 1, 1, 5, 2, 1, 5, 6, 1, 6, 5, 1, 6, 2, 1, 7, 2, 1, 8, 2, 1, 9, 2, 1, 10, 2, 1, 11, 2, 1, 12, 2, 1, 13, 2, 1, 14, 3, 1, 15, 3, 1, 16, 3, 1, 17, 3, 1, 18, 3, 1, 19, 3, 1, 20, 3, 1, 21, 4, 1, 22, 4, 1, 23, 4, 1, 24, 4, 1, 25, 4, 1), ncol=3, byrow=TRUE) attr(el.sna, "n") <- 25 gplot(el.sna, mode="kamadakawai", displaylabels=TRUE) gden(el.sna) # 密度 gtrans(el.sna) # 推移性 # igraphパッケージ library(igraph) el.igraph <- graph.edgelist(matrix(c( "A", "B", "B", "A", "A", "C", "C", "A", "A", "D", "D", "A", "E", "B", "F", "B", "E", "F", "F", "E", "G", "B", "H", "B", "I", "B", "J", "B", "K", "B", "L", "B", "M", "B", "N", "C", "O", "C", "P", "C", "Q", "C", "R", "C", "S", "C", "T", "C", "V", "D", "W", "D", "X", "D", "Y", "D", "Z", "D"), ncol=2, byrow=TRUE)) plot(el.igraph, layout=layout.kamada.kawai, vertex.label=V(el.igraph)$name) graph.density(el.igraph) # 密度 transitivity(el.igraph) # 推移性