• Tidak ada hasil yang ditemukan

getdoceca6. 276KB Jun 04 2011 12:05:09 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "getdoceca6. 276KB Jun 04 2011 12:05:09 AM"

Copied!
22
0
0

Teks penuh

Loading

Referensi

Dokumen terkait

Connections are made with an existing condition number for π T , and the results are applied to the class of Markov chains arising from a random walk on a tree..

The above strategy was adopted earlier by one of the authors for branching random walk in random environment [ 10 ]. There, the Markov chain alluded to above is simply the product

ABSTRACT: Berestycki and Durrett used techniques from random graph theory to prove that the distance to the identity after iterating the random transposition shuffle undergoes

The first example of a family of bounded-degree graphs where the random walk exhibits cutoff in total-variation was provided only very recently, when the authors showed this for

From the earlier studies of random walks on fractals it is known that the walk is ruled by two parameters, by the fractal dimension and an exponent describing the conductivity of

We study the problem of directed polymers in gaussian environments in Z d from the viewpoint of a gaussian family indexed by the set of random walk paths.. In the zero-temperature

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

Our aim here is to reproduce the analysis of [ 5 ] in the case of a random potential, which is stationary in space : the solution of the stochastic equation starting from a soliton