Erdős–Rényi graph

The Erdős–Rényi graph is a type of random graph characterized by a fixed number of nodes where each pair of nodes is connected with a certain probability, and it is used to evaluate the expressive power of Graph Neural Networks in relation to their performance on node classification tasks.

Papers using Erdős–Rényi graph (1)

Graph Neural Networks Exponentially Lose Expressive Power for Node Classification2019 · 188 cites