{'fraction_non_alphanumeric': 0.02830188679245283, 'fraction_numerical': 0.0015723270440251573, 'mean_word_length': 4.6875, '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}}
The quasi-birth-death type markov chain with a tree structure

In this paper we extend the notion of the quasi-birth-death (QBD) Markov chain to the QBD-type Markov chain with a d-ary tree structure, and investigate various structural properties of such Markov chains. We first obtain an explicit solution for the matrices . The result is then applied to the preemptive MAP/PH/1 queue with last come first served discipline. We obtain a duality result when the QBD-type Markov chain satisfies a certain symmetrical condition. Finally, we establish a relationship between , which generalizes the previous result by Latouche and Ramaswami