Occupation-condensation transition of a sublinearly vertex-reinforced random walk on regular tree

What the math gives to ML

The paper identifies a sharp occupation-condensation transition in a sublinearly reinforced walk on a regular tree: exploration dominates below a critical reinforcement strength, while above it one vertex retains an O(1) occupation fraction even though the range continues to grow slowly. The transferable mechanism is a tunable exploration-versus-reuse controller for hierarchical routing, with a predicted threshold scaling as \(\beta_c\propto b-1\), where \(b\) is the branching factor. A neural implementation can use sublinear visit-count bonuses in a tree-structured mixture-of-experts or adaptive-computation router, and should be tested for the predicted bimodal occupancy and sharp transition rather than only average accuracy.