getdocdc93. 423KB Jun 04 2011 12:05:04 AM
Teks penuh
Gambar
Garis besar
Dokumen terkait
The problem of finding the minimum rank (maximum nullity) of edge subdivisions of a given graph G is investigated.. Is is shown that if an edge is adjacent to a vertex of degree 1 or
This main result of this paper is that Keane’s one-time reinforced random walk on a ladder is recurrent for any positive reinforcement parameter δ
Furthermore, the criterion applies to two important classes of branching random walks and implies that the critical branching random walk is transient resp.. dies
While it is expected that on a graph of polynomial growth the sizes of the range of the unrestricted random walk and of its bridge are the same in first order, this is not the case
A central limit theorem for random walk in a random environment on marked Galton-Watson trees.. Gabriel
We will prove that if a limit measure is not absolutely continuous with respect to the Lebesgue measure then the corresponding random walk on the self similar graph does not have
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
Keywords: Local time, favourite site, random walk, Wiener process AMS subject classification: 60J55, 60J15, 60J65.. Submitted to EJP on March
