{'fraction_non_alphanumeric': 0.029312288613303268, 'fraction_numerical': 0.013528748590755355, 'mean_word_length': 5.529411764705882, '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}}
Generating structured networks based on a weight-dependent deactivation mechanism.

Motivated by the degree-dependent deactivation model generating networks with high clustering coefficient [K. Klemm, Phys. Rev. E. 65, 036123 (2002)], a weight-dependent version is studied to model evolving networks. The growth dynamics of the network is based on a naive weight-driven deactivation mechanism which couples the establishment of new active vertices and the weights' dynamical evolution. Both analytical solutions and numerical simulations show that the generated networks possess a high clustering coefficient larger than that for regular lattices of the same average connectivity. Weighted, structured scale-free networks are obtained as the deactivated vertex is target selected at each time step, and weighted, structured exponential networks are realized for the random-selected case.