Let ${({\xi _{k}},{\eta _{k}})_{k\ge 1}}$ be independent identically distributed random vectors with arbitrarily dependent positive components and ${T_{k}}:={\xi _{1}}+\cdots +{\xi _{k-1}}+{\eta _{k}}$ for $k\in \mathbb{N}$. The random sequence ${({T_{k}})_{k\ge 1}}$ is called a (globally) perturbed random walk. Consider a general branching process generated by ${({T_{k}})_{k\ge 1}}$ and let ${Y_{j}}(t)$ denote the number of the jth generation individuals with birth times $\le t$. Assuming that $\mathrm{Var}\hspace{0.1667em}{\xi _{1}}\in (0,\infty )$ and allowing the distribution of ${\eta _{1}}$ to be arbitrary, a law of the iterated logarithm (LIL) is proved for ${Y_{j}}(t)$. In particular, an LIL for the counting process of ${({T_{k}})_{k\ge 1}}$ is obtained. The latter result was previously established in the article by Iksanov, Jedidi and Bouzeffour (2017) under the additional assumption that $\mathbb{E}{\eta _{1}^{a}}\lt \infty $ for some $a\gt 0$. In this paper, it is shown that the aforementioned additional assumption is not needed.
Buraczewski et al. (2023) proved a functional limit theorem (FLT) and a law of the iterated logarithm (LIL) for a random Dirichlet series ${\textstyle\sum _{k\ge 2}}\frac{{(\log k)^{\alpha }}}{{k^{1/2+s}}}{\eta _{k}}$ as $s\to 0+$, where $\alpha \gt -1/2$ and ${\eta _{1}},{\eta _{2}},\dots $ are independent identically distributed random variables with zero mean and finite variance. A FLT and a LIL are proved in a boundary case $\alpha =-1/2$. The boundary case is more demanding technically than the case $\alpha \gt -1/2$. A FLT and a LIL for ${\textstyle\sum _{p}}\frac{{\eta _{p}}}{{p^{1/2+s}}}$ as $s\to 0+$, where the sum is taken over the prime numbers, are stated as the conjectures.
In the Karlin infinite occupancy scheme, balls are thrown independently into an infinite array of boxes $1,2,\dots $ , with probability ${p_{k}}$ of hitting the box k. For $j,n\in \mathbb{N}$, denote by ${\mathcal{K}_{j}^{\ast }}(n)$ the number of boxes containing exactly j balls provided that n balls have been thrown. Small counts are the variables ${\mathcal{K}_{j}^{\ast }}(n)$, with j fixed. The main result is a law of the iterated logarithm (LIL) for the small counts as the number of balls thrown becomes large. Its proof exploits a Poissonization technique and is based on a new LIL for infinite sums of independent indicators ${\textstyle\sum _{k\ge 1}}{1_{{A_{k}}(t)}}$ as $t\to \infty $, where the family of events ${({A_{k}}(t))_{t\ge 0}}$ is not necessarily monotone in t. The latter LIL is an extension of a LIL obtained recently by Buraczewski, Iksanov and Kotelnikova (2023+) in the situation when ${({A_{k}}(t))_{t\ge 0}}$ forms a nondecreasing family of events.