Small-World networks is phenomenon that's demonstrated in certain networks and has distinct properties. The most familiar one property is called the 6-degree of separation. If you want to model such a network and you want to generate randomly, you may consider one of the simplest to play with such as Erdos-Renyi<http://igraph.sourceforge.net/doc/python/igraph.GraphBase-class.html#Erdos_Renyi>. If it is not doing what you hope for, try other models such as Barbasi-Albert<http://igraph.sourceforge.net/doc/python/igraph.GraphBase-class.html#Barabasi>, and or Watts-Storgatz<http://igraph.sourceforge.net/doc/python/igraph.GraphBase-class.html#Watts_Strogatz> .
Good luck! -Ahmed On Fri, Jan 24, 2014 at 4:11 PM, Ragia Ibrahim <[email protected]> wrote: > Hi, > how to generate this via igraph > > > > "Small-World Network: Begin with 5242 nodes arranged as a ring, and > each node > is connected to its two direct neighbors Next, each node to the > neighbors of its neighbors > Then , randomly select 4012 pairs of nodes not yet connected and add an > edge > between them. " > thanks in advance > RAE > > _______________________________________________ > 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
