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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We study the stochastic recursion $X_n=\Psi_n(X_{n-1})$, where$(\Psi_n)_{n\geq 1}$ is a sequence of i.i.d. random Lipschitz mappings close tothe random affine transformation $x\mapsto Ax+B$. We describe the tailbehaviour of the stationary solution $X$ under the assumption that there exists$\alpha>0$ such that $\mathbb{E} |A|^{\alpha}=1$ and the tail of $B$ isregularly varying with index $-\alpha<0$. We also find the second orderasymptotics of the tail of $X$ when $\Psi(x)=Ax+B$.

Stochastic recursions: between Kesten's and Grincevi\v{c}ius-Grey's assumptions