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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Zero forcing is a deterministic iterative graph coloring process in whichvertices are colored either blue or white, and in every round, any bluevertices that have a single white neighbor force these white vertices to becomeblue. Here we study probabilistic zero forcing, where blue vertices have anon-zero probability of forcing each white neighbor to become blue.  We explore the propagation time for probabilistic zero forcing on theErd\H{o}s-R\'eyni random graph $\Gnp$ when we start with a single vertexcolored blue. We show that when $p=\log^{-o(1)}n$, then with high probabilityit takes $(1+o(1))\log_2\log_2n$ rounds for all the vertices in $\Gnp$ tobecome blue, and when $\log n/n\ll p\leq \log^{-O(1)}n$, then with highprobability it takes $\Theta(\log(1/p))$ rounds.

Probabilistic Zero Forcing on Random Graphs