Searcharxiv⌕ Search

arXiv subjects

Alexander Iksanov

Publications and source records attributed to Alexander Iksanov.

90 records · Page 5Linked to original sources

Exponential moments of first passage times and related quantities for Lévy processes

For a Lévy process on the real line, we provide complete criteria for the finiteness of exponential moments of the first passage time into the interval $(r,\infty)$, the sojourn time in the interval $(-\infty,r]$, and the last exit time from $(-\infty,r]$. Moreover, whenever these quantities are finite, we derive their respective asymptotic behavior as $r \to \infty$.

math.PR↗

A remark on the paper "Renorming divergent perpetuities"

Let $(ξ_k)$ and $(η_k)$ be infinite independent samples from different distributions. We prove a functional limit theorem for the maximum of a perturbed random walk $\underset{0\leq k\leq n}{\max}\,(ξ_1+\ldots+ξ_k+η_{k+1})$ in a situation where its asymptotics is affected by both $\underset{0\leq k\leq n}{\max}\,(ξ_1+\ldots+ξ_k)$ and $\underset{1\leq k\leq n}{\max}\,η_k$ to a comparable extent. This solves an open problem that we learned from the paper "Renorming divergent perpetuities" by P. Hitczenko and J. Wesołowski.

math.PR↗

Fixed points of multivariate smoothing transforms with scalar weights

Given a sequence $(C_1,\ldots,C_d,T_1,T_2,\ldots)$ of real-valued random variables with $N := \#\{j \geq 1: T_j \not = 0\} < \infty$ almost surely, there is an associated smoothing transformation which maps a distribution $P$ on $\mathbb{R}^d$ to the distribution of $\sum_{j \geq 1} T_j \mathbf{X}^{(j)} + \mathbf{C}$ where $\mathbf{C} = (C_1,\ldots,C_d)$ and $(\mathbf{X}^{(j)})_{j \geq 1}$ is a sequence of independent random vectors with distribution $P$ independent of $(C_1,\ldots,C_d,T_1,T_2,\ldots)$. We are interested in the fixed points of this mapping. By improving on the techniques developed in [G. Alsmeyer, J.D. Biggins, and M. Meiners. The functional equation of the smoothing transform {\em Ann. Probab.}, 40(5):2069--2105, 2012] and [G. Alsmeyer and M. Meiners. Fixed points of the smoothing transform: two-sided solutions. {\em Probab. Theory Related Fields}, 155(1-2):165--199, 2013], we determine the set of all fixed points under weak assumptions on $(C_1,\ldots,C_d,T_1,T_2,\ldots)$. In contrast to earlier studies, this includes the most intricate case when the $T_j$ take both positive and negative values with positive probability. In this case, in some situations, the set of fixed points is a subset of the corresponding set when the $T_j$ are replaced by their absolute values, while in other situations, additional solutions arise.

math.PR↗

A two-type Bellman--Harris process initiated by a large number of particles

We investigate a two-type critical Bellman--Harris branching process with the following properties: the tail of the life-length distribution of the first type particles is of order $o(t^{-2})$; the tail of the life-length distribution of the second type particles is regularly varying at infinity with index $-β$, $β\in (0,1]$; at time $t=0$ the process starts with a large number $N$ of the second type particles and no particles of the first type. It is shown that the time axis $0\leq t<\infty $ splits into several regions whose ranges depend on $β$ and the ratio $N/t$ within each of which the process at time $t$ exhibits asymptotics (as $N,t\rightarrow \infty$) which is different from those in the other regions.

math.PR↗

Weak convergence of finite-dimensional distributions of the number of empty boxes in the Bernoulli sieve

The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the interval (0,1). Assuming that the number of points is equal to n we investigate the weak convergence, as n tends to infinity, of finite-dimensional distributions of the number of empty intervals within the occupancy range. A new argument enables us to relax the constraints imposed in previous papers on the distribution of the factor of the multiplicative random walk.

math.PR↗

Functional limit theorems for renewal shot noise processes with increasing response functions

We consider renewal shot noise processes with response functions which are eventually nondecreasing and regularly varying at infinity. We prove weak convergence of renewal shot noise processes, properly normalized and centered, in the space $D[0,\infty)$ under the $J_1$ or $M_1$ topology. The limiting processes are either spectrally nonpositive stable Lévy processes, including the Brownian motion, or inverse stable subordinators (when the response function is slowly varying), or fractionally integrated stable processes or fractionally integrated inverse stable subordinators (when the index of regular variation is positive). The proof exploits fine properties of renewal processes, distributional properties of stable Lévy processes and the continuous mapping theorem.

math.PR↗

Power and exponential moments of the number of visits and related quantities for perturbed random walks

Let $(ξ_1,η_1),(ξ_2,η_2),...$ be a sequence of i.i.d.\ copies of a random vector $(ξ,η)$ taking values in $\R^2$, and let $S_n := ξ_1+...+ξ_n$. The sequence $(S_{n-1} + η_n)_{n \geq 1}$ is then called perturbed random walk. We study random quantities defined in terms of the perturbed random walk: $τ(x)$, the first time the perturbed random walk exits the interval $(-\infty,x]$, $N(x)$, the number of visits to the interval $(-\infty,x]$, and $ρ(x)$, the last time the perturbed random walk visits the interval $(-\infty,x]$. We provide criteria for the a.s.\ finiteness and for the finiteness of exponential moments of these quantities. Further, we provide criteria for the finiteness of power moments of $N(x)$ and $ρ(x)$.

math.PR↗

On asymptotics of the beta-coalescents

We show that the total number of collisions in the exchangeable coalescent process driven by the beta $(1,b)$ measure converges in distribution to a 1-stable law, as the initial number of particles goes to infinity. The stable limit law is also shown for the total branch length of the coalescent tree. These results were known previously for the instance $b=1$, which corresponds to the Bolthausen--Sznitman coalescent. The approach we take is based on estimating the quality of a renewal approximation to the coalescent in terms of a suitable Wasserstein distance. Application of the method to beta $(a,b)$-coalescents with $0<a<1$ leads to a simplified derivation of the known $(2-a)$-stable limit. We furthermore derive asymptotic expansions for the moments of the number of collisions and of the total branch length for the beta $(1,b)$-coalescent by exploiting the method of sequential approximations.

math.PR↗

Regenerative compositions in the case of slow variation: A renewal theory approach

A regenerative composition structure is a sequence of ordered partitions derived from the range of a subordinator by a natural sampling procedure. In this paper, we extend previous studies Barbour and Gnedin (2006), Gnedin, Iksanov and Marynych (2010) and Gnedin, Pitman and Yor (2006) on the asymptotics of the number of blocks $K_n$ in the composition of integer $n$, in the case when the L{é}vy measure of the subordinator has a property of slow variation at 0. Using tools from the renewal theory the limit laws for $K_n$ are obtained in terms of integrals involving the Brownian motion or stable processes. In other words, the limit laws are either normal or other stable distributions, depending on the behavior of the tail of L{é}vy measure at $\infty$. Similar results are also derived for the number of singleton blocks.

math.PR↗

A generalization of the Erdős-Turán law for the order of random permutation

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain assumptions on the stick-breaking factor we prove a central limit theorem for the logarithm of the order of the permutation, thus extending the classical Erdős-Turán law for the uniform permutations and its generalization for Ewens' permutations associated with sampling from the PD/GEM$(θ)$ distribution. Our approach is based on using perturbed random walks to obtain the limit laws for the sum of logarithms of the cycle lengths.

math.PR↗

On the number of empty boxes in the Bernoulli sieve II

The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies $P_k=W_1... W_{k-1}(1-W_k)$, where $(W_k)_{k\in\mn}$ are independent copies of a random variable $W$ taking values in $(0,1)$. Assuming that the number of balls equals $n$, let $L_n$ denote the number of empty boxes within the occupancy range. In the paper we investigate convergence in distribution of $L_n$ in the two cases which remained open after the previous studies. In particular, provided that $\me |\log W|=\me |\log (1-W)|=\infty$ and that the law of $W$ assigns comparable masses to the neighborhoods of 0 and 1, it is shown that $L_n$ weakly converges to a geometric law. This result is derived as a corollary to a more general assertion concerning the number of zero decrements of nonincreasing Markov chains. In the case that $\me |\log W|<\infty$ and $\me |\log (1-W)|=\infty$ we derive several further possible modes of convergence in distribution of $L_n$. It turns out that the class of possible limiting laws for, properly normalized and centered, $L_n$ includes normal laws and spectrally negative stable laws with finite mean. While investigating the second problem we develop some general results concerning the weak convergence of renewal shot-noise processes. This allows us to answer a question asked in Mikosch and Resnick (2006).

math.PR↗

Moments of random sums and Robbins' problem of optimal stopping

Robbins' problem of optimal stopping asks one to minimise the expected {\it rank} of observation chosen by some nonanticipating stopping rule. We settle a conjecture regarding the {\it value} of the stopped variable under the rule optimal in the sense of the rank, by embedding the problem in a much more general context of selection problems with the nonanticipation constraint lifted, and with the payoff growing like a power function of the rank.

math.PR↗

On the number of empty boxes in the Bernoulli sieve

The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies $P_k=W_1...W_{k-1}(1-W_k)$, where $(W_k)_{k\in\mn}$ are independent copies of a random variable $W$ taking values in $(0,1)$. Assuming that the number of balls equals $n$, let $L_n$ denote the number of empty boxes within the occupancy range. The paper proves that, under a regular variation assumption, $L_n$, properly normalized without centering, weakly converges to a functional of an inverse stable subordinator. Proofs rely upon the observation that $(\log P_k)$ is a perturbed random walk. In particular, some results for general perturbed random walks are derived. The other result of the paper states that whenever $L_n$ weakly converges (without normalization) the limiting law is mixed Poisson.

math.PR↗

Lambda-coalescents with dust component

We consider the lambda-coalescent processes with positive frequency of singleton clusters. The class in focus covers, for instance, the beta$(a,b)$-coalescents with $a>1$. We show that some large-sample properties of these processes can be derived by coupling the coalescent with an increasing L{é}vy process (subordinator), and by exploiting parallels with the theory of regenerative composition structures. In particular, we discuss the limit distributions of the absorption time and the number of collisions.

math.PR↗

The Bernoulli sieve: an overview

The Bernoulli sieve is a version of the classical balls-in-boxes occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative random walk, also known as the residual allocation model or stick-breaking. We give an overview of the limit theorems concerning the number of boxes occupied by some balls out of the first $n$ balls thrown, and present some new results concerning the number of empty boxes within the occupancy range.

math.PR↗

Exponential moments of first passage times and related quantities for random walks

For a zero-delayed random walk on the real line, let $τ(x)$, $N(x)$ and $ρ(x)$ denote the first passage time into the interval $(x,\infty)$, the number of visits to the interval $(-\infty,x]$ and the last exit time from $(-\infty,x]$, respectively. In the present paper, we provide ultimate criteria for the finiteness of exponential moments of these quantities. Moreover, whenever these moments are finite, we derive their asymptotic behaviour, as $x \to \infty$.

math.PR↗

Limit theorems for the number of occupied boxes in the Bernoulli sieve

The Bernoulli sieve is a version of the classical `balls-in-boxes' occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative renewal process, also known as the residual allocation model or stick-breaking. We focus on the number $K_n$ of boxes occupied by at least one of $n$ balls, as $n\to\infty$. A variety of limiting distributions for $K_n$ is derived from the properties of associated perturbed random walks. Refining the approach based on the standard renewal theory we remove a moment constraint to cover the cases left open in previous studies.

math.PR↗

A log-type moment result for perpetuities and its application to martingales in supercritical branching random walks

Infinite sums of i.i.d. random variables discounted by a multiplicative random walk are called perpetuities and have been studied by many authors. The present paper provides a log-type moment result for such random variables under minimal conditions which is then utilized for the study of related moments of a.s. limits of certain martingales associated with the supercritical branching random walk. The connection, first observed by the second author in [Iksanov, A.M. (2004). Elementary fixed points of the BRW smoothing transforms with infinite number of summands. Stoch. Proc. Appl. 114, 27-50.], arises upon consideration of a size-biased version of the branching random walk originally introduced by Lyons in [Lyons, R.(1997). A simple path to Biggins' martingale convergence for branching random walk. In Athreya, K.B., Jagers, P. (eds.). Classical and Modern Branching Processes, IMA Volumes in Mathematics and its Applications, vol. 84, Springer, Berlin, 217-221.]. We also provide a necessary and sufficient condition for uniform integrability of these martingales in the most general situation which particularly means that the classical (LlogL)-condition is not always needed.

math.PR↗