{'fraction_non_alphanumeric': 0.0130475302889096, 'fraction_numerical': 0.0, 'mean_word_length': 5.033707865168539, '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}}
A new approach combining simulation and randomization for the analysis of large continuous time Markov chains

A new analysis method for continuous time Markov chains is introduced. The method combines, in some sense, simulation and numerical techniques for the analysis of large Markov chains. The basis of the new method is the description of a continuous-time Markov chain as a set of communicating processes. The state of all or some of the processes is described by a state vector, including a probability distribution over the set of locally reachable states. Simulation is used to determine the event times and message types exchanged between processes. Local transitions are realized by vector matrix products describing the next state distribution form the current one. In this way, the state explosion problem of numerical analysis is avoided, but it is still possible to obtain more accurate results that with pure simulation. The approach is therefore especially useful for the analysis of quantities with small probabilities or for the analysis of rare events.