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 ...

Every link in ℝ3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams. Journal Information This monthly journal, begun in 1950, is devoted ...