EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
Data Mining and Knowledge Discovery , author=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A betweenness centrality for stochastic networks is defined via an absorbing Markov chain on sequences of reported central nodes, with importance given by pre-absorption occupancy and estimated by Monte Carlo.
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.
-
Betweenness Central Nodes Under Uncertainty: An Absorbing Markov Chain Approach
A betweenness centrality for stochastic networks is defined via an absorbing Markov chain on sequences of reported central nodes, with importance given by pre-absorption occupancy and estimated by Monte Carlo.