{'fraction_non_alphanumeric': 0.046263345195729534, 'fraction_numerical': 0.012455516014234875, 'mean_word_length': 4.567656765676568, 'pattern_counts': {'":': 0, '<': 1, '<?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}}
Co-existence of Poisson and non-Poisson processes in ordered parallel multilane pedestrian traffic

We show that non-Poisson and Poisson processes can coexist in ordered parallel multilane pedestrian traffic, in the presence of lane switching which asymmetrically benefits the switchers and nonswitchers. Pedestrians join at the tail end of a queue and transact at the opposite front end. Their aim is to complete a transaction within the shortest possible time, and they can transfer to a shorter queue with probability ps. Traffic is described by the utilization parameter U = λ〈ts〉/N, where λ is the average rate of pedestrians entering the system, 〈ts〉 is the average transaction time, and N is the number of lanes. Using an agent-based model, we investigate the dependence of the average completion time 〈tc〉 with variable K = 1 + (1 − U)−1 for different N and 〈ts〉 values. In the absence of switching (ps = 0), we found that 〈tc〉 ∝ Kτ, where τ ≈ 1 regardless of N and 〈ts〉. Lane switching (ps = 1) reduces 〈tc〉 for a given K, but its characteristic dependence with K differs for nonswitchers and switchers in the same traffic system. For the nonswitchers, 〈tc〉 ∝ Kτ, where τ < 1. At low K values, switchers have a larger 〈tc〉 that also increases more rapidly with K. At large K, the increase rates become equal for both. For nonswitchers, the possible tc values obey an exponentially decaying probability density function p(tc). The switchers on the other hand, are described by a fat-tailed p(tc) implying that a few are penalized with tc values that are considerably longer than any of those experienced by nonswitchers. © 2006 Wiley Periodicals, Inc. Complexity 11: 35–42, 2006