getdocf0f4. 363KB Jun 04 2011 12:05:10 AM
Teks penuh
Garis besar
Dokumen terkait
Recently much work has been done on the (simple or not) random walk on the unique infinite cluster for the supercritical (bond or site) percolation in Z d (see e.g.. Another
We prove that the scaling limit of nearest-neighbour senile reinforced random walk is Brownian Motion when the time T spent on the first edge has finite mean.. We show that
We prove a non-standard functional limit theorem for a two dimensional simple random walk on some randomly oriented lattices.. This random walk, already known to be transient, has
Keywords interacting diffusion, clustering, infinite particle system, delayed coalescing random walk with immigration, transformed Fisher-Wright tree, low dimensional systems,
A central limit theorem for random walk in a random environment on marked Galton-Watson trees.. Gabriel
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely.. In particular, the comb lattice,
In this article, we will explore why Karlin-McGregor method of using orthogonal polynomials in the study of Markov processes was so successful for one dimensional nearest
In- deed, one operates first a time change to bring up the fact that the random walk viewed only on a strong cluster (i.e. constituted of edges of order 1) has a standard
