Asymptotic behavior for random walk in random environment with holding times

In this article, we mainly discuss the asymptotic behavior for multi-dimensional continuous-time random walk in random environment with holding times. By constructing a renewal structure and using the point “environment viewed from the particle”, under General Kalikow's Condition, we show the law of large numbers (LLN) and central limit theorem (CLT) for the escape speed of random walk.     

Subcritical catalytic branching random walk with finite or infinite variance of offspring number

Subcritical catalytic branching random walk on the d-dimensional integer lattice is studied. New theorems concerning the asymptotic behavior of distributions of local particle numbers are established. To prove the results, different approaches are used, including the connection between fractional moments of random variables and fractional derivatives of their Laplace transforms. In the previous papers on this subject only supercritical and critical regimes were investigated under the assumptions of finiteness of the first moment of offspring number and finiteness of the variance of offspring number, respectively. In the present paper, for the offspring number in the subcritical regime, the finiteness of the moment of order 1 + δ is required where δ is some positive number.     

Hitting times with taboo for a random walk

For a symmetric homogeneous and irreducible random walk on the d-dimensional integer lattice, which have a finite variance of jumps, we study passage times (taking values in [0,??]) determined by a starting point x, a hitting state y, and a taboo state z. We find the probability that these passage times are finite, and study the distribution tail. In particular, it turns out that, for the above-mentioned random walks on ? ^d except for a simple random walk on ?, the order of the distribution tail decrease is specified by dimension d only. In contrast, for a simple random walk on ?, the asymptotic properties of hitting times with taboo essentially depend on mutual location of the points x, y, and z. These problems originated in recent study of a branching random walk on ? ^d with a single source of branching.     

The range of two-parameter random walk in space

Summary Let {X _ij; i>0, j>0} be a double sequence of i.i.d. random variables taking values in the d-dimensional integer lattice E _d . Also let . Then the range of random walk {S _mn: m>0, n>0} up to time (m, n), denoted by R _mn , is the cardinality of the set {S _pq: 0m, n). In this paper a sufficient condition in terms of the characteristic function of X ₁₁ is given so that a.s. as either (m, n) or m(n) tends to infinity.     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

Asymptotic analysis of a random walk on a hypercube with many dimensions

In nearest neighbor random walk on an n-dimensional cube a particle moves to one of its nearest neighbors (or stays fixed) with equal probability. the particle starts at 0. How long does it take to reach its stationary distribution? in fact, this occurs surprisingly rapidly. Previous analysis has shown that the total variation distance to stationarity is large if the number of steps N is < 1/4n log n and close to 0 if N > 1/4n log n. This paper derives an explicit expression for the variation distance as n → ∞ in the transition region N ? 1/4n log n. This permits the first careful evaluation of a cutoff phenomenon observed in a wide variety of Markov chains. the argument involves Fourier analysis to express the probability as a contour integral and saddle point approximation. the asymptotic results are in good agreement with numerical results for n as small as 100.     

Moments of escape times of random walk

Extending an idea of Spitzer [2], a way to compute the moments of the time of escape from (−N,L) by a symmetric simple random walk is exhibited. It is shown that all these moments depend polynomially onL andN. The research of this author was supported by the National Board of Higher Mathematics, Bombay, India     

Asymptotic behavior of eigenvalues of two-parameter nonlinear Sturm-Liouville problems

The nonlinear two-parameter Sturm-Liouville problemu ^"+μg(u)=λf(u) is studied for μ, λ>0. By using Ljusternik-Schnirelman theory on the general level set developed by Zeidler, we shall show the existence of ann-th variational eigenvalue λ=λ_n(μ). Furthermore, for specialf andg, the asymptotic formula of λ₁(μ)) as μ→∞ is established.     

Asymptotic normality of the size of the giant component via a random walk

In this paper we give a simple new proof of a result of Pittel and Wormald concerning the asymptotic value and (suitably rescaled) limiting distribution of the number of vertices in the giant component of G(n,p) above the scaling window of the phase transition. Nachmias and Peres used martingale arguments to study Karp?s exploration process, obtaining a simple proof of a weak form of this result. We use slightly different martingale arguments to obtain a much sharper result with little extra work.     

Large deviations for hitting times of a random walk in random environment on a strip

We consider a random walk in random environment on a strip, which is transient to the right. The random environment is stationary and ergodic. By the constructed enlarged random environment which was first introduced by Goldsheid （2008）, we obtain the large deviations conditioned on the environment （in the quenched case） for the hitting times of the random walk.     

Asymptotic properties of the occupation measure in a multidimensional skip-free Markov-modulated random walk

Queueing Systems - We consider a discrete-time d-dimensional process $$\{{\varvec{X}}_n\}=\{(X_{1,n},X_{2,n},\ldots ,X_{d,n})\}$$ on $${\mathbb {Z}}^d$$ with a background process $$\{J_n\}$$ on a...     

Asymptotic variance rate of the output in production lines with finite buffers

Production systems that can be modeled as discrete time Markov chains are considered. A statespacebased method is developed to determine the variance of the number of parts produced per unit time in the long run. This quantity is also referred to as the asymptotic variance rate. The block tridiagonal structure of the probability matrix of a general twostation production line with a finite buffer is exploited and a recursive method based on matrix geometric solution is used to determine the asymptotic variance rate of the output. This new method is computationally very efficient and yields a thousandfold improvement in the number of operations over the existing methods. Numerical experiments that examine the effects of system parameters on the variability of the performance of a production line are presented. The computational efficiency of the method is also investigated. Application of this method to longer lines is discussed and exact results for a threestation production line with finite interstation buffers are presented. A thorough review of the pertinent literature is also given.     

Asymptotical behavior of the variance of sums of random variables with random replacements

In this paper, we introduce a scheme of summation of independent random variables with random replacements. We consider a series of double arrays of identically distributed random variables that are row-wise independent, but such that neighboring rows contain a random common part of the repeating terms. By this-scheme we bscribe a model of strongly dependent noise. To investigate the sample mean of this noise, we consider the sum of random variables over the whole double array and its conditional variance with respect to replacements. For columns of the arrays we prove a covariance inequality. As a corollary of it, we demonstrate the law of large numbers for conditional variances. Bibliography: 4 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 216, 1994, pp. 124–143. Translated by A. Sudakov.     

Moments and distribution of the local time of a two-dimensional random walk

Let ?(n,x)$?(n,x)$ be the local time of a random walk on Z²${\mathbb{Z}}^2$. We prove a strong law of large numbers for the quantity _Ln(α)=_∑x∈Z2?(n,x)^α$L_n\left(\alpha \right)={\sum }_{x\in {\mathbb{Z}}^2}?{(n,x)}^{\alpha }$ for all α≥0$\alpha \ge 0$. We use this result to describe the distribution of the local time of a typical point in the range of the random walk.     

Moderate growth and random walk on finite groups

We study the rate of convergence of symmetric random walks on finite groups to the uniform distribution. A notion of moderate growth is introduced that combines with eigenvalue techniques to give sharp results. Roughly, for finite groups of moderate growth, a random walk supported on a set of generators such that the diameter of the group is requires order ² steps to get close to the uniform distribution. This result holds for nilpotent groups with constants depending only on the number of generators and the class. Using Gromov's theorem we show that groups with polynomial growth have moderate growth.