WorksMathematics
Sharp Norm Approximation of Covering Markov Operators
Abstract
We study the operator-norm approximation of Markov operators associated with finite graph coverings. Let be a connected covering of degree between finite connected graphs, and let be its fiber-averaging operator. We show that is not a finite convex combination of extreme Markov operators, although such combinations approximate arbitrarily well in operator norm. We determine the exact distances from to convex combinations of at most extreme Markov operators, with arbitrary or equal convex weights. If , where and , these distances are and , respectively. Both distances are attained and depend only on the covering degree and the number of terms . We also determine when equal weights are optimal and quantify the additional approximation error when they are not. Our proofs use total-variation estimates and continuous rearrangements of labelled weighted atoms. In particular, the unrestricted errors have a common scaled limit, while the equal-weight errors exhibit residue-dependent asymptotic behavior.