Rumor spreading on dependent dynamic random graphs can be bounded by transferring i.i.d. completion-time results via strong stationary times, under light-tailed gap conditions.
, " * write output.state after.block = add.period write newline
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Rumors on evolving graphs through stationary times
Rumor spreading on dependent dynamic random graphs can be bounded by transferring i.i.d. completion-time results via strong stationary times, under light-tailed gap conditions.