getdocf211. 198KB Jun 04 2011 12:05:11 AM
Teks penuh
Gambar
Garis besar
Dokumen terkait
Nevertheless, these results are strong enough to be able to determine the inertia set of each graph on 6 or fewer vertices and can be applied to many graphs with larger order as
Shi on the asymptotic behavior of the survival probability of the branching random walk killed below a linear boundary, in the special case of deterministic binary branching and
One example of a graph model for obtaining a prescribed degree distribution is the so called configuration model – see Molloy and Reed (1995,1998) – where, given n vertices, each
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
An exact general formula for the expected length of the minimal spanning tree (MST) of a connected (possibly with loops and multiple edges) graph whose edges are assigned
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)
Here we again consider continuous time simple random walks, and initially the particle from the origin is infected, while the other particles are healthy.. Infected particles
Thus we have a coupling based proof of the n log n + O ( n ) mixing time bound for the lazy random walk against a Cayley adversary.. This also works against a holomorphic adversary,
