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

We investigate the problem of percolation of words in a random environment.To each vertex, we independently assign a letter $0$ or $1$ according toBernoulli r.v.'s with parameter $p$. The environment is the resulting graphobtained from an independent long-range bond percolation configuration on$\mathbb{Z}^{d-1} \times \mathbb{Z}$, $d\geq 3$, where each edge parallel to$\mathbb{Z}^{d-1}$ has length one and is open with probability $\epsilon$,while edges of length $n$ parallel to $\mathbb{Z}$ are open with probability$p_n$. We prove that if the sum of $p_n$ diverges, then for any $\epsilon$ and$p$, there is a $K$ such that all words are seen from the origin withprobability close to $1$, even if all connections with length larger than $K$are suppressed.

Percolation of words on the hypercubic lattice with one-dimensional long-range interactions