vol10_pp01-15. 221KB Jun 04 2011 12:05:49 AM
Teks penuh
Garis besar
Dokumen terkait
Merkl and Rolles (see [14]) studied the recurrence of the original reinforced random walk, the so-called linearly bond-reinforced random walk, on two-dimensional graphs.. Sellke
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local “random-to-front” reorderings, driven by a probability
The case of Markov chains was first considered by Marton [20; 21] : for uniformly contracting Markov chains, in particular for ergodic Markov chains with finite state space,
Lawler (1990): Non-intersection exponents for random walk and Brownian motion. Part II: Estimates and applications to a random
If a random walk characterized by conductances is started at the root of a tree, it is well known [3] that the escape probability equals the ratio of the effective conductance of
In the following we give a short description of the standard branching random walk, its intrinsic martingales and an associated multiplicative random walk.. Consider a
Abstract We give sharp rates of convergence for a natural Markov chain on the space of phylogenetic trees and dually for the natural random walk on the set of perfect matchings in
It was proved in (7) that SLE(2) is the scaling limit of the corresponding loop-erased random walk (LERW), and SLE(8) is the scaling limit of some uniform spanning tree (UST)
