The structure of a network plays a key role in the outcome of dynamical processes operating on it. Two prevalent network descriptors are the degree distribution and the global clustering. However, when generating networks with a prescribed degree distribution and global clustering, it has been shown that changes in structural properties other than that controlled for are induced and these changes have been found to alter the outcome of spreading processes on the network. This therefore begs the question of our understanding of the potential diversity of networks sharing a given degree distribution and global clustering. As the space of all possible networks is too large to be systematically explored, a heuristic approach is needed. In our genetic algorithm-based approach, networks are encoded by their subgraph counts from a chosen family of subgraphs. Coverage of the space of possible networks is then maximised by focusing the search through optimising the diversity of counts by the Map-Elite algorithm. We provide preliminary evidence of our approach’s ability to sample from the space of possible networks more widely than some state of the art methods.
['Peter Overbury', 'Istvan Z. Kiss', 'Luc Berthouze']
A genetic algorithm-based approach to mapping the diversity of networks sharing a given degree distribution and global clustering