Post #242

Fresh picks from ArXiv This week discusses ways to compute a distance between graphs, fast triangle counting, and a new i.i.d. test 🧪 GNN • Adversarial Directed Graph Embedding with Philip S. Yu • CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams with Christos Faloutsos • Network comparison and the within-ensemble graph distance Math • Using Expander Graphs to test whether samples are i.i.d Surveys • Graph Signal Processing for Geometric Data and Beyond: Theory and Applications • Graph Neural Networks: Architectures, Stability and Transferability • Random Walks: A Review of Algorithms and Applications • Big Networks: A Survey