arXiv Machine Learning
Partially Observed Sparse Graphs: The Unknown Sampling Rate is a Tail Index
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 18
Robust Detection of Planted Subgraphs in Semi-Random Models
arXiv:2508. 02158v2 Announce Type: replace-cross Abstract: Detection of planted subgraphs in Erd\"os-R\'enyi random graphs has been extensively studied, leading to a rich body of results characterizing both statistical and computational thresholds.
arXiv Machine Learning
Jun 15
Recovery thresholds for hidden weighted sparse graphs
arXiv:2606. 14335v1 Announce Type: cross Abstract: Recovering structural information from noisy high-dimensional data is a fundamental task in statistical inference.
arXiv Machine Learning
Jul 8
A Fast Binary Splitting Approach for Non-Adaptive Learning of Erd\H{o}s--R\'enyi Graphs
arXiv:2511. 17240v3 Announce Type: replace-cross Abstract: We study the problem of learning an unknown graph via group queries on node subsets, where each query reports whether at least one edge is present among the queried nodes.
arXiv Statistics ML
Sep 10
CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs
arXiv:2609.09255v1 Announce Type: new Abstract: Graph-data workloads such as diffusion estimation, ranking, semi-supervised learning, and network optimization often solve many Laplacian or symmetric...
arXiv Machine Learning
Jul 21
The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy
arXiv:2607. 16676v1 Announce Type: cross Abstract: How deep does a graph neural network need to be on a sparse graph?
arXiv Machine Learning
Jun 2
Query-Limited Community Recovery in Stochastic Block Models
arXiv:2606. 02055v1 Announce Type: cross Abstract: We study exact community recovery in the two-community stochastic block model on $n$ vertices under limited and noisy access to network data.