Combining the RAES threshold link-acceptance rule with streaming node churn produces dynamic expanders with bounded degree, and the paper proves O(log n) push/pull rumor spreading on them.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Threshold-Driven Streaming Graph: Expansion and Rumor Spreading
Combining the RAES threshold link-acceptance rule with streaming node churn produces dynamic expanders with bounded degree, and the paper proves O(log n) push/pull rumor spreading on them.