sort node positions in random geometric models

_sixdegrees/random_geometric_kleinberg.cpp

@@ -203,6 +203,10 @@ vector < set < size_t > * > random_geometric_kleinberg_neighbor_set(
         r.push_back( random_number(generator)*double(N) );
     }
 
+    // sort position so one knows that the node position 0 is the
+    // first in [0,N] and so forth
+    sort(r.begin(), r.end());
+
     vector < edge_distance > distances;
 
     // loop over all pairs and compute
@@ -360,6 +364,10 @@ vector < set < size_t > * > theoretical_random_geometric_kleinberg_neighbor_set(
         r.push_back( random_number(generator)*double(N) );
     }
 
+    // sort position so one knows that the node position 0 is the
+    // first in [0,N] and so forth
+    sort(r.begin(), r.end());
+
     // loop over all pairs and draw according to the right probability
     // (this is a lazy slow algorithm running in O(N^2) time
     for (size_t i = 0; i < N-1; ++i)

_sixdegrees/random_geometric_small_world.cpp

@@ -198,6 +198,10 @@ vector < set < size_t > * > random_geometric_small_world_neighbor_set(
         r.push_back( random_number(generator)*double(N) );
     }
 
+    // sort position so one knows that the node position 0 is the
+    // first in [0,N] and so forth
+    sort(r.begin(), r.end());
+
     // loop over all pairs and draw according to the right probability
     // (this is a lazy slow algorithm running in O(N^2) time
     size_t SR_edges = 0;

sandbox/kleinberg_random_geometric_test.py

@@ -6,7 +6,7 @@
 import scipy.sparse as sprs
 import progressbar
 
-N = 10000
+N = 1000
 k = 7
 mu = -1