Proves O(log n) upper bounds on L1 and spectral norms of electrical flows and transfer currents in graphs, tightening prior O(log² n) results.
Approximate Spanning Tree Counting from Uncorrelated Edge Sets
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Tight Bound on Localization of Electrical Flows
Proves O(log n) upper bounds on L1 and spectral norms of electrical flows and transfer currents in graphs, tightening prior O(log² n) results.