On Sat, Jan 25, 2014 at 6:51 AM, Tamás Nepusz <[email protected]> wrote:
> > thanks for replying > > is this true for the first graph > > watts.strogatz.game(5242 ,5242 ,2,0) ? > > No. Use graph.ring to generate a ring graph. Use graph.erdos.renyi to > create a graph that contains randomly selected edges. Use graph.union to > create the union of them. > You need to use watts.strogatz.game() because the nodes connect to the second neighbors on the ring must be connected. So use watts.strogatz.game() with zero rewiring probability for this. Then you can create the union of this and an E-R network, the only (slight) problem is that you might end up with some multiple edges. G. > > T. > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
