For every maximum degree Δ ≥ 3, no computable function of the error ε and radius r bounds the size of a graph that reproduces r-neighborhood statistics up to ε.
Processes on unimodular random networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The ineffectiveness of the regularity lemma for bounded degree graphs
For every maximum degree Δ ≥ 3, no computable function of the error ε and radius r bounds the size of a graph that reproduces r-neighborhood statistics up to ε.