7 Appendix 494 7.1 Polynomial regression examples

The algorithm is applied using fixed trust weights with 1/3 in each entry and is chosen as 1. 's are positive, and thus we have any product of Being fully connected implies being strongly connected. By the product being positive, we also have its diagonal entries being all positive. 's (of whatever length) is SIA. It is easy to verify that a positive matrix is always a scrambling matrix. As already has high diagonal values, the claim follows. 's to have such that a low quality node Thus, Proposition 4 is proved.