{'fraction_non_alphanumeric': 0.01532567049808429, 'fraction_numerical': 0.0019157088122605363, 'mean_word_length': 4.336734693877551, '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}}
Can the External Directed Edges of a Complete Graph Form a Radially Symmetric Field at Long Distance

Using a numerical method, the external directed edges of a complete graph are tested for their level of fitness in terms of how well they form a radially symmetric field at long distance (e.g., a test for the inverse square law in 3D space). It is found that the external directed edges of a complete graph can very nearly form a radially symmetric field at long distance if the number of graph vertices is great enough.