If k > 0, the vertex is a minimum turning point If k < 0, the vertex is a maximum turning point We can identify these properties from a quadratics graph or equation.

We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected graphs of bounded degree. We stress that, unlike all ...