{'fraction_non_alphanumeric': 0.013740458015267175, 'fraction_numerical': 0.0, 'mean_word_length': 4.963636363636364, '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}}
Random Key Graphs Can They be Small Worlds?

Random key graphs form a class of random graphs naturally associated with the random key predistribution scheme of Eschenauer and Gligor. We compute the clustering coefficients of random key graphs, and then compare them with Erdos-Renyi graphs in the many node regime when the expected average degrees are asymptotically equivalent. On the parameter range of practical relevance in wireless sensor networks, random key graphs are shown to be much more clustered than the corresponding Erdos-Renyi graphs. We also explore the suitability of random key graphs as small worlds in the sense of Watts and Strogatz.