English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study a model of rumor propagation in discrete time where each site in thegraph has initially a distinct information; we are interested in the number of"conversations" before the entire graph knows all informations. This problemcan be described as a flooding time problem with multiple liquids. For thecomplete graph we compare the ratio between the expected propagation time forall informations and the corresponding time for a single information, obtainingthe asymptotic ratio $3/2$ between them.

Total flooding time and rumor propagation on graphs