Graphs with treewidth ≤ k have spanning-tree polynomials T_G such that T_G^{-β} is completely monotone for every β > (k-1)/2.
Random Walks and Electric Networks
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
abstract
A popular account of the connection between random walks and electric networks.
citation-role summary
background 1
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
A metric learning method is introduced to learn distance metrics that best capture conditional anomaly patterns in instance-based detection.
Instance-based conditional anomaly detection with optimized distance metrics detects unusual patient-management decisions in two real-world medical datasets.
citing papers explorer
-
Bounded Treewidth and Complete Monotonicity for Scott-Sokal Spanning-Tree Polynomials
Graphs with treewidth ≤ k have spanning-tree polynomials T_G such that T_G^{-β} is completely monotone for every β > (k-1)/2.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
-
Distance metric learning for conditional anomaly detection
A metric learning method is introduced to learn distance metrics that best capture conditional anomaly patterns in instance-based detection.
-
Conditional anomaly detection methods for patient-management alert systems
Instance-based conditional anomaly detection with optimized distance metrics detects unusual patient-management decisions in two real-world medical datasets.