Over-smoothing is the core bottleneck of deep neural network construction. In order to alleviate the over-smoothing phenomenon in the process of graph learning, we propose a graph convolution network ...

In this paper, we propose a novel average consensus algorithm for time-varying directed graphs that can protect the confidentiality of a participating agent against other participating agents.