一类随机环境中的随机游动

在Solomn的模型的基础上对一类随机环境中随机游动进行了讨论，并得出了一个常返性准则和一些极限性质。     

一类随机环境中的随机游动

研究了在环境平稳遍历时,右半直线上可逗留的随机环境中的随机游动的常返性和非常返性,给出非常返、正常返、零常返的充要条件,并讨论了极限性质.作为推论,给出P独立同分布时的相应结论.     

一类随机环境下随机游动的常返性

就一类平稳环境θ下随机流动{Xn}n∈z 建立相应的Markov-双链{ηn}n∈z ={(xn,Tnθ)}n∈z ,并给出在该平稳环境θ下{xn}n∈z 为常返链的条件.     

一类分形结构上的非对称随机游动

本研究一类分形结构上的随机游动,得到了它的进位不变性,进位时间的生成函数表达式并得到一个极限定理。     

一类时间随机环境中随机游动

利用概率母函数方法,通过对一类时间随机环境中随机游动首中时性质的研究,得到了该随机游动的常返准则和一个强大数定律.     

一类随机环境中半直线上的可逗留随机游动

该文对一类随机环境中的半直线上的可逗留随机游动进行了讨论，得出了一个常返性准则(正常返、零常返、瞬时); 并通过构造Lyapunov函数和利用鞅理论，求出该模型的一个重对数律和一个L_p收敛的结果.     

关于随机游动的某些结果

本文研究了随机游动中重叠的最大游程问题,对某些条件下重叠的最大游程及其期望的收敛性质作了细致的描述,所描述的这些渐近性质是以前未搞清楚的.此外本文还讨论了同标号最大矩形的区域期望的渐近性质,这个问题在以前的资料中未曾讨论过.     

随机环境中广义随机游动的灭绝概率

随机环境中广义随机游动(GRWRE)是随机环境中随机游动(RWRE)的推广．该文构造了非负整数集上的GRWRE,证明了这种模型的存在性,并计算了灭绝概率．     

随机环境中持久性随机游动的大偏差原理

本文研究随机环境中持久性随机游动逃逸速度的极限定理,利用首中时分解和测度变化方法,得到了平稳随机环境下持久性随机游动的大偏差原理,拓宽了传统模型在随机环境中随机运动的极限理论.     

半直线上随机环境中的随机游动的若干性质

本文讨论半直线上随机环境中的随机游动的常返性，并进一步讨论其正常返性以及极限性质。     

Long Excursions of a Random Walk

In Csáki et al. ⁽¹⁾ and Révész and Willekens⁽⁹⁾ it was proved that the length of the longest excursion among the first n excursions of a plane random walk is nearly equal to the total sum of the lenghts of these excursions. In this paper several results are proved in the same spirit, for plane random walks and for random walks in higher dimensions.     

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

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.     

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.     

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.     

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.     

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     

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

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

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

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

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.