Balance rate quantifies stability in uncertain signed graphs; exact computation is NP-hard but a Rao-Blackwellized spanning-tree estimator achieves near-linear time per sample with Delta-method intervals.
Title resolution pending
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
-
Finding the Balance Rate of Uncertain Signed Graphs
Balance rate quantifies stability in uncertain signed graphs; exact computation is NP-hard but a Rao-Blackwellized spanning-tree estimator achieves near-linear time per sample with Delta-method intervals.