Tighter bounds on the expected absorbing time of Ungarian Markov chains
Open access0 citations
Abstract
Abstract In 2023 2023 $2023$ , Defant and Li defined the Ungarian Markov chain bold upper U Subscript upper L U L $\mathbf{U}_L$ associated to a finite lattice upper L L $L$ . This Markov chain has state space upper L L $L$ , and from any state x element of upper L x ∈ L $x \in L$ transitions to the meet of StartSet x EndSet union upper T { x } ∪ T $\{x\} \cup T$ , where upper T T $T$ is a randomly selected subset of the elements of upper L L $L$ covered by x x $x$ . For any lattice
// Source
Authors: Eric Shen
Institutions: University of Cambridge