The problem
One global σ does not fit every neighborhood.
Gaussian-kernel graph methods depend strongly on bandwidth. At one extreme, the graph fragments because the kernel resolves spurious directions. At the other, distinct directions become indistinguishable. The challenge is to select the useful scale locally.