
Last chance! 50% off unlimited learning
Sale ends in
preference.game(nodes, types, type.dist=rep(1, types),
pref.matrix=matrix(1, types, types), directed=FALSE, loops=FALSE)
asymmetric.preference.game(nodes, types,
type.dist.matrix=matrix(1,types,types),
pref.matrix = matrix(1, types, types), loops=FALSE)
preference.game
the probability that two vertices will be
connected depends on their type and is given by the
For asymmetric.preference.game
each vertex has an in-type and
an out-type and a directed graph is created. The probability that a
directed edge is realized from a vertex with a given out-type to a
vertex with a given in-type is given in the
establishment.game
.
callaway.traits.game
pf <- matrix( c(1, 0, 0, 1), nr=2)
g <- preference.game(20, 2, pref.matrix=pf)
tkplot(g, layout=layout.fruchterman.reingold)
pf <- matrix( c(0, 1, 0, 0), nr=2)
g <- asymmetric.preference.game(20, 2, pref.matrix=pf)
tkplot(g, layout=layout.circle)
Run the code above in your browser using DataLab