{'fraction_non_alphanumeric': 0.012552301255230125, 'fraction_numerical': 0.0, 'mean_word_length': 4.983333333333333, '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}}
The Impact of Complex Network Models to EDAs

The study conducted in this paper is mainly driven by the topological characteristics of the structures that the interactions among the variables of the problems provide. Taking as reference the emergent field of complex networks, we generate a wide spectrum of networks that will serve as problem structures. Then, the impact that the topological characteristics of those networks have, both in the hardness of the optimization problem and in the behavior of the EDA, is analyzed. This reveals a relationship among the topology of the problem structure, the difficulty of the problems and the dependences that the algorithm needs to learn in order to solve the problems.