Pith. sign in

, " * 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 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Rumors on evolving graphs through stationary times

cs.DS · 2025-06-04 · conditional · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Rumors on evolving graphs through stationary times cs.DS · 2025-06-04 · conditional · none · ref 1

    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.