Alexander Iksanov

On the number of jumps of random walks with a barrier

Let S 0 := 0 and Sk := ξ 1 + ··· + ξk for k ∈ ℕ := {1, 2, …}, where {ξk : k ∈ ℕ} are independent copies of a random variable ξ with values in ℕ and distribution pk := P{ξ = k}, k ∈ ℕ. We interpret the random walk {Sk : k = 0, 1, 2, …} as a particle jumping to the right through integer positions. Fix n ∈ ℕ and modify the process by requiring that the particle is bumped back to its current state each time a jump would bring the particle to a state larger than or equal to n. This constraint defines an increasing Markov chain {Rk (n) : k = 0, 1, 2, …} which never reaches the state n. We call this process a random walk with barrier n. Let Mn denote the number of jumps of the random walk with barrier n. This paper focuses on the asymptotics of Mn as n tends to ∞. A key observation is that, under p 1 > 0, {Mn : n ∈ ℕ} satisfies the distributional recursion M 1 = 0 and for n = 2, 3, …, where In is independent of M 2, …, M n−1 with distribution P{In = k} = pk / (p 1 + ··· + p n−1), k ∈ {1, …, n − 1}. Depending on the tail behavior of the distribution of ξ, several scalings for Mn and corresponding limiting distributions come into play, including stable distributions and distributions of exponential integrals of subordinators. The methods used in this paper are mainly probabilistic. The key tool is to compare (couple) the number of jumps, Mn , with the first time, Nn , when the unrestricted random walk {Sk : k = 0, 1, …} reaches a state larger than or equal to n. The results are applied to derive the asymptotics of the number of collision events (that take place until there is just a single block) for β(a, b)-coalescent processes with parameters 0 < a < 2 and b = 1.

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

Local universality for real roots of random trigonometric polynomials

[0,1]

Asymptotics of random processes with immigration II: Convergence to stationarity

law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the interval

A central limit theorem and a law of the iterated logarithm for the Biggins martingale of the supercritical branching random walk

(0,1)

Rate of convergence in the law of large numbers for supercritical general multi-type branching processes

. Assuming that the number of points is equal to

Functional limit theorems for the number of busy servers in a G/G/∞ queue

n

On perpetuities with gamma-like tails

we investigate weak convergence, as

A law of the iterated logarithm for the number of occupied boxes in the Bernoulli sieve

n\to\infty

Null recurrence and transience of random difference equations in the contractive case

, 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.