Abstract: Graph Convolutional Networks (GCNs) have been widely studied for semi-supervised learning tasks. It is known that the graph convolution operations in most of existing GCNs are composed of ...
Abstract: This study proposes a general multi-class hierarchical random network with an arbitrary number of agents and an arbitrary connecting success probability to analyze the minimum communication ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback