Consider a lattice graph X realized in a k-dimensional vector space V (we shall use the same symbol X also for the set of vertices by abuse of notations). What we should have here in mind as a lattice graph is a generalization of classical lattices graphs such as the hyper-cubic lattice in R~k, the triangular lattice and the hexagonal lattice in R~2. We shall show, by using our previous result, that, as the mesh of X goes to zero, the simple (isotropic) random walk on X "converges" to the Brownian motion on V with a suitable Euclidean structure. More precisely, we shall prove
展开▼
