{'fraction_non_alphanumeric': 0.011090573012939002, 'fraction_numerical': 0.0, 'mean_word_length': 5.089887640449438, '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}}
Nonlinear walkers and efficient exploration of congested networks

This work explores the dynamics of an ensemble of interacting random walkers, hopping among nodes of a given network. The nodes are endowed with finite carrying capacity. A nonlinear function of the available space at the destination node, controls the tendency of the walkers to avoid nodes occupied by other walkers. Using the entropy rate the paper shows that an optimal crowding amount exists that maximizes the ability of the walkers to perform the network exploration.