Re: [igraph] Small-World Network

[Ragia Ibrahim]

 

thanks for replying
is this true for the first graph
watts.strogatz.game(5242 ,5242 ,2,0) ?

how to  
"randomly select 4012 pairs of nodes not yet connected and add an edge
between them. In total, this will make m = 5242 · 2 + 4012 = 14496 edges."


thanks in advance


RAE

From: address@hidden
Date: Fri, 24 Jan 2014 22:34:25 -0500
To: address@hidden
Subject: Re: [igraph] Small-World Network

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. If it is not doing what you hope for, try other models such as Barbasi-Albert, and or Watts-Storgatz.

Good luck!

-Ahmed

On Fri, Jan 24, 2014 at 4:11 PM, Ragia Ibrahim <address@hidden> 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
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help

_______________________________________________ igraph-help mailing list address@hidden https://lists.nongnu.org/mailman/listinfo/igraph-help