����������������ζ������ٶ�����

Let be a correlated random walk in random environment. For the sub-linear regime, that is, almost surely but , we show that there is ??Let be a correlated random walk in random environment. For the sub-linear regime, that is, almost surely but , we show that there is $0s. This result characterizes the slowdown property of the walk.     

一类自回避型随机游动的漂移速度

考虑一种直线上的随机游动模型:边的权重根据随机游动者的经过次数而相应递减.我们考察这个过程中随机游动者的漂移速度,讨论了随机游动者的位置与步数的关系.利用计算机模拟得到数据进行拟合,定量地确定出变量之间的关系.在某种条件下,随机游动者的位置的对数与步数的对数之比是一定的,不会随着边的权值递减的快慢不同而发生改变.这一点是值得进一步考虑的.     

More Randomness of Environment Does Not Always Slow Down a Random Walk

We consider a random walk on in a stationary and ergodic random environment, whose states are called types of the vertices of . We find conditions for which the speed of the random walk is positive. In the case of a Markov chain environment with finitely many states, we give an explicit formula for the speed and for the asymptotic proportion of time spent at vertices of a certain type. Using these results, we compare the speed of random walks on in environments of varying randomness.     

Exit and Return of a Simple Random Walk

Let V be a finite subset of Z^m. Estimates are obtained for the average probability that a simple random walk, starting at a point x in V, exits V before it returns to x. The average is taken over all points x in V. Mathematics Subject Classifications (2000) 60G50, 60J45     

The Minimal Subgroup of a Random Walk

It is proved that for each random walk (S _n ) _n0 on ^d there exists a smallest measurable subgroup of ^d , called minimal subgroup of (S _n ) _n0, such that P(S _n )=1 for all n1. can be defined as the set of all x ^d for which the difference of the time averages n ^{–1 n} _k=1 P(S _k ) and n ^{–1 n} _k=1 P(S _k +x) converges to 0 in total variation norm as n. The related subgroup * consisting of all x ^d for which lim _n P(S _n )–P(S _n +x)=0 is also considered and shown to be the minimal subgroup of the symmetrization of (S _n ) _n0. In the final section we consider quasi-invariance and admissible shifts of probability measures on ^d . The main result shows that, up to regular linear transformations, the only subgroups of ^d admitting a quasi-invariant measure are those of the form ₁×...× _k × ^l–k ×{0} ^d–l , 0kld, with ₁,..., _k being countable subgroups of . The proof is based on a result recently proved by Kharazishvili⁽³⁾ which states no uncountable proper subgroup of admits a quasi-invariant measure.     

Loop-Erased Random Walk on Finite Graphs and the Rayleigh Process

Let (G _n ) _n=1^∞ be a sequence of finite graphs, and let Y _t be the length of a loop-erased random walk on G _n after t steps. We show that for a large family of sequences of finite graphs, which includes the case in which G _n is the d-dimensional torus of size-length n for d≥4, the process (Y _t ) _t=0^∞, suitably normalized, converges to the Rayleigh process introduced by Evans, Pitman, and Winter. Our proof relies heavily on ideas of Peres and Revelle, who used loop-erased random walks to show that the uniform spanning tree on large finite graphs converges to the Brownian continuum random tree of Aldous. Supported in part by NSF Grant DMS-0504882.     

Transient Nearest Neighbor Random Walk on the Line

We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over which the walk runs through (always from left to right) without ever returning.     

一个与广义二项级数有关的随机游动问题

利用广义二项级数本文给出了随机格点最终到达给定边界的概率.     

一般随机环境中二重随机游动的强大数定律

讨论了-般环境中二重随机游动的强泛函大数定律,给出了当过程几乎处处趋向于正无穷时的泛函大数定律成立的几个充分条件.     

Asymptotics of the Stationary Distribution of an Oscillating Random Walk

We obtain some theorems on the asymptotics of the stationary distribution of an oscillating random walk with two levels of switching provided that the distance between the levels tends to infinity.     

��ֱ�����������������ζ���ǿ��������

本文讨论了右半直线上带有原点反射壁的随机环境中随机游动,并给出了其常返性的充要条件.在非常返的情况下,获得了{Xn}从n-1到n首中时τn的二阶矩Eτn2的一个估计.同时,给出了右半直线上随机环境中随机游动的强大数定律.     

修正的Newman-Watts小世界及其上随机游走的混合时

在一个常规构建的图中加"长边(shortcuts)"会得到一个小世界模型,这是经典的构造小世界模型的方法.最近,吴宪远在文[Internet Mathematics,DOI:10.1080/15427951,2015.101208]中指出,在加"长边"过程中加的所有边,只有与图的直径成正比才会对小世界模型的构造起决定性作用.我们依据此文的加边机制,对体积为n~d的d(d≥1)维格点图,只添加起决定性作用的长边,得到的小世界模型修正了原始的Newman-Watts小世界模型,并证明该模型的直径和混合时是log n阶的.     

Biased Random Walk on Lamplighter Groups and Graphs

Lyons, Pemantle, and Peres⁽⁴⁾ found an example of a group on which a simple random walk has sublinear speed but an inward biased walk has linear speed. We examine a similar example by introducing a martingale that allows us to compute the exact speed of the inward biased walk. We apply the martingale techniques to the example of Lyons et al., and improve on their speed estimates for small amounts of bias. Finally, we examine the speed on a related family of graphs and construct an example on which the speed of the walk has a second phase change.     

带形上近临界随机游动的常返暂留性

本文研究带形上的近临界随机游动,借助游动常返暂留性判别准则的显式表达,通过带扰动的线性差分系统的解的渐近性理论,以及矩阵的范数性质,在扰动矩阵不同的阶的条件下,给出了游动常返暂留性的判别.     

On the Escape Probability for a Left or Right Continuous Random Walk

A formula for the escape probability in a left or right continuous random walk is derived in a simple manner, under natural conditions.AMS Subject Classification: 60G50.     

Asymptotic Expansions for the Distribution of the Crossing Number of a Strip by Sample Paths of a Random Walk

The complete asymptotic expansions are obtained for the distribution of the crossing number of a strip in n steps by sample paths of an integer-valued random walk with zero mean. We suppose that the Cramer condition holds for the distribution of jumps and the width of strip increases together with n; the results are proven under various conditions on the width growth rate. The method is based on the Wiener–Hopf factorization; it consists in finding representations of the moment generating functions of the distributions under study, the distinguishing of the main terms of the asymptotics of these representations, and the subsequent inversion of the main terms by the modified saddle-point method.     

��������ɷ�����������ζ�����Сֵ�ľֲ����޶���

??The local limit theorems for the minimum of a random walk with Markovian increments is given, with using Presman's factorization theory. This result implies the asymptotic behaviour of the survival probability for a critical branching process in Markovian depended random environment.     

Approximation of the Distribution of the Supremum of a Centered Random Walk. Application to the Local Score

Let (X _n ) _{n 0} be a real random walk starting at 0, with centered increments bounded by a constant K. The main result of this study is: |P(S _n n x)–P( sup_{0 u 1} B _u x)| C(n,K) n/n, where x 0, ² is the variance of the increments, S _n is the supremum at time n of the random walk, (B _u ,u 0) is a standard linear Brownian motion and C(n,K) is an explicit constant. We also prove that in the previous inequality S _n can be replaced by the local score and sup₀ u 1 B _u by sup₀ u 1|B _u |.     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.