mlsanityData to 14 Oct 2026

On Statistical Estimation of Edge-Reinforced Random Walks

arXiv 2503.06115 ↗First posted 8 Mar 2025stat.ML cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Reinforced random walks (RRWs), including vertex-reinforced random walks (VRRWs) and edge-reinforced random walks (ERRWs), model random walks where the transition probabilities evolve based on prior visitation history~citemgr, fmk, tarres, volkov. These models have found applications in various areas, such as network representation learning~citexzzs, reinforced PageRank~citegly, and modeling animal behaviors~citesmouse, among others. However, statistical estimation of the parameters governing RRWs remains underexplored. This work focuses on estimating the initial edge weights of ERRWs using observed trajectory data. Leveraging the connections between an ERRW and a random walk in a random environment (RWRE)~citemr, mr2, as given by the so-called ``magic formula", we propose an estimator based on the generalized method of moments. To analyze the sample complexity of our estimator, we exploit the hyperbolic Gaussian structure embedded in the random environment to bound the fluctuations of the underlying random edge conductances.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 29 references that are in the map. First posted on arXiv 8 Mar 2025.

Builds on

3 of 29 references.

References · 3

  1. 2016The Spacey Random Walk: a Stochastic Process for Higher-order Datacited by 13
  2. 2014FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphscited by 6
  3. 2020Vertex-reinforced Random Walk for Network Embeddingcited by 3

Built on by

Not cited yet.