On spectrally optimal duals for r-erasures of frames generated by graphs
Abstract
In [9], authors studied spectrally optimal dual frames for 1-erasure and 2-erasures of frames generated by graph. In this paper, we study spectrally optimal dual frames for r-erasures. We show that the spectral radius of the error operator of unitary equivalent frames is same with respect to their respective canonical dual frames. We prove that if a frame is generated by a connected graph, then its canonical dual frame is the unique spectrally optimal dual frame for r-erasures. Further, we show that the canonical dual of frames generated by disconnected graphs are non-unique spectrally optimal dual frames for r-erasures.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.