We lifted 2 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| tpfi22/spectral-and-combinatorial | canonical | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| random_permutation | Ran | tpfi22/spectral-and-combinatorial/synthetic_test.py pointer only (licence: NONE) · get_code("318852e537346161") |
| separate_data | Ran | tpfi22/spectral-and-combinatorial/synthetic_test.py pointer only (licence: NONE) · get_code("daf944d5755f7291") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph isomorphism testing is usually approached via the comparison of graph invariants. Two popular alternatives that offer a good trade-off between expressive power and computational efficiency are combinatorial (i.e., obtained via the Weisfeiler-Leman (WL) test) and spectral invariants. While the exact power of the latter is still an open question, the former is regularly criticized for its limited power, when a standard configuration of uniform pre-coloring is used. This drawback hinders the applicability of Message Passing Graph Neural Networks (MPGNNs), whose expressive power is upper bounded by the WL test. Relaxing the assumption of uniform pre-coloring, we show that one can increase the expressive power of the WL test ad infinitum. Following that, we propose an efficient pre-coloring based on spectral features that provably increase the expressive power of the vanilla WL test. The above claims are accompanied by extensive synthetic and real data experiments. The code to reproduce our experiments is available at https://github.com/TPFI22/Spectral-and-Combinatorial
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.13410")
get_code_for_paper("2201.13410")
have("2201.13410")
Connect an agent — have() is free.