Name
Abstract | ||
|---|---|---|
We propose an alternative maximum entropy approach to learning the spectra of massive graphs. In contrast to state-of-the-art Lanczos algorithm for spectral density estimation and applications thereof, our approach does not require kernel smoothing. As the choice of kernel function and associated bandwidth heavily affect the resulting output, our approach mitigates these issues. Furthermore, we prove that kernel smoothing biases the moments of the spectral density. Our approach can be seen as an information-theoretically optimal approach to learning a smooth graph spectral density, which fully respects moment information. The proposed method has a computational cost linear in the number of edges, and hence can be applied even to large networks with millions of nodes. We showcase the approach on problems of graph similarity learning and counting cluster number in the graph, where the proposed method outperforms existing iterative spectral approaches on both synthetic and real-world graphs. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.3390/a15060209 | ALGORITHMS |
Keywords | DocType | Volume |
maximum entropy, graph spectrum, graph similarity, cluster counting, Lanczos method | Journal | 15 |
Issue | ISSN | Citations |
6 | 1999-4893 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diego Granziol | 1 | 0 | 0.34 |
| Bin Xin Ru | 2 | 1 | 4.42 |
| Xiaowen Dong | 3 | 249 | 22.07 |
| Stefan Zohren | 4 | 0 | 0.34 |
| Michael Osborne | 5 | 250 | 33.49 |
| stephen j roberts | 6 | 1244 | 174.70 |