• Tidak ada hasil yang ditemukan

getdocb18b. 234KB Jun 04 2011 12:04:51 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "getdocb18b. 234KB Jun 04 2011 12:04:51 AM"

Copied!
17
0
0

Teks penuh

Loading

Gambar

Figure 1: Explicit construction of a 5-regular graph on which the random walk exhibits total-variation cutoff.
Figure 2: Extension of the explicit expanders with cutoff to graphs with prescribed order of cutofflocation.

Referensi

Dokumen terkait

If the minimum of the lattice is even, then the dimension of an s-extremal lattices can be bounded by the theory of modular forms.. This shows that such lattices are also extremal

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

Furthermore, the criterion applies to two important classes of branching random walks and implies that the critical branching random walk is transient resp.. dies

CENTRAL LIMIT THEOREMS FOR THE PRODUCTS OF RANDOM MATRICES SAMPLED BY A RANDOM WALK.. FR´ ED´ ERIQUE DUHEILLE-BIENVEN

In this paper, we aim to study the small-scale limit of spatial-temporal random field arising from the solution of the fractional Riesz-Bessel equation and its associated system

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

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,

We study the entropy of the distribution of the set R n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps.. It is shown that this