{'fraction_non_alphanumeric': 0.024070021881838075, 'fraction_numerical': 0.0, 'mean_word_length': 5.777777777777778, '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}}
Network Stability, Realisation and Random Model Generation

Dynamical structure functions (DSFs) provide means for modelling networked dynamical systems and exploring interactive structures thereof. There have been several studies on methods/algorithms for reconstructing (Boolean) networks from time-series data. However, there are no methods currently available for random generation of DSF models with complex network structures for benchmarking. In particular, it may be desirable to generate "stable" DSF models or require the presence of feedback structures while keeping topology and dynamics random up to these constraints. This work provides procedures to obtain such models. On the path of doing so, we first study essential properties and concepts of DSF models, including realisation and stability. Then, the paper suggests model generation algorithms, whose implementations are now publicly available.