graph.rmedge: Random Graph with Expected Edges
In taichi43/SNscan: Scan Statistics in Social Networks

Generate random graph with expected edges.

1	graph.rmedge(n, g, fix.edge = TRUE)

`n`	Integer value, the number of random graph.
`g`	An igraph object, a baseline graph for generating random graph.
`fix.edge`	When fix.edge = TRUE, the number of edges is fixed and equal to the number of edges in the original graph g. When fix.edge = FALSE, the number of edges is randomly generated according to the connection probability of the original graph g.

A data list in which each component is an igraph object.

Taichi Wang <taichi43@stat.sinica.edu.tw>

library(igraph)
g = graph.ring(10)
graph.rmedge(n=1,g=g,fix.edge = TRUE)
graph.rmedge(n=1,g=g,fix.edge = FALSE)

taichi43/SNscan documentation built on May 31, 2019, 2:48 a.m.

taichi43/SNscan index

README.md

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description