Rate-Optimal Subspace Estimation on Random Graphs Zhixin Zhou 1, Fan Zhou 2, Ping Li

This will be proved as follows. Hence, the upper bound of condition (b) is satisfied. Now we introduce the Fano's inequality. We will use the version provided by [24] in our proofs. We firstly consider entrywise KL-divergence.