{'fraction_non_alphanumeric': 0.029661016949152543, 'fraction_numerical': 0.00847457627118644, 'mean_word_length': 4.630952380952381, '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}}
On the connectivity of graphs generated by a sum of random mappings

We consider four models of random directed multigraphs with n labeled vertices of out-degree d. First we establish formal relationships between our models with respect to exact and asymptotic (as n ∞) probabilities of possessing a graph monotone property. We also study the asymptotic behavior of the strength of connectivity of the underlying simple graphs when d = o(n). © 1993 John Wiley & Sons, Inc.