{'fraction_non_alphanumeric': 0.022091310751104567, 'fraction_numerical': 0.0029455081001472753, 'mean_word_length': 4.483870967741935, '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}}
On the equivalence of flows in networks of queues

Consider a network of queues in equilibrium. When are the flows observed on two given links of that network equivalent, i.e., when do they have the same law? The verification of the equivalence of two such point processes is first reduced to an algebraic problem by a technique based on the filtering theory. This method is then used to show that the arrival and departure processes at an M/M/1 node in a Jackson network are not always equivalent, thereby contradicting a conjecture made in [8]. An example where that equivalence holds is also given; it provides new results on the time reversibility of some familiar processes.