EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
2012 Temporal networks.Physics Reports519, 97–125
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Witness motifs in constrained geometric graphs saturate Weyl bounds on Laplacian perturbations under heavy-tailed noise, with new metrics SC and S3I to distinguish noise-driven spectral effects.
Extends linear response theory to nonautonomous systems and applies it to optimal fingerprinting for attributing changes to multiple forcings in time-dependent backgrounds, with numerical tests on a climate model.
citing papers explorer
-
Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks
EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
-
Spectral Effects Of Heavy-Tailed Vertex Noise In Geometric Graphs
Witness motifs in constrained geometric graphs saturate Weyl bounds on Laplacian perturbations under heavy-tailed noise, with new metrics SC and S3I to distinguish noise-driven spectral effects.
-
Linear Response and Optimal Fingerprinting for Nonautonomous Systems
Extends linear response theory to nonautonomous systems and applies it to optimal fingerprinting for attributing changes to multiple forcings in time-dependent backgrounds, with numerical tests on a climate model.