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

Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosenuniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasingbijection. Define $\mu_{f}$ to be the expected value of $f(X_{i})$ for each$i$. Define the random variable $K_{f}$ be to be minimal so that $\sum_{i =1}^{K_{f}} f(X_{i}) > t$ and let $N_{f}(t)$ be the expected value of $K_{f}$.We prove that if $c_{f} = \frac{\int_{0}^{1} \int_{f^{-1}(u)}^{1} (f(x)-u) dxdu}{\mu_{f}}$, then $N_{f}(t) = \frac{t+c_{f}}{\mu_{f}}+o(1)$. This generalizesa result of \'{C}urgus and Jewett (2007) on the case $f(x) = x$.

Asymptotic bounds on renewal process stopping times