"True" self-avoiding walks on general trees
Pith reviewed 2026-05-08 01:55 UTC · model grok-4.3
The pith
True self-avoiding walks on trees switch from recurrent to transient exactly when the branching-ruin number exceeds 1/2.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The true self-avoiding walk with edge weights exp(-β n) after n traversals is almost surely recurrent when the branching-ruin number is less than 1/2 and almost surely transient when the branching-ruin number is greater than 1/2, with the critical value coinciding with the Hausdorff dimension of the tree boundary under a suitable metric.
What carries the argument
The branching-ruin number of the tree, which sets the threshold for the recurrence-transience transition by quantifying how the tree's growth competes with the exponential penalization of repeated edges.
Load-bearing premise
The branching-ruin number accurately locates the balance point between the tree's expansion and the exponential weight decay that decides whether the walk returns or escapes.
What would settle it
Compute or simulate the return probability of the walk on a tree with branching-ruin number known to be 0.6 and check whether it tends to zero (transient) or stays positive (recurrent).
read the original abstract
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse with probability proportional to the current weight of that edge, where the weight of each edge after being traversed $n$ times is given by $w(n)=\exp(-\beta n)$. We show that the process exhibits a sharp phase transition between recurrence and transience. The critical value is determined by the branching-ruin number of the tree, which coincides with the Hausdorff dimension of the boundary of the tree under a suitable metric. We prove that the walk is almost surely transient when the branching-ruin number is greater than $1/2$, and recurrent when it is less than $1/2$. This resolves an open question posed by Kosygina.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper analyzes true self-avoiding walks on infinite locally finite trees, where at each step the walk traverses a neighboring edge with probability proportional to its current weight w(n) = exp(-β n) after n prior traversals. It claims to establish a sharp phase transition for recurrence versus transience, with the critical threshold given by the branching-ruin number of the tree: the walk is a.s. transient when this number exceeds 1/2 and recurrent when it is below 1/2. The threshold is identified with the Hausdorff dimension of the tree boundary under the metric d(x,y) = exp(-c · dist(root, lca(x,y))), resolving an open question of Kosygina.
Significance. If the proofs hold, the result supplies a precise, geometrically interpretable criterion for the recurrence/transience dichotomy of this self-avoiding process on arbitrary trees rather than regular or regular-like ones. The direct comparison of escape probabilities to the branching-ruin number, together with the embedding into the boundary and the dimension identification, yields a parameter-free characterization that strengthens the link between the walk and the tree's metric geometry.
minor comments (3)
- [Introduction] The model definition in the introduction should explicitly state the range of β for which the phase transition holds (e.g., whether β > 0 is arbitrary or fixed), since the weight function depends on β yet the critical value 1/2 does not.
- [Proof of transience] The recursive estimates on weighted edges (used for both transience and recurrence) would benefit from a short appendix or subsection collecting the uniform constants that appear when passing from finite to infinite trees, to make the error controls fully transparent.
- [Main results] Notation for the branching-ruin number should be introduced once with a self-contained definition before its first use in the statement of the main theorem, rather than relying on the later identification with Hausdorff dimension.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our manuscript and the recommendation for minor revision. The report contains no major comments, so we have no specific points requiring rebuttal or revision at this stage. We will incorporate any minor suggestions in the revised version.
Circularity Check
No significant circularity; derivation is self-contained
full rationale
The paper establishes the phase transition via direct comparison of the walk's escape probability and effective resistance to the branching-ruin number, using recursive estimates on edge weights and an embedding of the tree into its boundary. The identification of the branching-ruin number with Hausdorff dimension under the exponential metric follows from standard dimension theory on trees and is not derived from the walk dynamics or any fitted parameter. No self-citations appear in the load-bearing steps, and the critical threshold of 1/2 is fixed by the geometric equivalence rather than by construction from the model itself. The proofs remain independent of the target result.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption The underlying graph is an infinite locally finite tree.
- domain assumption The weight of an edge after n traversals is w(n) = exp(-β n) for fixed β > 0.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.