{'fraction_non_alphanumeric': 0.021645021645021644, 'fraction_numerical': 0.0008658008658008658, 'mean_word_length': 4.639024390243902, '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}}
Random walks on intersecting geometries.

We present an analytical approach to study simple symmetric random walks on a crossing geometry consisting of a plane square lattice crossed by n_{l} number of lines that all meet each other at a single point (the origin) on the plane. The probability density to find the walker at a given distance from the origin either in a line or in the plane geometry is exactly calculated as a function of time t. We find that the large-time asymptotic behavior of the walker for any arbitrary number n_{l} of lines is eventually governed by the diffusion of the walker on the plane after a crossover time approximately given by t_{c}∝n_{l}^{2}. We show that this competition can be changed in favor of the line geometry by switching on an arbitrarily small perturbation of a drift term in which even a weak biased walk is able to drain the whole probability density into the line at long-time limit. We also present the results of our extensive simulations of the model which perfectly support our analytical predictions. Our method can, however, be simply extended to other crossing geometries with a single common point.