{'fraction_non_alphanumeric': 0.015587529976019185, 'fraction_numerical': 0.0, 'mean_word_length': 4.964285714285714, '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}}
Distributed Random Walks and the Design of a Self-Stabilizing Random Spanning Tree

We present a self–stabilized distributed algorithm for constructing a random spanning tree, making use of random walks as network traversal scheme. Our approach is novel and make use of distributed random walks, each one represented by a token annexing a territory over the underlying graph. These multiple random walks collapse into a final one, that defines the final territory and provides the random spanning tree. The scheme is parallel and make use of waves to merge very efficiently the spanning forest computed by the random walks into one final random spanning tree. The algorithm is said to be self–stabilized, because it uses a protocol that tolerate faults and adapt itself to dynamic topology changes. A proof of correctness is provided.