|
From: | Salvatore Loguercio |
Subject: | [igraph] Degree-preserving rewiring of a large graph |
Date: | Fri, 28 Mar 2014 11:01:19 -0700 |
User-agent: | Mozilla/5.0 (Windows NT 6.1; WOW64; rv:24.0) Gecko/20100101 Thunderbird/24.4.0 |
Hi,I am using igraph in R, and need a clarification about the rewire() function. The parameter niter is the number of times the algorithm will choose two arbitrary edges and shuffle them? So niter=10 would randomly shuffle only 10 pairs of edges?
I am working with a graph of ~150K edges - if my understanding of niter is correct, how many iterations would be recommended to obtain a reasonably rewired graph? I guess 150K iterations would take a while to compute.
My current problem is to compute the probability of observing each particular edge in a random graph with the same degree sequence. I was thinking of estimating this probability by the percentage of simulations in which an edge was observed.
Your suggestions would be really appreciated. Thanks, Sal
[Prev in Thread] | Current Thread | [Next in Thread] |