Suppose that $𝒢$ is a finite, connected graph and $X$ is a lazy random walk on $𝒢$. The lamplighter chain $X^{\diamond }$ associated with $X$ is the random walk on the wreath product ${𝒢}^{\diamond }={𝐙}_2\wr 𝒢$, the graph whose vertices consist of pairs $(\underline{f},x)$ where $f$ is a labeling of the vertices of $𝒢$ by elements of ${𝐙}_2=\{0,1\}$ and $x$ is a vertex in $𝒢$. There is an edge between $(\underline{f},x)$ and $(\underline{g},y)$ in ${𝒢}^{\diamond }$ if and only if $x$ is adjacent to $y$ in $𝒢$ and $f_z=g_z$ for all $z\ne x,y$. In each step, $X^{\diamond }$ moves from a configuration $(\underline{f},x)$ by updating $x$ to $y$ using the transition rule of $X$ and then sampling both...

We consider the one-sided exit problem – also called one-sided barrier problem – for ($\alpha$-fractionally) integrated random walks and Lévy processes. Our main result is that there exists a positive, non-increasing function $\alpha \mapsto \theta \left(\alpha \right)$ such that the probability that any $\alpha$-fractionally integrated centered Lévy processes (or random walk) with some finite exponential moment stays below a fixed level until time $T$ behaves as $T^{-\theta \left(\alpha \right)+\mathrm{o}\left(1\right)}$ for large $T$. We also investigate when the fixed level can be replaced by a different barrier...