随机环境中马氏链状态的各种常返性与暂留性

考虑到随机环境中马氏链的状态在受到环境因素各种条件的影响下,引入了随机环境中马氏链状态的各种常返性与暂留性概念,讨论了这些常返性与暂留性的相互关系,从而说明随机环境中马氏链状态的常返性与暂留性和经典马氏链状态的常返性与暂留性有着显著的区别.     

Tubular recurrence

We introduce the directed-edge-reinforced random walk and prove that the process is equivalent to a random walk in random environment. Using Oseledec"s multiplicative ergodic theorem, we obtain recurrence and transience criteria for random walks in random environment on graphs with a certain linear structure and apply them to directed-edge-reinforced random walks. This revised version was published online in August 2006 with corrections to the Cover Date.     

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

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

Some Finitely Additive Probability: Random Walks

In this paper we discuss random walks in the finitely additive strategic setup.     

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

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

On Transience Conditions for Markov Chains and Random Walks

We prove a new transience criterion for Markov chains on an arbitrary state space and give a corollary for real-valued chains. We show by example that in the case of a homogeneous random walk with infinite mean the proposed sufficient conditions are close to those necessary. We give a new proof of the well-known criterion for finiteness of the supremum of a random walk.     

Random Walks on Trees with Finitely Many Cone Types

This paper is devoted to the study of random walks on infinite trees with finitely many cone types (also called periodic trees). We consider nearest neighbour random walks with probabilities adapted to the cone structure of the tree, which include in particular the well studied classes of simple and homesick random walks. We give a simple criterion for transience or recurrence of the random walk and prove that the spectral radius is equal to 1 if and only if the random walk is recurrent. Furthermore, we study the asymptotic behaviour of return probabilitites and prove a local limit theorem. In the transient case, we also prove a law of large numbers and compute the rate of escape of the random walk to infinity, as well as prove a central limit theorem. Finally, we describe the structure of the boundary process and explain its connection with the random walk.     

Random walks in random environments on metric groups

Random walks in random environments on countable metric groups with bounded jumps of the walking particle are considered. The transition probabilities of such a random walk from a pointx εG (whereG is the group in question) are described by a vectorp(x) ε ℝ^|W| (whereW ⊏G is fixed and |W|<∞). The set {p(x),x εG} is assumed to consist of independent identically distributed random vectors. A sufficient condition for this random walk to be transient is found. As an example, the groups ℤ ^d , free groups, and the free product of finitely many cyclic groups of second order are considered. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 129–135, January, 2000.     

拟顶点可迁图上简单随机游走的切割点

证明了体积增长不低于5次多项式的拟顶点可迁图上的简单随机游走几乎处处有无穷多个切割时,从而有无穷多个切割点.该结论在所论情形下肯定了Benjamini,Gurel-Gurevich和Schramm在文[2011,Cutpoints and resistance of random walk paths,Ann.Probab.,39(3):1122-1136]中提出的猜想:顶点可迁图上暂留简单随机游走几乎处处有无穷多个切割点.     

Rate of convergence for shuffling cards by transpositions

Suppose we are given a graph with a label on each vertex and a rate assigned to each edge, and suppose that edges flip (that is, the labels at the two endpoints switch) randomly with the given rates. We consider two Markov processes on this graph: one whose states are the permutations of then labels, and one whose states are the positions of a single label. We show that for several classes of graphs these two processes have the same spectral gap.     

Structure of random 312‐avoiding permutations

We evaluate the probabilities of various events under the uniform distribution on the set of 312‐avoiding permutations of . We derive exact formulas for the probability that the i^th element of a random permutation is a specific value less than i, and for joint probabilities of two such events. In addition, we obtain asymptotic approximations to these probabilities for large N when the elements are not close to the boundaries or to each other. We also evaluate the probability that the graph of a random 312‐avoiding permutation has k specified decreasing points, and we show that for large N the points below the diagonal look like trajectories of a random walk. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 49, 599–631, 2016     

直线上的独立随机环境中可逗留的随机游动

主要讨论直线上独立随机环境中可逗留的随机游动的常返性和非常返性,并进一步研究常返性中的正常返和零常返.     

右半直线上依分布收敛的独立随机环境中的生灭过程的常返性

讨论了一类独立随机环境中的生灭过程的常返性.在假定环境满足一定的条件下证明一个强大数定律,并应用此大数定律给出了该生灭过程的常返和非常返的判别准则.     

�˻�ͼmathbb{Z}^2times{0,1,ldots,l-1}�ij����Եij���֤��

It is well known that the two dimensional integer lattice mathbb{Z}^2 is recurrent, while the three dimensional integer lattice is transient. In this paper we show that the product graph mathbb{Z}^2times{0,1,ldots,l-1} is recurrent. The proof approach only utilizes the elementary methods in probability theory (without thewords of electric networks).     

随机环境中马氏链的常返性和瞬时性

在π-不可约条件下,得到随机环境中的马氏链瞬时和常返的判定准则,进而得到随机环境中马氏链常返的充要条件;如果环境还是平稳的,则状态空间中不存在非正则本质态.     

直线上独立时间随机环境中随机游动的渐近行为

主要讨论直线上独立时间随机环境中随机游动的常返性和非常返性,以及该过程的中心极限定理.     

半直线上的独立随机环境中的随机游动

本文给出环境独立时半直线上随机游动的模型.在假定环境满足一定的条件下,证明了一个强大数定律,运用该定律讨论了过程常返性及非常返的判定.     

随机环境中马氏链的常返性和瞬时性

讨论了随机环境马氏链中具有强π不可约性链的常返性的判定,从而得到了强π不可约链常返性判定的充分必要条件,同时给出了在一定条件下随机环境中的马氏链的瞬时性判定的几个充分条件.     

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

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

On the structure of stable random walks

We show that the Cauchy random walk on the line, and the Gaussian random walk on the plane are similar as infinite measure preserving transformations.