Random Walks with Anti-Correlated Steps

2005/12/10 by Dirk Wagner, Wagner, Dirk, John Noga +1
Computer Science · #Algorithms and Data Compression #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems #Performance (cs.PF) #cs.DM #cs.PF

paper · pdf · doi:10.48550/arxiv.cs/0512043

5 pages, 1 chart, 2 tables

arxiv created 2005/12/10 · openalex publication_date 2005/12/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We conjecture the expected value of random walks with anti-correlated steps to be exactly 1. We support this conjecture with 2 plausibility arguments and experimental data. The experimental analysis includes the computation of the expected values of random walks for steps up to 22. The result shows the expected value asymptotically converging to 1.

Related

• Correlated random walk
• Return Probabilities of Random Walks
• On a class of unbalanced step-reinforced random walks
• Recurrence, transience and anti-concentration of Rademacher random walks
• A note on the times of first passage for `nearly right-continuous'\n random walks