For almost all choices of interaction parameters, the empirical occupation measures of interacting vertex-reinforced random walks converge almost surely to a fixed point of the transition map, whose support structure is characterized by a system of linear equations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Interacting vertex reinforced random walks on complete sub-graphs
For almost all choices of interaction parameters, the empirical occupation measures of interacting vertex-reinforced random walks converge almost surely to a fixed point of the transition map, whose support structure is characterized by a system of linear equations.