We define two splitting procedures of the interval [0,1], one using uniformly distributed points on the chosen piece and the other splitting a piece in half. We also define two procedures for choosing the piece to be split; one chooses a piece with a probability proportional to its length and the other chooses each piece with equal probability. We analyse the probability distribution of the lengths of the pieces arising from these procedures.
We consider an accessibility index for the states of a discrete-time, ergodic, homogeneous Markov chain on a finite state space; this index is naturally associated with the random walk centrality introduced by Noh and Reiger (2004) for a random walk on a connected graph. We observe that the vector of accessibility indices provides a partition of Kemeny's constant for the Markov chain. We provide three characterizations of this accessibility index: one in terms of the first return time to the state...
We give criteria for ergodicity, transience and null-recurrence for the random walk in random environment on , with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results complement existing criteria for random walks in random environments and for Markov chains with asymptotically zero drift, and are significantly different from the previously studied cases. Our method is based on a martingale technique—the method of Lyapunov functions.
In this paper we study a random walk on an affine building of type Ãr, whose radial part, when suitably normalized, converges toward the brownian motion of the Weyl chamber. This gives a new discrete approximation of this process, alternative to the one of Biane (Probab. Theory Related Fields89 (1991) 117–129). This extends also the link at the probabilistic level between riemannian symmetric spaces of the noncompact type and their discrete counterpart, which had been previously discovered by Bougerol...
In this paper characterizations of graphs satisfying heat kernel estimates for a wide class of space–time scaling functions are given. The equivalence of the two-sided heat kernel estimate and the parabolic Harnack inequality is also shown via the equivalence of the upper (lower) heat kernel estimate to the parabolic mean value (and super mean value) inequality.
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
In this paper we consider an absorbing Markov chain with finite number of states. We focus especially on random walk on transient states. We present a graph reduction method and prove its validity. Using this method we build algorithms which allow us to determine the distribution of time to absorption, in particular we compute its moments and the probability of absorption. The main idea used in the proofs consists in observing a nondecreasing sequence of stopping times. Random walk on the initial...
A directed-edge-reinforced random walk on graphs is considered. Criteria for the walk to end up in a limit cycle are given. Asymptotic stability of some neural networks is shown.