betaFeedback

WorksMathematics

Sharp Norm Approximation of Covering Markov Operators

Abstract

We study the operator-norm approximation of Markov operators associated with finite graph coverings. Let q:Y→Xq:Y\to X be a connected covering of degree d≥2d\geq 2 between finite connected graphs, and let Aq:C(Y)→C(X)A_q:C(Y)\to C(X) be its fiber-averaging operator. We show that AqA_q is not a finite convex combination of extreme Markov operators, although such combinations approximate AqA_q arbitrarily well in operator norm. We determine the exact distances from AqA_q to convex combinations of at most mm extreme Markov operators, with arbitrary or equal convex weights. If m=kd+rm=kd+r, where k≥0k\geq 0 and 1≤r≤d1\leq r\leq d, these distances are 2(d−r+1)/[d(k(d−r+1)+1)]2(d-r+1)/[d(k(d-r+1)+1)] and 2r(d−r+1)/(dm)2r(d-r+1)/(dm), respectively. Both distances are attained and depend only on the covering degree dd and the number of terms mm. 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.

Paper details

vlnc:W_ynf32h85
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…