Robuta

https://openreview.net/forum?id=d1knqWjmNt Optimality of Message-Passing Architectures for Sparse Graphs | OpenReview We study the node classification problem on feature-decorated graphs in the sparse setting, i.e., when the expected degree of a node is $O(1)$ in the number of... message passing sparse graphs optimality architectures openreview https://arxiv.org/abs/1401.1137 [1401.1137] Sparse graphs using exchangeable random measures Abstract page for arXiv paper 1401.1137: Sparse graphs using exchangeable random measures sparse graphs 1401 1137 using exchangeable https://arxiv.org/abs/1202.0644v1 [1202.0644v1] Spectrum of Markov generators on sparse random graphs Abstract page for arXiv paper 1202.0644v1: Spectrum of Markov generators on sparse random graphs 1202 spectrum markov generators sparse https://jmlr.org/papers/v22/20-261.html A Unified Framework for Spectral Clustering in Sparse Graphs unified framework spectral clustering sparse graphs https://arxiv.org/abs/2307.09446 [2307.09446] Local central limit theorem for triangle counts in sparse random graphs Abstract page for arXiv paper 2307.09446: Local central limit theorem for triangle counts in sparse random graphs central limit theorem https://arxiv.org/html/2604.02949v1 Sample compression schemes for balls in structurally sparse graphs for balls sample compression schemes structurally https://openreview.net/forum?id=nadVPpcMvn On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model |... Local convergence has emerged as a fundamental tool for analyzing sparse random graph models. We introduce a new notion of local convergence, _color...