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]中提出的猜想:顶点可迁图上暂留简单随机游走几乎处处有无穷多个切割点.     

Spectral gap and convergence rate for discrete-time Markov chains

Let P be a transition matrix which is symmetric with respect to a measure π.The spectral gap of P in L2(π)-space,denoted by gap(P),is defined as the distance between 1 and the rest of the spectrum of P.In this paper,we study the relationship between gap(P) and the convergence rate of Pn.When P is transient,the convergence rate of P n is equal to 1 gap(P).When P is ergodic,we give the explicit upper and lower bounds for the convergence rate of Pn in terms of gap(P).These results are extended to L∞(π)-space.     

双无限环境中马氏链的常返和暂留性

证明了常返和暂留是一对互斥概念,如果→X是π-不可约的且π是平稳的,则各种常返、暂留概念是等价的,讨论了暂留与非本质的等价性问题.     

Time‐delayed photo‐induced depolymerization of poly(phthalaldehyde) self‐immolative polymer via in situ formation of weak conjugate acid

Poly(phthalaldehyde) (PPHA) can be used as a structural material in transient devices and photo‐catalytically depolymerized at the end of device life by the use of a photo‐acid generator (PAG). However, device degradation requires the presence of a radiation source at the end of device mission. It has been found that the onset of PPHA depolymerization after PAG photo‐exposure can be delayed by incorporation of a particular weak bases in the PPHA/PAG mixture. This method of delayed PPHA depolymerization allows for PAG activation prior to or during device deployment when the device is under full user control. The basicity of specific lactams and amides was found to slow the PPHA depolymerization, giving the transient device a longer but finite mission lifetime. The weak base reacts with the photo‐generated strong acid to form a weak conjugate acid, which reacts more slowly with PPHA to extend the onset of PPHA depolymerization. The addition of a molar excess of specific lactams or amides, with respect to PAG, maintains PPHA stability and mechanical properties for more than 80 minutes after photo‐exposure at room temperature. The amide or lactam mediated acid activation of PPHA follows first‐order kinetics. The time delay of PPHA depolymerization can allow for prelaunch photo‐exposure and eliminates the need for postmission photo‐exposure where reliable light‐sources may not be available.     

On the transient behavior of the processor sharing queue

We analyze the transient behavior of the single server queue under the processor sharing discipline. Under fairly general assumptions, we give the rate of growth of the number of customers in the queue as well as the asymptotic behavior of the residual service times described in terms of a renormalized point process.     

α-Transience and α-Recurrence of Right Processes

In this article, we mainly discuss some potential theory in the framework of right Markov processes. We introduce the concept of α-excessive function, α-recurrence and α-transience for right processes with α ≤ 0, and give a thorough investigation.     

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

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

CRITERIA OF STRONG TRANSIENCE FOR OPERATOR-SELF-SIMILAR MARKOV PROCESSES

Yamamuro in [1] defines strong and weak transience of Markov processes; gives a criterion for strong transience of Feller processes; and further, discusses strong and weak transience of Ornstein-Uhlenbeck type processes. In this article, the authors weaken the Feller property of the result in [1] to weak Feller property and discuss the strong transience of operator-self-similar Markov processes.     

Censoring,Factorizations, and Spectral Analysis for Transition Matrices with Block-Repeating Entries

In this paper, we use the Markov chain censoring technique to study infinite state Markov chains whose transition matrices possess block-repeating entries. We demonstrate that a number of important probabilistic measures are invariant under censoring. Informally speaking, these measures involve first passage times or expected numbers of visits to certain levels where other levels are taboo; they are closely related to the so-called fundamental matrix of the Markov chain which is also studied here. Factorization theorems for the characteristic equation of the blocks of the transition matrix are obtained. Necessary and sufficient conditions are derived for such a Markov chain to be positive recurrent, null recurrent, or transient based either on spectral analysis, or on a property of the fundamental matrix. Explicit expressions are obtained for key probabilistic measures, including the stationary probability vector and the fundamental matrix, which could be potentially used to develop various recursive algorithms for computing these measures.