Hello, Here is the sample() code:
https://github.com/apache/tinkerpop/blob/master/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/filter/SampleGlobalStep.java
<https://github.com/apache/tinkerpop/blob/master/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/filter/SampleGlobalStep.java>
Marko.
http://markorodriguez.com
> On Oct 13, 2017, at 6:43 AM, Stephen Mallette <[email protected]> wrote:
>
> 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?
