{'fraction_non_alphanumeric': 0.015355086372360844, 'fraction_numerical': 0.012476007677543186, 'mean_word_length': 5.063953488372093, '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}}
Adding local edge mobility to graph evolution

This study extends an earlier generative representation for the evolution of graphs to include a local reconfiguration operator, the hop operator, and a null operator. The hop operator is shown to be more effective in evolving graphs with a particular geometric character (eccentricity sequence). The null operator permits evolution to select the number of active commands used, avoiding a problem with needing to tune a “gene length” parameter. The representation is parametrized by the probability of each command appearing in initial populations and during mutation. A parameter study leads to a number of rules of thumb for using the new representation and it is found that the number of failures to find a solution, in 3000 attempts, varies from 17 in 3000 as the parameters are changed. The representation is tested on 100 instances of the eccentricity sequence matching problem. Use of the null operator has the beneficial side effect of reducing observed variation in problem difficulty.