In this last subsection, we give a concrete approximation of non-symmetric diffusions in diver-gence form.
For a matrix a= (aij)di,j=1 we denote by ˜a the symmetric and by ˆa the antisymmetric part.
Also forξ ∈Rd, let
≠ξ, aξÆ
= Xd
i,j
ξiaijξj = Xd
i,j
ξia˜ijξj and kak= max
i
X
j
|aij|.
For≤, M1, M2 >0 be denote by
Md(≤, M1.M2) ={a= ˜a+ ˆa: ≠ ξ, aξÆ
≥≤kξk2 and k˜ak ≤M1, kˆak ≤M2}
the set of uniformly elliptic, bounded matrices. Clearly a is symmetric if and only if M2 = 0.
Given a measurable map a : Rd → Md(≤, M1, M2), our goal is to find a sequence of Markov chains that approximate the diffusion process whose divergence form is determined bya. Thanks to Theorem 4.6, all we need is to find a sequence (Γn, αn) where Γnis a collection of cyclesγin, i∈ I in Sn with weights αn(γin)≥0 such that (2.2) and (2.8) are satisfied and the corresponding Fijn(·) converges locally inL1(Rd) to aij, that is, for allK compact subset of Rd
nlim→∞kFijn−aijkK = lim
n→∞
Z
K|Fijn(x)−aij(x)|dx= 0, ∀i, j = 1, .., d, (5.22) where as usual we write Fijn(x) = Fijn([x]n) for x ∈ Rd. In Theorem 5.4, which is our main theorem, we will prove that it is possible to find such a sequence.
Our construction will be based on a two scale procedure: we will discretize the matrix a(·) at intermediate scale rn = [n1−β]/n, for some β ∈ (0,1) and then construct the corresponding chain on Sn at microscopic scale 1/n.
Clearly, if an:Rd→ Md(≤, M1, M2) is a sequence such that
nlim→∞kanij −aijkK = 0 and lim
n→∞kFijn−anijkK = 0, (5.23) then by the triangle inequality (5.22) holds.
We start with a trivial observation: let (Γ1n, α1n) and (Γ2n, α2n) be two such collections and consider the merged collection Γn = Γ1n∪Γ2n with weightsαn(γn) = αin(γn) if γn∈Γin, then the corresponding Fn satisfies the additive rule
Fijn=Fij1,n+Fij2,n. (5.24) Also if both (Γin, αin) satisfy (2.2) then of course (Γn, αn) satisfy (2.2).
This additive rule will be a very useful tool for our construction and we will proceed itera-tively. Let us introduce the set of strongly uniformly elliptic bounded symmetric matrices:
M(3)d (≤, M1) = {a= ˜a :aii− X
j:j6=i
|aij| ≥≤, i= 1, ..., d, kak ≤M1}, and for N ∈N the set of “almost” antisymmetric bounded matrices:
M(1)d (N, M2) ={a :aij =−aji, 1≤i < j≤d, aii = 1 2N
X
j:j6=i
|aij|,kak ≤M2}. The appearance of the diagonal term will be explained below.
Next for given L∈N, let
M(2)d (L, M1) = {a = ˜a :aij = Xd
k=1
νkVik·Vjk, i, j ∈ {1, ..., d},
for νk≥0, Vk ∈[−L, L]d∩Zd, k= 1, ..., d, kak ≤M1},
be the set of symmetric matrices with non-negative eigenvalues and integer valued eigenvectors.
Lemma 5.1 Leta ∈ Md(≤, M1, M2) and chooseL >[9dM1/≤]and N >[3M2/2≤], then we can find b(1) ∈ M(1)d (N, M2), b(2) ∈ M(2)d (L, M1), b(3) ∈ M(3)d (≤/3, M1) such that
a=b(1)+b(2)+b(3). (5.25)
Proof.Setb =a−≤I, and writeb= ˜b+ˆbwhere ˜bis the symmetric part and ˆbthe antisymmetric part of b. Set
b(1)ij =−b(1)ji = ˆbij, i6=j, b(1)ii = 1 2N
X
j:j6=i
|ˆbij|. Note that
b(1)ii ≤ M2
2N ≤≤/3.
Next let U1, ..., Ud∈ Rd and ν1, ..., νd ∈R+ be the eigenvectors and eigenvalues of ˜b. We may assume that the vectors are orthonormal: Uk·Ul =δk,l and therefore
˜bij = Xd
k=1
νkUik·Ujk. Let
Vik = [LUik], λk = νk
L2. then Vk ∈Zd∩[−L, L]d and writing ¯Vik = [LUik]/L, we have
|Ujk−V¯jk| ≤ 1
L, |V¯jk| ≤|Ujk| ≤1.
Define
b(2)ij = Xd
k=1
λkVik·Vjk= Xd
k=1
νkV¯ik·V¯jk and
b(3) =a−b(1)−b(2)=≤I+ ˜b−b(2)+ ˆb−b(1). Note thatb(3) is symmetric by construction with
b(3)ij = ˜bij −b(2)ij , 1≤i < j ≤d, b(3)ii =≤+ ˜bii−b(2)ii −b(1)ii , i= 1, ..., d.
We claim that
k˜b−b(2)k ≤ 3dM1
L ≤≤/3, (5.26)
which implies
b(3) ∈ M(3)d (≤/3, M2).
By the triangle inequality we have kb(2)−˜bk ≤
Xd
k=1
maxi
Xd
j=1
νk|Uik·Ujk−V¯ikV¯jk|
where
|Uik·Ujk−V¯ikV¯jk| ≤|V¯ik||Ujk−V¯jk|+|V¯jk||Uik−V¯ik|+|Uik−V¯ik||Ujk−V¯jk| ≤ 2 + L1
L ≤ 3
L Thus
kb(2)−˜bk ≤ 3d L
Xd
k=1
νk ≤ 3dM1
L .
§ In view of the additive rule, it thus suffices to find a collection of cycles Γknsuch thatFijk,n(·) converges locally in L1(Rd) to b(k)ij , for each k = 1,2,3.
Examples 1 and 2 of the previous section imply the following.
Lemma 5.2 Let M, N and L be fixed and bn:Sn→[0, M] be such that
nlim→∞kbn(· +y/n)−bnkK = 0, ∀y∈Zd, ∀K ⊂Rd compact. (5.27) a) Referring to Example 1, for given fixed V ∈[−L, L]d∩Zd, take
Γn={γxn= (x, x+V /n, x), x∈ Sn}, with weights αn(γxn) =bn(x), x∈ Sn, and set an∈ M(3)d (L, M) by
anij(x) =bn([x]n)Vi·Vj, 1≤i, j ≤d, x∈Rd. Then for every K ⊂Rd compact, limn→0kFijn−anijkK = 0.
b) Referring to Example 2, for fixed N and l6=m∈ {1, ..., d}, take Γn={γN,xn,(l,m), x∈ Sn}, with weights αn(γN,xn,(l,m)) = bn(x)
4N2 , x∈ Sn, and set an∈ M(1)d (N, M) by
anl,l(x) = anm,m(x) = bn([x]n)
2N , anl,m(x) =−anm,l(x) =bn([x]n), anij(x) = 0, i, j /∈ {l, m}, for x∈Rd. Then for every K ⊂Rd compact, limn→0kFijn−anijkK = 0.
Proof.Since V is constant, we first see that R2,nij (z) = R3,nij (z) = 0, cf. (5.17). Next using the fact that |bn(x)| ≤M, |Vi| ≤L we get in view of (5.11) and (5.21) writing kyk1 =Pd
i=1|yi|,
|R1,nij (z)| ≤L2 max
y:kyk1≤L|bn(z+y/n)−bn(z)| ≤L2 X
y:kyk1≤L
|bn(z+y/n)−bn(z)|, and
|R4,nij (z)| ≤4N2 max
y:kyk1≤4N|bn(z+y/n)−bn(z)| ≤4N2 X
y:kyk1≤4N
|bn(z+y/n)−bn(z)|.
Using our assumption this yields
nlim→0kRijk,nkK = 0, k= 1,4,
and implies the result. §
Take β ∈(0,1), set rn= [n1−β]/n∈(1/n)Z+, Jrn =rnZd⊂ Sn, and let Q(x, rn) = {y∈Rd: 0≤min
i (yi−xi)≤max
i (yi−xi)< rn}, x∈Jrn, be a partition of disjoint cubes of Rd. For a measurable mapa :Rd → Md(≤, M1, M2), set
anij(y) = X
x∈Jrn
≥ 1 rdn
Z
Q(x,rn)
aij(z)dz¥
1Q(x,rn)(y), y∈Rd. Then
an(x)∈ Md(≤, M1, M2), ∀x∈ Sn, and for every compactK ⊂Rd we have
nlim→∞kanij −aijkK = 0. (5.28) Furthermore,anij(x) is a rn-piecewise constant function, that is
anij(x) = anij≥ (rn[x1
rn
],· · · , rn[xd
rn
])¥
, x= (x1,· · ·xd)∈ Sn.
As we see, rn is an “intermediate” scale and anij is an approximation of aij which is constant in each cell of Jrn.
Lemma 5.3 a) Let bn : Sn → [−M, M] be rn-piecewise constant. Then for each compact K ⊂Rd and fixed y∈Zd,
kbn(·)−bn(·+y/n)kK ≤ kyk1CKM
[n1−β] (5.29)
for some CK < ∞ depending on the diameter of K, where n is taken large enough so that [n1−β]≥2kyk1.
b) Referring to Example 1, let bn : Sn → [0, M] and Vn : Sn → [−L, L]d∩Zd be rn-piecewise constant and take
Γn={γxn= (x, x+Vn(x)/n, x), x∈ Sn}, with weights αn(γxn) =bn(x), x∈ Sn, and set an∈ M(2)d (L, M) by
anij(x) = bn([x]n)Vin([x]n)·Vjn([x]n), 1≤i, j ≤d, x∈Rd. Then for every K ⊂Rd compact, limn→0kFijn−anijkK = 0.
Proof. a) Simply note that
bn(z) = X
x∈Jrn
bn(x)1Q(x,rn)(z) and therefore
kbn(·)−bn(·+y/n)kK ≤M X
x∈Jrn
ØØ Ø
Z
K
(1Q(x,rn)([z]n)−1Q(x,rn)([z]n+y/n))dzØØØ. Now for the interior points of Q(x, rn) such that
IQ(x, rn,kyk1/n) :={z ∈Q(x, rn) :kyk1/n≤min
i (zi−xi)≤max
i (zi−xi)≤rn− kyk1/n}, we clearly have
1Q(x,rn)(z)−1Q(x,rn)(z+y/n) = 0, z ∈IQ(x, rn,kyk1/n).
So all what remains are the boundary terms
BQ(x, rn,kyk1/n) := Q(x, rn)\IQ(x, rn,kyk1/n)
with X
x∈Jr
ØØ Ø
Z
K
(1BQ(x,rn,kyk1/n)([z]n)dzØØØ≤ kyk1CK [n1−β] . b) In view of (5.7), (5.11)–(5.12) we have
|Rij1,n(z)| ≤CLd+1 max
y:kyk1≤L|bn(z+y/n)−bn(z)| ≤CLd+1 X
y:kyk1≤L
|bn(z+y/n)−bn(z)|,
|Rij2,n(z)| ≤CM Ld max
y:kyk1≤L|Vjn(z+y/n)−Vjn(z)| ≤CM Ld X
y:kyk1≤L
|Vjn(z+y/n)−Vjn(z)|, and a) shows that kR1,nij kK and kR2,nij kK → 0 as n → ∞. Next note that (5.17) implies R3,nij (z) = 0 if z ∈ ∪x∈JrnIQ(x, rn, L/n) and by (5.7), (5.13), |R3,nij (z)| ≤ CM Ld+1 if z ∈
∪x∈JrnBQ(x, rn, L/n). As in a) this shows kRij3,nkK →0 as n → ∞. § Next set
bn(x) =an(x)−≤I, x∈ Sn,
and denote by ˜bn(x) and ˆbn(x) the symmetric and antisymmetric part of bn(x). Choose N = [3M2/≤] + 1, L= [9dM1/≤] + 1, and define b(i),n(x) as in Lemma 5.1, that is
an(x) =b(1),n(x) +b(2),n(x) +b(3),n(x) where b(1),n(x)∈ M(1)d (N, M2), b(3),n(x)∈ M(3)d (≤/3, M1), and
b(2)ij (x) = Xd
k=1
λnk(x)Vik,n(x)·Vjk,n(x)∈ M(2)d (L, M1).
Note that by construction, b(1),n, b(3),n, λnk and Vk,n are bounded and rn-piecewise constant, so by Lemma 5.3 a), for all compact K ⊂Rd and fixedy ∈Zd,
kb(1),nij (· +y/n)−b(1),nij kK ≤ kyk1CKM2
[n1−β] , kb(3),nij (· +y/n)−b(3),nij kK ≤ kyk1CKM1
[n1−β] , (5.30) kVjk,n(· +y/n)−Vjk,nkK ≤ kyk1CKL
[n1−β] , (5.31)
kλnk(· +y/n)−λnkkK ≤ kyk1CKM1
[n1−β] . (5.32)
For b(1)(x)∈ M(1)d (N, M2) consider (Γ(1),n, αn) as follows
Γ(1),n ={γn,(i,j)N,x , γN,xn,(j,i), 1≤i < j ≤d, x∈ Sn} with weights
αn(γN,xn,(i,j)) = (b(1),nij (x))+
4N2 = (ˆanij(x))+
4N2 , αn(γN,xn,(j,i)) = (b(1),nij (x))−
4N2 = (ˆanij(x))− 4N2 ,
where a+:=a∨0 and a−= (−a)∨0 fora∈R. Then, in view of (5.30), the additive rule and Lemma 5.2 b), we see that the corresponding Fij(1),n satisfies
nlim→∞kFij(1),n−b(1),nij kK = 0.
Next consider (Γ(2),n, αn) of the form
Γ(2),n ={γxk,n = (x, x+Vk,n(x)/n, x), with weights αn(γxk,n) = λnk(x), k = 1, ..., d, x∈ Sn}, then in view of (5.31) and (5.32), Lemma 5.3 b) and the additive rule, we see that the corre-sponding Fij(2),n satisfies
nlim→∞kFij(2),n−b(2),nij kK = 0.
Finally for
b(3),n(x) = an(x)−b(1),n(x)−b(2),n(x)∈ M(3)d (≤/3, M), take (Γ(3),n, αn) of the form
Γ(3),n ={γijn,±(x) = (x, x+ei/n±ej/n, x),1≤i < j≤d, γin(x) = (x, x+ei/n, x), x∈ Sn} with weights
αn(γijn,+(x)) = (b(3),nij (x))+, αn(γijn,−(x)) = (b(3),nij (x))−, αn(γin(x)) =b(3),nii (x)−X
j:j6=i
|b(3),nij (x)| ≥≤/3, x∈ Sn. We callγin(x) a nearest neighbor cycle and γijn,±(x) a diagonal cycle.
Then using (5.30), the additive rule and the Lemma 5.2 a), we see that the corresponding Fij(3),n satisfies
nlim→∞kFij(3),n−b(3),nij kK = 0.
Putting things together we have the following.
Theorem 5.4 For any measurable map a : Rd → Md(≤, M1, M2), we can find a sequence (Γn, αn)that satisfies(2.2) in Assumption 2.1 and(2.8), (2.9) in Assumption 2.3, such that the correspondingFijn(x) converges to aij(x)locally in L1(Rd). Furthermore, writing Γn={γn,i, i∈ I}, each cycle γi,n is either a two cycle or a rotational cycle that satisfies
αn(γn,i)≤max(M1, M2), `(γn,i)≤max(2,8([3M2/≤] + 1)), Range(γn,i)≤max(2,[9dM1/≤] + 1)/n, ∀i, n, and (2.8) is satisfied with N = 1 and δ=≤/3.
Note thatαn(γi,n)≥0 in the above construction. However, by neglecting cycles withαn(γi,n) = 0, we may say that weights of cycles in Γn are all positive.
Remark 5.5 (i) Our construction is very explicit. For example, when approximating a sym-metric diffusion matrix in [SZ], they have additional procedure of smoothing the matrix by convolution, whereas we can avoid this procedure. We think that our construction is practical in that it is useful when simulating diffusions in divergence form.
(ii) As we have seen, once the lattice approximation of the symmetric part is computed, the antisymmetric part can be easily dealt with rotational cycles which are just translates of a fixed cycle. In general we need to compute the eigenvalues and eigenvectors of the symmetric part.
However if the symmetric part of an is strongly irreducible, that is if
˜
an(x)∈ M(3)d (≤, M1), ∀x∈ Sn,
then we can avoid the computation of eigenvalues and eigenvectors. In this case, we only use nearest neighbors cycles and diagonal cycles.
(iii) Although we do not investigate the convergence speed of our approximation it is very natural to take β = 1/2, since for “nice” a(x) we expect
kanij −aijkK =O(n−β), whereas
kanij −anij(· +y/n)kK =O(n−1+β).
Finally we demonstrate that for the two dimensional case, we can make approximation without computing the eigenvalues and eigenvectors of the diffusion matrix.
Example 3: (2-dimensional case.) Consider a measurable mapa(0)ij :R2 → Md(≤, M1, M2).
For simplicity we use the following notation:
a(0)1,1(x) =a(x) +≤, a(0)2,2(x) = c(x) +≤, a(0)1,2(x) = b(x) +d(x), a(0)2,1(x) = b(x)−d(x), where
a(x), c(x)≥0, a(x)c(x)≥b2(x). (5.33)
As above we define an(x) by integration as follows an(y) = X
x∈Jrn
≥1 rn2
Z
Q(x,rn)
a(z)dz¥
1Q(x,rn)(y), y∈R2,
and define bn(x), cn(x), dn(x) similarly. Next, for L∈N, define anL,a¯nL, cnL,c¯nL, and bnL,¯bnL by anL(x) = [L·an(x)]
L , ¯anL(x) = an(x)−anL(x), cnL(x) = [L·cn(x)]
L , ¯cnL(x) = cn(x)−cnL(x), bnL(x) = [L·(bn(x))+]
L − [L·(bn(x))−]
L , ¯bnL(x) = bn(x)−bnL(x).
Note that
0≤¯anL(x)≤ 1
L, 0≤¯cnL(x)≤ 1
L, |¯bnL(x)| ≤ 1
L, |bnL(x)| ≤|bn(x)|. (5.34) We first deal with the antisymmetric part: for fixed N ∈N, consider a family of rotational cycles {γN,xn,(1,2), γN,xn,(2,1), x∈ Sn}with weights
αn(γN,xn,(1,2)) = (dn(x))+
4N2 , αn(γN,xn,(2,1)) = (dn(x))− 4N2 .
As in Lemma 5.2 b), the corresponding diffusion matrix, denoted by a(1)(x), is of the form a(1)1,1(x) =a(1)2,2(x) = |d(x)|
2N , a(1)1,2(x) = −a(1)2,1(x) =d(x).
Next consider the family of cycles {γxn,2 = (x, x+Vn(x)/n, x), x ∈ Sn} where Vn(x) = (V1n(x), V2n(x))∈Z2 is of the form
V1n(x) = (LanL(x) + 1)1{anL(x)≤cnL(x)}+LbnL(x)1{anL(x)>cnL(x)}, V2n(x) =LbnL(x)1{anL(x)≤cnL(x)}+ (LcnL(x) + 1)1{anL(x)>cnL(x)}, with weights
αn(γxn,2) = 1
L2anL(x) +L1{anL(x)≤cnL(x)}+ 1
L2cnL(x) +L1{anL(x)>cnL(x)}. This yields the following corresponding diffusion matrixa(2)(x) (cf. Lemma 5.3 b))
a(2)1,1(x) = (aL(x) + 1
L)1{aL(x)≤cL(x)}+ b2L(x)
cL(x) + L11{aL(x)>cL(x)}, a(2)2,2(x) = b2L(x)
aL(x) + L11{aL(x)≤cL(x)}+ (cL(x) + 1
L)1{aL(x)>cL(x)},
a(2)1,2(x) = a(2)2,1(x) =bL(x).
Here and in the following, we omit the super-suffix n.
The third family of cycles is of the form
{γxn,3,+ = (x, x+e1/n+e2/n, x), γxn,3,−= (x, x+e1/n−e2/n, x), x∈ Sn} with weights
αn(γxn,3,+) = (¯bL(x))+, αn(γxn,3,−) = (¯bL(x))−, yields the diffusion matrix (cf. Lemma 5.2 a))
a(3)1,2(x) =a(3)2,1(x) = ¯bL(x) a(3)1,1(x) =a(3)2,2(x) = |¯bL(x)|. Putting things together we see that
a(1)1,1(x) +a(2)1,1(x) +a(3)1,1(x)
= |d(x)|
2N + (aL(x) + 1
L)1{aL(x)≤cL(x)}+ b2L(x)
cL(x) + L11{aL(x)>cL(x)}+|¯bL(x)|, a(1)2,2(x) +a(2)2,2(x) +a(3)2,2(x)
= |d(x)|
2N + (cL(x) + 1
L)1{cL(x)<aL(x)}+ b2L(x)
aL(x) + L11{cL(x)≥aL(x)}+|¯bL(x)|, a(1)1,2(x) +a(2)1,2(x) +a(3)1,2(x) = d(x) +bL(x) + ¯bL(x) =a(0)1,2(x),
a(1)2,1(x) +a(2)2,1(x) +a(3)2,1(x) = −d(x) +bL(x) + ¯bL(x) =a(0)2,1(x).
What remains is the matrix
a(4)(x) = a(0)(x)−a(1)(x)−a(2)(x)−a(3)(x) which is a diagonal matrix. Now if we choose, L, N so large that
≤≥ 3 L + M2
2N. Note that for a.e. x and all δ, by taking n large, we have
(aL(x) + 1
L)(cL(x) + 1
L)≥(bn(x))2−δ≥(bL(x))2−δ, which is due to (5.33) and (5.34). So, for large n, we see that
a(4)1,1(x)≥0 and a(4)2,2(x)≥0. (5.35) Now we choose the last family of cycle
{γxn,4,i = (x, x+ei/n, x), i= 1,2, x∈ Sn} with weights
αn(γxn,4,i) =a(4)ii (x), i= 1,2, which simply gives the diffusion matrixa(4)(x).
Acknowledgment. The authors thank M.T. Barlow and T. Shirai for stimulating discussions, and I. Shigekawa for valuable comments on Lemma 3.1.
References
[Al] G.K. Alexopoulos. Random walks on discrete groups of polynomial volume growth. Ann.
Probab. 30 (2002), 723–801.
[BBCK] M.T. Barlow, R.F. Bass, Z.-Q. Chen and M. Kassmann. Non-local Dirichlet forms and symmetric jump processes. Trans. Amer. Math. Soc. 361 (2009), 1963–1999.
[BGK] M.T. Barlow, T. Kumagai and A. Grigor’yan. On the equivalence of parabolic Harnack inequalities and heat kernel estimates. Preprint 2011.
http://www.kurims.kyoto-u.ac.jp/∼kumagai/bgkhar-resubmit.pdf
[BK] R.F. Bass and T. Kumagai. Symmetric Markov chains on Zd with unbounded range.
Trans. Amer. Math. Soc. 360 (2008), 2041–2075.
[BKU] R.F. Bass, T. Kumagai and T. Uemura. Convergence of symmetric Markov chains on Zd. Probab. Theory Relat. Fields 148 (2010), 107–140.
[CKS] E.A. Carlen, S. Kusuoka and D.W. Stroock. Upper bounds for symmetric Markov transition functions. Ann. Inst. Henri Poincar´e-Probab. Statist.23 (1987), 245-287.
[DK] J-D. Deuschel and H. K¨osters. The quenched invariance principle for random walks in random environments admitting a bounded cycle representation. Ann. Inst. Henri Poincar´e 44 (2008), 574–591.
[Du] N. Dungey. Properties of centered random walks on locally compact groups and Lie groups. Rev. Mat. Iberoamericana23 (2007), 587–634.
[FS] E.B. Fabes and D.W. Stroock. A new proof of Moser’s parabolic Harnack inequality using the old ideas of Nash. Arch. Mech. Rat. Anal. 96 (1986), 327–338.
[FOT] M. Fukushima, Y. Oshima and M. Takeda. Dirichlet Forms and Symmetric Markov Processes. deGruyter, Berlin, 1994.
[MR] Z.-M. Ma and M. R¨ockner. Introduction to the Theory of (Non-Symmetric) Dirichlet Forms. Springer-Verlag, New York, 1992.
[Ma] P. Mathieu. Carne-Valopoulos bounds for centered random walks. Ann. Probab. 34 (2006), 987–1011.
[SC] L. Saloff-Coste. Aspects of Sobolev-Type inequalities. Lond. Math. Soc. Lect. Notes 289, Cambridge Univ. Press, 2002.
[SV] D.W. Stroock and S.R.S. Varadhan. Multidimensional Diffusion Processes. Springer-Verlag, Berlin, 1979.
[SZ] D.W. Stroock and W. Zheng. Markov chain approximations to symmetric diffusions. Ann.
Inst. Henri. Poincar´e-Probab. Statist. 33 (1997), 619-649.