EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
Finding community structure in very large networks , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A note that flags an oversight in RLT convergence proofs for polynomial optimization and recovers correctness via one extra natural assumption.
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.
-
A note on the convergence guarantees of RLT-based algorithms for polynomial optimization
A note that flags an oversight in RLT convergence proofs for polynomial optimization and recovers correctness via one extra natural assumption.