{'fraction_non_alphanumeric': 0.018425460636515914, 'fraction_numerical': 0.0016750418760469012, 'mean_word_length': 4.862745098039215, '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}}
Some Remarks on the Asymptotic Behavior of the Lengths of a Collision Resolution Interval

We present an operator method for obtaining upper and lower bounds for the expected length of a collision resolution interval for various protocols. The method is elementary in that it circumvents the intricate and ingenious complex variable methods of Fayolle, Flajolet, and Hofri [2]. It is also noted that the method can be applied to computing bounds for the delay. A conjecture of Massey's and some of its implications, as well as some open questions of more than routine interest, are also discussed.