Model of <Emphasis Type="Italic">p</Emphasis>-Adic Random Walk in a Potential

We consider the p-adic random walk model in a potential which can be viewed as a generalization of p-adic random walk models used for describing protein conformational dynamics. This model is based on the Kolmogorov-Feller equations for the distribution function defined on the field of p-adic numbers in which the transition rate depends on ultrametric distance between the transition points as well as on function of potential violating the spatial homogeneity of a random process. This equation which will be called the equation of p-adic random walk in a potential, is equivalent to the equation of p-adic random walk with modified measure and reaction source. With a special choice of a power-law potential the last equation is shown to have an exact analytic solution. We find the analytic solution of the Cauchy problem for such equation with an initial condition, whose support lies in the ring of integer p-adic numbers.We also examine the asymptotic behaviour of the distribution function for large times. It is shown that in the limit t→∞ the distribution function tends to the equilibrium solution according to the law, which is bounded from above and below by power laws with the same exponent. Our principal conclusion is that the introduction of a potential in the model of p-adic random walk conserves the power-law behaviour of relaxation curves for large times.     

Boundaries and Harmonic Functions for Random Walks with Random Transition Probabilities

The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence of measures, so that the resulting (random) Markov chains are still space homogeneous, but no longer time homogeneous. We study various notions of measure theoretical boundaries associated with this model and establish an analogue of the Poisson formula for (random) bounded harmonic functions. Under natural conditions on transition probabilities we identify these boundaries for several classes of groups with hyperbolic properties and prove the boundary triviality (i.e., the absence of non-constant random bounded harmonic functions) for groups of subexponential growth, in particular, for nilpotent groups.     

Isoperimetric Inequalities for Random Walks

In this paper some isoperimetric problems are studied, particularly the extremal property of the mean exit time of the random walk from finite sets. This isoperimetric problem is inserted into the set of equivalent conditions of the diagonal upper estimate of transition probability of random walks on weighted graphs.     

有向图上的随机游动

设G=(V,Г)是有向图,G上的随机游动X(G)定义如下:位于某个顶点上的一个粒子将以等概率转移到该顶点的所有后继顶点.令M(j,n)表示随机游动X(G)在前n步内访问顶点j的平均次数,用W(j)表示随机游动X(G)到达顶点j所需要的平均步效.我们对M(j,n)和W(j)的值进行了估计,证明了M(j,n)=O(n),并给出了W(j)的上界.     

Random walks and the regeneration time

Consider a graph G and a random walk on it. We want to stop the random walk at certain times (using an optimal stopping rule) to obtain independent samples from a given distribution ρ on the nodes. For an undirected graph, the expected time between consecutive samples is maximized by a distribution equally divided between two nodes, and so the worst expected time is 1/4 of the maximum commute time between two nodes. In the directed case, the expected time for this distribution is within a factor of 2 of the maximum. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 57–62, 1998     

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

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

时间随机环境下随机游动的渐近行为

本文给出了可数状态空间中时间随机环境下随机游动的一个统一的模型 .对于最常见的情况 ,即d维最近邻域随机环境下随机游动 ,如果环境是严平稳的 ,则在一定条件下 ,该随机游动满足强大数定律和中心极限定理 .特别地 ,当环境独立同分布时 ,我们可以得到更为具体的结果 ,该结果类似于经典的随机游动的相应结论 .     

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.     

Moments of Absorption Time for a Conditioned Random Walk

A random walk on the set of integers {0,1,2,...,a} with absorbing barriers at 0 and a is considered. The transition times from the integers z (0<z<a) are random variables with finite moments. The nth moment of the time to absorption at a, D_z,n, conditioned on the walk starting at z and being absorbed at a, is discussed, and a difference equation with boundary values and initial values for D_z,n is given. It is solved in several special cases. The problem is motivated by questions from biology about tumor growth and multigene evolution which are discussed.     

Random Walks on Directed Covers of Graphs

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates no longer coincide in general. Furthermore, the behavior of random walks on directed covers of infinite graphs is more subtle. We provide a classification in terms of recurrence and transience and point out that the critical random walk may be recurrent or transient. Our proof is based on the observation that recurrence of the random walk is equivalent to the almost sure extinction of an appropriate branching process. Two examples in random environment are provided: homesick random walk on infinite percolation clusters and random walk in random environment on directed covers. Furthermore, we calculate, under reasonable assumptions, the rate of escape with respect to suitable length functions and prove the existence of the asymptotic entropy providing an explicit formula which is also a new result for directed covers of finite graphs. In particular, the asymptotic entropy of random walks on directed covers of finite graphs is positive if and only if the random walk is transient.     

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.     

On the Local Times of Transient Random Walks

We study the properties of the local and occupation times of certain transient random walks. First, our recent results concerning simple symmetric random walk in higher dimension are surveyed, then we start to establish similar results for simple asymmetric random walk on the line.     

Two parallel insurance lines with simultaneous arrivals and risks correlated with inter-arrival times

We investigate an insurance risk model that consists of two reserves which receive income at fixed rates. Claims are being requested at random epochs from each reserve and the interclaim times are generally distributed. The two reserves are coupled in the sense that at a claim arrival epoch, claims are being requested from both reserves and the amounts requested are correlated. In addition, the claim amounts are correlated with the time elapsed since the previous claim arrival.We focus on the probability that this bivariate reserve process survives indefinitely. The infinite-horizon survival problem is shown to be related to the problem of determining the equilibrium distribution of a random walk with vector-valued increments with ‘reflecting’ boundary. This reflected random walk is actually the waiting time process in a queueing system dual to the bivariate ruin process.Under assumptions on the arrival process and the claim amounts, and using Wiener–Hopf factorization with one parameter, we explicitly determine the Laplace–Stieltjes transform of the survival function, c.q., the two-dimensional equilibrium waiting time distribution.Finally, the bivariate transforms are evaluated for some examples, including for proportional reinsurance, and the bivariate ruin functions are numerically calculated using an efficient inversion scheme.     

Transient Nearest Neighbor Random Walk and Bessel Process

We prove a strong invariance principle between a transient Bessel process and a certain nearest neighbor (NN) random walk that is constructed from the former by using stopping times. We show that their local times are close enough to share the same strong limit theorems. It is also shown that if the difference between the distributions of two NN random walks are small, then the walks themselves can be constructed in such a way that they are close enough. Finally, some consequences concerning strong limit theorems are discussed.     

Generating a Random Signed Permutation with Random Reversals

Signed permutations form a group known as the hyperoctahedral group. We bound the rate of convergence to uniformity for a certain random walk on the hyperoctahedral group that is generated by random reversals. Specifically, we determine that O(n log n) steps are both necessary and sufficient for total variation distance and ℓ² distance to become small. This random walk arose as the result of an effort in molecular biology to model certain types of genome rearrangements.     

Kendall random walk,Williamson transform,and the corresponding Wiener–Hopf factorization

We give some properties of hitting times and an analogue of the Wiener–Hopf factorization for the Kendall random walk. We also show that the Williamson transform is the best tool for problems connected with the Kendall convolution.     

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.     

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.     

一维紧邻时间随机环境下可逗留随机游动的有关性质

给出了可数状态空间中时间随机环境下可逗留随机游动的一个统一模型,对于一维紧邻时间随机环境下的随机游动,在一定的条件下,讨论它的极限性质和中心极限定理,该结论类似于空间随机环境下的随机游动的有关结论.     

The Local time of Simple Random Walk in Random Environment

Two integral tests are established, which characterize respectively Lévy's upper and lower classes for the local time of Sinai's simple random walk in random environment. The weak convergence of the local time is also studied, and the limiting distribution determined. Our results can be applied to a class of diffusion processes with random potentials which asymptotically behave like Brownian motion.