Loop-erased random walk on a torus in dimensions 4 and above
classification
🧮 math.PR
math-phmath.MP
keywords
lengthrandomtoruswalkabovebounddimensiondimensions
read the original abstract
Sharp estimates for the length of loop erased random walk between two vertices on the [n]^d -torus, d > 4, are established. The mean length is order n^{d/2} . In dimension 4 we have only an upper bound.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.