Page 1

Displaying 1 – 5 of 5

Showing per page

Reduction of absorbing Markov chain

Mariusz Górajski (2009)

Annales UMCS, Mathematica

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...

Reinforced walk on graphs and neural networks

Józef Myjak, Ryszard Rudnicki (2008)

Studia Mathematica

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.

Currently displaying 1 – 5 of 5

Page 1