In this paper, we consider the problem of recovering random graph signals with complex values. For general Bayesian estimation complex-valued vectors, it is known that widely-linear minimum mean-squared-error (WLMMSE) estimator can achieve a lower (MSE) than linear MSE (LMMSE) estimator. Inspired by WLMMSE estimator, in paper develop signal processing (GSP)-WLMMSE which minimizes among estimato...

Graph signal sampling is the problem of selecting a subset representative graph vertices whose values can be used to interpolate missing on remaining vertices. Optimizing choice set using concepts from experiment design help minimize effect noise in input signal. While many existing selection methods are computationally intensive because they require an eigendecomposition, eigendecomposition-fr...

The perfect quantum strategies of a linear system game correspond to certain representations its solution group. We study the groups graph incidence games, which are games in underlying is (non-properly) two-coloured graph. While it undecidable determine whether general has strategy, for this problem solved by Arkhipov’s theorem, states that connected strategy if and only either classical or no...

Abstract Given a closed linear relation T between two Hilbert spaces $$\mathcal {H}$$ H and {K}$$ K , the corresponding first second coordinate projections $$P_T$$ P T $$Q_T$$ Q are both contractions from to respectivel...