{'fraction_non_alphanumeric': 0.05929487179487179, 'fraction_numerical': 0.014423076923076924, 'mean_word_length': 4.434782608695652, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 2, '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}}
Territory covered by N random walkers.

The problem of evaluating the number of distinct sites S(N)(t) covered up to time t by N random walkers is revisited. For the nontrivial time regime and for N>>1 we show how to get the asymptotic behavior of S(N)(t) and we calculate the main and first two corrective terms. The mth corrective term decays mildly as 1/ln(m) N. For d-dimensional (d=1,2,3) simple cubic lattices, the main term is the volume of the hypersphere of radius [(ln N(2))2Dt/d](1/2), D being the diffusion constant, and the corrective terms account for the roughening of the surface of the set of visited sites.