On the local time of random walk on the 2-dimensional comb

We study the path behaviour of general random walks, and that of their local times, on the 2-dimensional comb lattice C² that is obtained from Z² by removing all horizontal edges off the x-axis. We prove strong approximation results for such random walks and also for their local times. Concentrating mainly on the latter, we establish strong and weak limit theorems, including Strassen-type laws of the iterated logarithm, Hirsch-type laws, and weak convergence results in terms of functional convergence in distribution.     

Local approximations of Markov random walks by diffusions

We consider triangular arrays of Markov random walks that can be approximated by an accompanying sequence of diffusion processes. We give uniform bounds for approximation of scaled transition probabilities by transition densities of the diffusion process. In particular, we state local limit theorems for the case that the Markov random walks converge weakly to a diffusion process.     

Estimates of speed of convergence in limit theorems for first passage times

In this article there are proven nonuniform estimates of speed of convergence in limit theorems for maximum sums of independent terms. The results thus obtained are applied to estimating speed of convergence in limit theorems for first passage times in random walks generated by these sums.Translated from Matematicheskie Zametki, Vol. 23, No. 3, pp. 487–495, March, 1978.     

Quantum random walks and their convergence to Evans-Hudson flows

Using coordinate-free basic operators on toy Fock spaces, quantum random walks are defined following the ideas of Attal and Pautrat. Extending the result for one dimensional noise, strong convergence of quantum random walks associated with bounded structure maps to Evans-Hudson flow is proved under suitable assumptions. Starting from the bounded generator of a given uniformly continuous quantum dynamical semigroup on a von Neumann algebra, we have constructed quantum random walks which converges strongly and the strong limit gives an Evans-Hudson dilation for the semigroup.     

Random walks on diestel-leader graphs

We investigate various features of a quite new family of graphs, introduced as a possible example of vertex-transitive graph not roughly isometric with a Cayley graph of some finitely generated group. We exhibit a natural compactification and study a large class of random walks, proving theorems concerning almost sure convergence to the boundary, a strong law of large numbers and a central limit theorem. The asymptotic type of then-step transition probabilities of the simple random walk is determined.     

Berry–Esseen estimates for regenerative processes under weak moment assumptions

We prove Berry–Esseen type rates of convergence for central limit theorems (CLTs) of regenerative processes which generalize previous results of Bolthausen under weaker moment assumptions. We then show how this general result can be applied to obtain rates of convergence for (1) CLTs for additive functionals of positive recurrent Markov chains under certain conditions on the strong mixing coefficients, and (2) annealed CLTs for certain ballistic random walks in random environments.     

Local Limit Theorems for Sequences of Simple Random Walks on Graphs

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to supercritical percolation clusters, graph trees converging to the continuum random tree and the homogenisation problem for nested fractals. A subsequential local limit theorem for the simple random walks on generalised Sierpinski carpet graphs is also presented.      

Tribute to Endre Csáki and Pál Révész

Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks.     

Bessel Convolutions on Matrix Cones: Algebraic Properties and Random Walks

Bessel-type convolution algebras of measures on the matrix cones of positive semidefinite q×q-matrices over ?,?,? were introduced recently by Rösler. These convolutions depend on a continuous parameter, generate commutative hypergroups, and have Bessel functions of matrix argument as characters. In this paper, we study the algebraic structure of these hypergroups. In particular, the subhypergroups, quotients, and automorphisms are classified. The algebraic properties are partially related to the properties of random walks on these matrix Bessel hypergroups. In particular, known properties of Wishart distributions, which form Gaussian convolution semigroups on these hypergroups, are put into a new light. Moreover, limit theorems for random walks are presented. In particular, we obtain strong laws of large numbers and a central limit theorem with Wishart distributions as limits.     

On convergence of random walks generated by compound Cox processes to Lévy processes

A functional limit theorem is proved establishing weak convergence of random walks generated by compound doubly stochastic Poisson processes to Lévy processes in the Skorokhod space. As corollaries, theorems are proved on convergence of random walks with jumps having finite variances to Lévy processes with mixed normal distributions, and in particular, to stable Lévy processes.     

Integro-Local Limit Theorems for Compound Renewal Processes under Cramér’S Condition. I

We obtain integro-local limit theorems in the phase space for compound renewal processes under Cramér’s moment condition. These theorems apply in a domain analogous to Cramér’s zone of deviations for random walks. It includes the zone of normal and moderately large deviations. Under the same conditions we establish some integro-local theorems for finite-dimensional distributions of compound renewal processes.     

Stein's method and random character ratios

Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is obtained for a central limit theorem of Kerov on the spectrum of the Cayley graph of the symmetric group generated by -cycles. Other main examples include an error term for a central limit theorem of Ivanov on character ratios of random projective representations of the symmetric group, and a new central limit theorem for the spectrum of certain random walks on perfect matchings. The results are obtained with very little information: a character formula for a single representation close to the trivial representation and estimates on two step transition probabilities of a random walk. The limit theorems stated in this paper are for normal approximation, but many of the tools developed are applicable for arbitrary distributional approximation.

     

Inequalities and strong laws of large numbers for random allocations

Summary Moment inqualities and strong laws of large numbers are proved for random allocations of balls into boxes. Random broken lines and random step lines are constructed using partial sums of i.i.d. random variables that are modified by random allocations. Functional limit theorems for such random processes are obtained.     

On the Recurrence Set of Planar Markov Random Walks

In this paper, we investigate properties of recurrent planar Markov random walks. More precisely, we study the set of recurrence points with the use of local limit theorems. The Nagaev–Guivarc’h spectral method provides several examples for which these local limit theorems are satisfied as soon as some (standard or non-standard) central limit theorem and some non-sublattice assumption hold.     

Limit Theorems for Weakly Subcritical Branching Processes in Random Environment

For a branching process in random environment, it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the process may at the same time be subcritical and, conditioned on nonextinction, ??supercritical.?? This so-called weakly subcritical case is considered in this paper. We study the asymptotic survival probability and the size of the population conditioned on nonextinction. Also a functional limit theorem is proved, which makes the conditional supercriticality manifest. A main tool is a new type of functional limit theorems for conditional random walks.     

Limit theorems for queueing systems with infinite number of servers and group arrival of requests

We consider an infinite-server queueing system where customers come by groups of random size at random i.d. intervals of time. The number of requests in a group and intervals between their arrivals can be dependent. We assume that service times have a regularly varying distribution with infinite mean. We obtain limit theorems for the number of customers in the system and prove limit theorems under appropriate normalizations.     

Branching random walks II

A general method is developed with which various theorems on the mean square convergence of functionals of branching random walks are proven. The results cover extensions and generalizations of classical central limit analogues as well as a result of a different type.     

Branching random walks I

A general method is developed with which various theorems on the mean square convergence of functionals of branching random walks are proven. The results cover extensions and generalizations of classical central limit analogues as well as a result of a different type.     

A law of the iterated logarithm for a class of polynomial hypergroups

We consider stationary ₀-valued Markov chains whose transition probabilities are associated with convolution structures of measures which are induced by linearization formulas of orthogonal polynomials. The best known examples are random walks on polynomial hypergroups and generalized birth and death random walks. Using central limit theorems derived in a recent paper by the author and some martingale arguments, we here prove a law of the iterated logarithm for a class of such Markov chains.     

Maxima of branching random walks vs. independent random walks

In recent years several authors have obtained limit theorems for the location of the right most particle in a supercritical branching random walk. In this paper we will consider analogous problems for an exponentially growing number of independent random walks. A comparison of our results with the known results of branching random walk then identifies the limit behaviors which are due to the number of particles and those which are determined by the branching structure.