[igraph] Degree-preserving rewiring of a large graph

[Salvatore Loguercio]

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