I noticed this section in Kelvin's Gremlin book:

http://kelvinlawrence.net/book/Gremlin-Graph-Guide.html#_using_em_math_random_em_to_more_randomly_select_a_single_node

According to his findings, he seemed to notice that with TinkerGraph, it
tends to favor vertices with lower index values...is the sampling technique
expected to be overly biased that way? can it be improved?

Reply via email to