{'fraction_non_alphanumeric': 0.03837471783295711, 'fraction_numerical': 0.004514672686230248, 'mean_word_length': 4.103448275862069, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
How Far Can a Biased Random Walker Go

The random walk (RW) is a very important model in science and engineering researches. It has been studied over hundreds years. However, there are still some overlooked problems on the RW. Here, we study the mean absolute distance of an N-step biased random walk (BRW) in a d-dimensional hyper-cubic lattice. In this short paper, we report the exact results for d = 1 and approximation formulae for d ≥ 2.