Doubly stochastic graph shifts are shown to be bounded in expectation and to converge to the mean for i.i.d. signals as neighborhoods grow, though the 'isometry' label is an overstatement.
Graph Signal Processing: Overview, Challenges, and Ap- plications,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Class of Doubly Stochastic Shift Operators for Random Graph Signals and their Boundedness
Doubly stochastic graph shifts are shown to be bounded in expectation and to converge to the mean for i.i.d. signals as neighborhoods grow, though the 'isometry' label is an overstatement.