{'fraction_non_alphanumeric': 0.024355300859598854, 'fraction_numerical': 0.0, 'mean_word_length': 4.9743589743589745, '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}}
Further properties of random walks on diagrams (graphs) with and without cycles.

Three problems are considered. The first is the relation between ensemble-averaged state probabilities in a random walk with absorption and time-averaged state probabilities in the corresponding closed diagram. The second problem is concerned with random walks on diagrams with cycles in which the cycle completion rates and probabilities may depend on the "remainder" after the previously completed cycle. The final topic is a study of cycle completions prior to absorption for diagrams that involve both cycles and absorption (e.g., a cycling enzyme that binds a dead-end inhibitor or poison in one of its states).