Hydrodynamic limit of the Symmetric Exclusion Process on a compact Riemannian manifold
Bart van Ginkel, Frank Redig

TL;DR
This paper proves that the symmetric exclusion process on random grids approximating a compact Riemannian manifold converges to the heat equation, establishing a hydrodynamic limit linking microscopic particle dynamics to macroscopic diffusion.
Contribution
It demonstrates the convergence of random walks to Brownian motion and the empirical density field to the heat equation on the manifold, bridging stochastic processes and PDEs on curved spaces.
Findings
Random walks on grids converge to Brownian motion on the manifold.
Empirical density fields converge to the heat equation solution.
Provides a rigorous hydrodynamic limit for exclusion processes on manifolds.
Abstract
We consider the symmetric exclusion process on suitable random grids that approximate a compact Riemannian manifold. We prove that a class of random walks on these random grids converge to Brownian motion on the manifold. We then consider the empirical density field of the symmetric exclusion process and prove that it converges to the solution of the heat equation on the manifold.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Hydrodynamic limit of the Symmetric Exclusion Process on a compact Riemannian manifold
Bart van [email protected]
Frank [email protected]
(TU Delft
)
Abstract
We consider the symmetric exclusion process on suitable random grids that approximate a compact Riemannian manifold. We prove that a class of random walks on these random grids converge to Brownian motion on the manifold. We then consider the empirical density field of the symmetric exclusion process and prove that it converges to the solution of the heat equation on the manifold.
1 Introduction
Hydrodynamic limits of interacting particle systems is a well established subject. A large variety of parabolic equations (such as the non-linear heat equation) and hyperbolic conservation laws have been obtained from microscopic stochastic particle systems; see Kipnis and Landim (1999), DeMasi and Presutti (2006), Seppäläinen (2008) for overviews. Usually, the setting here is that in the underlying particle system the particles move on the lattice , and after rescaling the limiting partial differential equation is defined on , or on a subdomain of such as an interval, where then equations with boundary conditions on the ends of the interval are derived (e.g. Dirichlet boundary conditions for the case where at the right and left end the system is coupled to a reservoir fixing the density of particles, see Gonçalves (2017)).
Motivated e.g. by the study of the motion of proteins in a cell-membrane, or more general motion of particles on curved interfaces, it is clear that there are many relevant physical systems of which the macroscopic motion takes place on a Riemannian manifold rather than on Euclidean space. It is the aim of this paper to provide first steps in this direction, by considering the simplest interacting particle system on a suitable discretization of a Riemannian manifold and proving its hydrodynamic limit. The symmetric exclusion process is a well-known and well-studied interacting particle system for which in standard setting it is rather straightforward to obtain the hydrodynamic limit using duality. Duality allows to translate the one-particle scaling limit, i.e., the fact that the rescaled single particle position converges to Brownian motion to the fact that the hydrodynamic limit of the particle system is the diffusion equation. Another manifestation of duality is the fact that the microscopic equation for the expectation of the density field is already a closed equation. We consider the symmetric exclusion process on a suitable discretization (a notion defined more precisely below) of a compact Riemannian manifold and prove that its empirical density field, after appropriate rescaling, converges to the solution of the heat equation on the manifold. To obtain this result, we start in section 2 by studying the invariance principle of a class of geodesic random walks, thereby extending earlier results of Jørgensen (1975). These random walks are shown to converge to Brownian motion, via the technique of generator convergence. Next, in section 3, we define a notion of “uniformly approximating grids” and show that choosing uniformly points on the manifold, and connecting them via a kernel depending on the Riemannian distance yields a weighted graph such that the corresponding random walk converges (as the number of random points tends to infinity) to a geodesic random walk which in turn scales to Brownian motion. We also formulate abstract conditions on approximating grids ensuring the convergence of the weighted random walk to Brownian motion. In particular, convergence of the empirical distribution to the normalized Riemannian volume in Kantorovic distance is shown to be sufficient, i.e. we show that in that setting weights can be chosen such that the corresponding random walk converges to Brownian motion. We give several examples of such suitable grids. Finally, in section 4, we define the exclusion process on such suitable grids (defined in section 3) and show that its empirical density converges to the solution of the heat equation, following the proof from Seppäläinen (2008).
2 The invariance principle for a class of geodesic random walks
Let be an -dimensional, compact and connected Riemannian manifold. Then we know that is complete and hence geodesically complete. The main purpose of this section is to define the geodesic random walk and to show that it approximates Brownian motion when appropriately rescaled (in time and space). Such random walks and this so-called invariance principle have been studied before (Jørgensen (1975) and in a special case Blum (1984)). However we will directly obtain results that are tailor-made to apply them in section 3. In particular, we will obtain general assumptions on the jumping distributions of the geodesic random walk for it to converge to Brownian motion. In section 2.1, we define the geodesic random walk and show convergence of the generators to the generator of Brownian motion under certain assumptions on the jumping distributions. Section 2.2 is devoted to finding out which distributions satisfy these assumptions.
2.1 Convergence of the generators
**The process
**Let be a collection of positive, finite measures where each is a measure on . The measure represents the rate to jump in a particular direction of . More precisely, the Markov process associated to has generator
[TABLE]
where for a vector we denote the geodesic through with tangent vector at by . We denote the corresponding semigroup by
[TABLE]
Both of these have the continuous functions on the manifold as their domain.
We interpret this process as follows. When the process is at a point , it chooses a random direction from with rates given by (i.e. it waits for an exponential time with rate and then independently picks a vector according to the probability distribution ). Then the process jumps to the position that is reached by following the geodesic through in the direction of for time . This situation is sketched in figure 1. We assume that choosing random directions happens independently. In this section we will specify restrictions that the measures should satisfy. Later (in section 2.2), we will show that we can take to be for instance the uniform distribution on the unit tangent vectors at .
**The case
**Before we go into the general case, we illustrate the above in . In the exponential map is simply addition if we identify with itself. So in that case from a point the process moves to where is chosen from randomly. This means that the discrete time jumping process when jumping as described above, can be denoted by where is drawn from according to some distribution. Now let be a Poisson process with rate one and define . Then makes the same jumps as , but after independent exponential times. We see that satisfies the description above. Now the invariance principle tells us that under some conditions on the jumping rates in distribution as goes to infinity, where is Brownian motion. We show the analogous result in the more general setting of a manifold.
**Aim
**We denote the Laplace-Beltrami operator on the manifold by . The rest of this section will be devoted to the proof of the following result.
Proposition 2.1 .
Suppose that in the situation above we have:
- •
**
- •
**
- •
* and in each coordinate system around *
Then for : uniformly on .
The first assumption requires that the supports of the measures and their total masses are bounded uniformly over all points of the manifold. We will loosely say that the measures are uniformly compactly supported and uniformly finite. Since is a core for (Strichartz (1983)), the Trotter-Kurtz theorem (see Kurtz (1969)) implies the following corollary.
Corollary 2.2 .
In the situation of proposition 2.1 the geodesic random walk converges to Brownian motion in distribution in (the space of cadlag maps ).
Note that if we denote the random variable corresponding to by , the second requirement of proposition 2.1 is that (in any coordinate system) and . This shows that the mean vector of satisfies and the covariance matrix satisfies . In , this simplifies to and . This is satisfied for instance when is the uniform distribution on the sphere with radius in . Section 2.2 deals with the question which measures satisfy the restrictions above. Some examples will be given at the end of that section as well.
Remark 2.3 .
Although we study the jumping distributions later, something that can already be seen now, is that we do not require any relation between jumping measures at different points of the manifold (apart from the uniform bounds on the support and the total mass). This means that our result does not require the jumping measures to be identically distributed, so it really generalizes Jørgensen (1975).
**Choosing suitable charts
**Let be a fixed smooth function from now on. Since we want the convergence to be uniform on , we cannot just consider this problem pointwise. To deal with this, we will choose specific coordinate charts.
Let denote the original metric of the manifold and let denote the metric that is induced by the Riemannian metric. Recall that these metrics induce the same topology. This means that we do not cause confusion when we speak about open and closed sets, continuous maps and compactness without explicitly mentioning the metric. For each , let be a coordinate chart for around . is open with respect to and hence with respect to . This means that there is some such that . Now define . Since is compact, we can find such that . We have the following easy statement.
Lemma 2.4 .
Let and be functions . If uniformly on each , then uniformly on .
Proof.
Let . For each there is an such that for all . Set and let . Then there is a such that . Now for all , we see , so . This shows that . Hence uniformly on . ∎
Now let be fixed. Call , , , and (this situation is shown in figure 2). Because of the lemma, it suffices to show that uniformly on .
**Technical considerations
**To obtain good estimations later, we will need that is still in our coordinate system and even in the set when for large enough. Since the convergence must be uniform, how large must be can not depend on the point . The following lemma tells us how to choose such .
Lemma 2.5 .
Call (by assumption). Choose such that . Then for all and we see
[TABLE]
Proof.
Let and let . The situation of the proof is visually represented in figure 2. Fix . Without loss of generality assume . Note that the speed of the geodesic equals , so at time , it has traveled a distance from . This means that there is a path of length from to , so . Since , we know . Now the triangle inequality shows that . This implies that . ∎
Fix as in the lemma and take larger than .
**Taylor expansion
**Now fix and . Write for the map that takes to . We can locally write , which is a composition of smooth maps. This means that is just a smooth map , so we can use a Taylor expansion and obtain
[TABLE]
where is a number depending on , and . This gives us
[TABLE]
We will examine these terms separately.
**The first term
**Recall that and that is contained in a coordinate chart . Since , lemma 2.5 guarantees us that stays in the coordinate chart for . Writing , we see for :
[TABLE]
Now setting , this becomes:
[TABLE]
since and the tangent vector to the geodesic at [math] is (so the coordinate with respect is just ). Now the first term of (1) becomes:
[TABLE]
By assumption these integrals are [math]. This shows that the first term of (1) vanishes.
**The second term
**Now we want to show that the remaining term equals . Similarly to above we see for (leaving out the arguments to keep things clear):
[TABLE]
Since is a geodesic, we know that it satisfies the geodesic equations. This shows that for each we have
[TABLE]
Using this yields the following expression for the second derivative:
[TABLE]
so
[TABLE]
Using linearity of the integral, we obtain the following expression for the second term of (1):
[TABLE]
Note that we also changed the order of the derivatives of , this can be done since is smooth. Now we want the term above to equal
[TABLE]
This is true, since we required that for any coordinate chart around and for all : .
**The rest term
**If the last term goes to [math] uniformly on , we have the result. Let still be larger then .
[TABLE]
where (by assumption). We know that . This means that the above is smaller than:
[TABLE]
Because of the in front of the equation, we only need to know that the rest is uniformly bounded to obtain uniform convergence. It thus suffices to show that is bounded as a function of with and . Lemma 2.5 shows that stays in for all such and . We will use this fact multiple times.
We first express in local coordinates for .
[TABLE]
To make notation more compact, we introduce the following notation (and analogously):
[TABLE]
Combining this with Einstein summation, we can write (2) as
[TABLE]
Now, as before, we can deal with second derivatives of geodesics using the geodesic equations:
[TABLE]
We can also calculate the third derivative:
[TABLE]
This shows us that is a combination of products and sums of the following types of expressions: , , , , and . If we can bound all of these on the right domains (independent of and ), we are done.
**Bounding , and
**First of all, note that is a smooth function on . Further, defines smooth vector field on . Since is obtained by applying on to , it is a smooth function on . Continuing in this way, we see that and are also smooth functions on . In particular, they are smooth functions on (since it is a subset of ). is a closed subset of the compact and is hence compact itself. This implies that , and are (for each choice of ) bounded on . Since we evaluate these functions in the points for , and , our discussion above shows that we only evaluate them in points of . This means that we have found bounds for , and .
**Bounding
**We start with a technical lemma.
Lemma 2.6 .
Let and let be a coordinate chart around . Let and write . Then .
Proof.
Fix some . We see in the tangent space at :
[TABLE]
Further,
[TABLE]
Using the relations above and the Cauchy-Schwarz inequality, we obtain:
[TABLE]
∎
Now we can use this to show the following.
Lemma 2.7 .
.
Proof.
The first equation is just a change of notation. Further we see
[TABLE]
This means that is just the coordinate with respect to of the tangent vector to at time so at the point . Using lemma 2.6, we see
[TABLE]
Since is a geodesic, it has constant speed. Its speed at is , so this must be its speed anywhere else along the trajectory. Hence . Inserting this in (3) yields the result. ∎
We can now easily obtain a bound for . For and , we know stays in . is a smooth and hence continous function on , so it is bounded on (since is compact). This means that is bounded by some for and . Now we see .
**Bounding and
**Each is a smooth function on . This means that is a smooth function on . This implies that is just combination of products and sums of smooth functions, so it is smooth itself. Now, as before, is bounded on . Since we only evaluate it in with and , we only evaluate it in , so we have bounded .
Now can be written as
[TABLE]
with notation as above. Since is smooth function , this expression can be bounded in exactly the same way as expressions like above.
2.2 Stepping distribution
**Constraints for a stepping distribution
**The question now is which distributions on satisfy the assumptions of proposition 2.1. From here on we fix and simply write for . Being compactly supported and finite are rather natural constraints, but the other assumptions are harder, especially since they involve local coordinates. In this section we address the question which distributions satisfy the other assumptions, i.e. for every coordinate system around :
[TABLE]
To generalize this a bit, suppose satisfies the following for some for every coordinate system:
[TABLE]
Following the proof in the previous section, one sees directly that in this case the generators converge to the generator of Brownian motion that is speeded up by a factor . We will look into this generalized situation and at the end we will see how to determine .
**Independence of (5) of coordinate systems
**The following lemma shows that if (5) holds for a single coordinate system, it holds for any coordinate system.
Lemma 2.8 .
If (5) holds for some and for some coordinate system around , then it holds for the same for all coordinate systems around .
Proof.
Let be a coordinate system around for which (5) holds with and let be any other coordinate system around . It suffices to show that (5) holds with the same for . Denote the metric matrix with respect to by and the one with respect to by . For any define as the coefficients of with respect to , so such that . Analogously let be such that . Let . If , then
[TABLE]
This shows that for any
[TABLE]
since for any : . Moreover, for any : , so for any :
[TABLE]
Since , we see that . We conclude that (5) holds for with the same . ∎
**Orthogonal transformations and canonical measures
**We now introduce a class of measures.
Definition 2.9 .
Let be an inner product space and let be a linear map . We call an orthogonal transformation if for any : .
We call a measure on canonical if for any orthogonal transformation on and for any coordinate system:
[TABLE]
Remark 2.10 .
In the same way as above, one can show that has the property above with respect to some coordinate system if and only if it has the property with respect to every coordinate system. Moreover, since always satisfies , we see that , so is [math] for any canonical .
In words, is canonical if orthogonal transformations do not change the mean vector and the covariance matrix of a random variable that has distribution . Remark 2.10 shows that in fact the mean vector must be [math]. Note that in particular measures that are invariant under orthogonal transformations are canonical, since then and the other equation follows analogously. However a simple example shows that the converse is not true. Let and let be any non-symmetric distribution on with mean [math]. The only orthogonal transformation (apart from the identity) is . Under this transformation the mean (which is [math]) and the second moment are obviously left invariant, but is not symmetric, so it is not invariant. We will give an example for later.
If is some coordinate system around and is the matrix of the metric in with respect to , we can write a linear transformation as a matrix (which we will also call ) with respect to the base . We see that
[TABLE]
If is orthogonal, this must equal
[TABLE]
so we see that and hence .
Now for a measure on and a coordinate system , define the vector and the matrix by and . Then we have the following.
Lemma 2.11 .
Let be a measure on . Then the following are equivalent.
- (i)
is canonical. 2. (ii)
For every linear transformation and every coordinate system : if , then and .
Proof.
because is just the definition of being canonical written in local coordinates. Indeed, we already saw that orthogonality or translates in local coordinates to , the other expressions follow in a similar way from the following equations:
[TABLE]
∎
**Canonical measures are stepping distributions
**Now we have the following result.
Proposition 2.12 .
Let be a probability measure on . Then is canonical if and only if it satisfies (5) for some .
Proof.
First assume that is canonical and let be normal coordinates centered at . Because of lemma 2.8 it suffices to verify (5) for , so we need to show that and for some .
The fact that is just remark 2.10. Now note that since is symmetric, it can be diagonalized as where is an orthogonal matrix (in the usual sense). This means that and that , so lemma 2.11 tells us that the diagonalization equals . This implies that is a diagonal matrix. Now for let be the -identity matrix with the and column exchanged. It is easy to see that , so we must also have . The latter is with the and diagonal element exchanged. This shows that these elements must be equal. Hence all diagonal elements are equal and for some . Since , we know that . If , then , so , which is not possible. We conclude that .
Conversely let be a coordinate system with corresponding metric matrix and assume that satisfies (5) for some . Let be such that . Then . We also see: (since ), so by lemma 2.11 is canonical. ∎
Now we know that if the stepping distribution is canonical (and finite and compactly supported, uniformly on ), the generators converge to the generator of Brownian motion that is speeded up by some factor (depending on ). The question remains what this is. The following lemma answers this question.
Lemma 2.13 .
Suppose satisfies (5) for some . Then .
Proof.
We calculate the following (with respect to some coordinate system ):
[TABLE]
Hence . ∎
The nice part of this lemma is that the expression for does not involve a coordinate system, only the norm (and hence inner product) of . In particular we see that is equivalent to . We summarize our findings in the following result.
Proposition 2.14 .
A probability measure on satisfies (5) for some if and only if it is canonical and . In particular, it satisfies (4) if and only if it is canonical and .
Remark 2.15 .
Note that all we need of the jumping distributions is that their mean is 0, their covariance matrix is invariant under orthogonal transformations, they are (uniformly) compactly supported and they are (uniformly) finite. We don’t need the measures to be similar in any other way, so we do not at all require the jumps to have identical distributions in the sense of Jørgensen (1975).
**Examples
**1. To satisfy (4) for every coordinate system, by lemma 2.8 it suffices to choose a coordinate system and construct a distribution that satisfies (4) for that coordinate system. Let be any coordinate system around some point in with corresponding metric matrix in that point. Let be any random variable in that has mean vector [math] and covariance matrix (for instance let ). Now let be the distribution of . Then by construction and .
-
In the previous example (4) is immediate. Let us now consider an example that illustrates the use of proposition 2.14. Let be the uniform distribution on (the vectors with norm ). By definition of such a distribution, it is invariant under orthogonal transformations (rotations and reflections), so it is a canonical distribution. Since also , we conclude that the uniform distribution on satisfies (4). Moreover, and . Together this shows that the ’s satisfy the assumption of proposition 2.1.
-
Let us conclude by showing for that the class of canonical distributions is strictly larger than the class of distributions that are invariant under orthogonal transformations, even with the restriction that . It suffices to find a distribution with mean [math] and covariance matrix (since then satisfies (4) and 2.14 then tells us that is canonical and has ) and an orthogonal such that . Let be the distribution on given by . Then, using the natural coordinate system, and . Now let ( times). Then we directly see that the mean vector is [math] and the covariance matrix is . However is an orthogonal transformation and equals the product of times , so obviously .
3 Uniformly approximating grids
We would like to consider interacting particle systems such as the symmetric exclusion process on a manifold. Because the exclusion process does not make sense directly in a continuum, we need a proper discrete grid approximation. More precisely, we need a sequence of grids on the manifold that converges to the manifold in a suitable way. It will become clear that the grids will need to approximate the manifold in a uniform way. We will see in section 4 that a natural requirement on the grids is that we can define edge weights (or, equivalently, random walks) on them, such that the graph Laplacians converge to the Laplace-Beltrami operator in a suitable sense.
To be more precise, we would like to have a sequence in and construct a sequence of grids by setting . On each , we would like to define a random walk which jumps from to with (symmetric) rate with the property that there exists some function and some constant such that for each smooth
[TABLE]
where the convergence is in the sense that for all smooth
[TABLE]
Definition 3.1 .
We call a sequence of grids and corresponding weights uniformly approximating grids if they satisfy (6).
Remark 3.2 (Comparison with standard grids).
To give an idea of how known grids in Euclidean spaces can be incorporated in this framework, let be the one-dimensional torus. Let be the grid that places a grid point in . Now we can define a nearest neighbour random walk by putting . Also set . Then we see for a point for for some that
[TABLE]
The compactness of the torus easily implies that this rest term can be bounded uniformly. This implies that (6) holds.
We will show in section 4 that if we define the Symmetric Exclusion Process on uniformly approximating grids we can prove that its hydrodynamic limit satisfies the heat equation on .
It is not obvious how uniformly approximating grids could be defined. Most natural grids in Euclidean settings involve some notion of equidistance, scaling or translation invariance. All of these concepts are very hard if not intrinsically impossible to define on a manifold. The current section is dedicated to showing that uniformly approximating grids actually exist. To be more precise, we will show that a sequence can be used to define such grids if the empirical measures converge to the uniform distribution in Kantorovich sense. In section 3.4 we will show that such sequences exist: they are obtained with probability 1 when sampling uniformly from the manifold, i.e. from the normalized Riemannian volume measure.
For the calculations of this section, we need a result that forms the core of proving the invariance principle, which we have proved in section 2.
Remark 3.3 .
At first sight the requirement that the empirical measures approximate the uniform measure and that the grid points can be sampled uniformly seems arbitrary, but this is actually quite natural. We want to construct a random walk with symmetric jumping rates (we need this for instance for the Symmetric Exclusion Process later). This implies that the invariant measure of the random walk is the counting measure, so the random walk spend on average the same amount of time in each point of the grid. Hence the amount of time that the random walk spends in some subset of the manifold is proportional to the amount of grid points in that subset. Since we want the random walk to approximate Brownian motion and the volume measure is invariant for Brownian motion, we want the amount of time that the random walk spends in a set to be proportional to the volume of the set. This means that the amount of grid points in a subset of should be proportional to the volume of that subset. This suggests that the empirical measures should in some sense approximate the uniform measure. Moreover, a natural way to let the amount of grid points in a subset be proportional to its volume is by sampling grid points from the uniform distribution on the manifold.
3.1 Model and motivation
**Motivation
**In some areas of statistics the following is known and used (see for instance Singer (2006)). Suppose we have a manifold that is imbedded in for some and we would like to recover the manifold from some observations of it, say an i.i.d. sample of uniform random elements of . To do this we can describe the observations as a graph with as weight on the edge between two points a semi positive kernel with bandwidth applied to the Euclidean distance between those points. Then it can be shown that the graph Laplacian of the graph that is obtained in this way converges in a suitable sense to the Laplace-Beltrami operator on as the number of observations goes to infinity and goes to [math]. This suggests that we could define random walks on such random graphs and that the corresponding generators converge to the generator of Brownian motion. We generalize this idea by taking a more general sequence of graphs, but our main example (in section 3.4) will be this random graph.
A main point of concern is the following: we prefer to view the manifold on its own instead of imbedded in a Euclidean space. This means that we would like to use the distance that is induced by the Riemannian metric instead of the Euclidean distance. The latter is more suitable to purposes in statistics, because in that setting the Riemannian metric on is not known beforehand. Also, a lot is known about the behaviour of the Euclidean distance in this type of situation and not so much about the distance on the manifold. We will have to make things work in itself.
**Model
**Let be a compact and connected Riemannian manifold. We call a function on Lipschitz with Lipschitz constant if
[TABLE]
Let be a sequence in such that converges in the Kantorovich sense to (the uniform distribution on ), i.e.
[TABLE]
where denotes the set of Lipschitz functions on that have Lipschitz constant . Define the grid as . Set
[TABLE]
This rescales the distance over which particles will jump. Naturally, as (since ). Let be Lipschitz and compactly supported (for instance ), we will call such a kernel. Define
[TABLE]
as the jumping rate from to . Here is the Riemannian metric on . Note that the only dependence on is through , hence the notation instead of . These jumping rates define a random walk on . If we regard to points as having an edge between them if , we want the resulting graph to be connected (to make sense of the random walk and later of the particle systems defined on it). If we assume that there is some such that for , one can show that the resulting graph is connected for large enough. The main reason is that the distance between points that are close to each other goes to zero faster than . The details of the proof are in the appendix. Finally we define
[TABLE]
To prove that the grids are uniformly approximating we have to show (6), i.e. as the number of points goes to infinity (and hence the bandwidth goes to [math])
[TABLE]
We will prove the following slightly stronger result:
[TABLE]
Note that since the process defined above is just a continuous-time random walk its generator is given by
[TABLE]
Therefore we call (8) “convergence of the (rescaled) generators to uniformly in the ’s for ” or just “convergence of the generators to uniformly for ”. In fact, we will show that the rate of convergence does not depend on , so we might as well call it “uniformly in the ’s”.
Remark 3.4 .
In fact, we can say more. We denote the semigroups corresponding to the generators by and the semigroup corresponding to by . Then (8) implies that uniformly on compact time intervals
[TABLE]
The proof is a straightforward application of (Kurtz, 1969, Theorem 2.1) and a small argument that the extended limit of the generators above (as described in Kurtz (1969)) equals since they are equal on the smooth functions.
Remark 3.5 .
To see why the rescaling is natural, we can write
[TABLE]
Since is a kernel that is rescaled by inside, we need the to make sure the integral of the kernel stays of order as goes to [math]. Since the amount of points that the process can jump to equals , we also need the factor to make sure the jumping rate is of order as goes to infinity. Also note that the typical distance that a particle jumps with these rates is of order . This means that space is scaled by . Hence it is very natural to expect that time should be rescaled by , which is exactly what we have.
Finally note that in the calculations is the main parameter and an auxiliary parameter depending on . However, conceptually, when the scaling is concerned, the most important parameter is . is just the total amount of positions and simply has to grow fast enough as goes to [math]. To see why this is true, note that any sequence that goes to [math] more slowly than what we use here will also do. Hence should go to [math] slow enough with respect to or, equivalently, should go to infinity fast enough with respect to .
Remark 3.6 .
It is also possible to define as , the heat kernel after time , and rescale by instead of . Then the result of section 3.2 can be proven in the same way (by obtaining some good bounds on Lipschitz constants and suprema of the heat kernel and choosing appropriately, see Cipriani and van Ginkel (2018)) and the result of section 3.3 is a direct consequence of the fact that the Laplace-Beltrami operator generates the heat semigroup. However, for purposes of application/simulation the weights that we have chosen here are much easier to calculate (since only the geodesic distances need to be known, not the heat kernel).
3.2 Replacing empirical measure by uniform measure
We would like to show that in this case there is a independent of such that for all smooth
[TABLE]
uniformly in the ’s.
We can write
[TABLE]
where
[TABLE]
Now (10) equals
[TABLE]
We will show later that the first term converges to (uniformly in the ’s) as . Therefore it suffices for now to show that the second term converges to [math], uniformly in the ’s.
Note that is Lipschitz so it has some Lipschitz constant . This implies that
[TABLE]
by the reverse triangle inequality, so has Lipschitz constant . is smooth, so it is Lipschitz too with Lipschitz constant . Since is just a constant, is also Lipschitz with Lipschitz constant . Since they are both bounded functions, we see for the Lipschitz constant of :
[TABLE]
Note that is bounded since it is Lipschitz and compactly supported, so . This shows that:
[TABLE]
where we denoted the dependence of on explicitly. By (7), , so we obtain
[TABLE]
Note that this bound does not depend on . Since , it follows that the second term of (11) goes to [math] uniformly in the ’s.
**What remains
**What we have seen above basically means that we can replace the empirical distribution by the uniform distribution . For convergence of the generators we still have to show that
[TABLE]
uniformly in the ’s. Note that we can replace by , since the expression only depends on via and as . Since the ’s are all in we can replace by and require that the convergence is uniform in .
Because of these considerations it remains to show that there exists such that uniformly in :
[TABLE]
Note that for every this expression can be interpreted as the generator of a jump process on the manifold . The process jumps from to a (measurable) set with rate .
Remark 3.7 .
Note that this is easy to show in . Indeed, using the transformation and Taylor, we see
[TABLE]
where is the Hessian of in . Now changing coordinates to integrate over each sphere of radius with respect to the appropriate surface measure and then with respect to , we obtain
[TABLE]
Now because of symmetry the integrals of and of over spheres vanish for each . Moreover the integrals of do not depend on , but only on . Therefore the first term vanishes and we are left with
[TABLE]
This shows convergence (at least pointwise, for uniform convergence we have to be a little more careful about the ).
3.3 Convergence result
**Integral over tangent space
**Let be such that (such exists since is compactly supported). We denote for . Then we can write
[TABLE]
Denote for (not to be confused with , which is a ball in with respect to the original metric ). For small enough we know that is a diffeomorphism. We want to use this to write the integral above as an integral over :
[TABLE]
This means we integrate with respect to the measure , where denotes multiplication with .
**Determining the measure
**Since is a star-shaped open neighbourhood of [math], we see that for small enough is a normal neighbourhood of , so there exists a normal coordinate system that is centered at . We interpret, for , as . Consequently, when we write for some subset of , we mean . Since the basis is orthogonal in , it is easy to see that preserves the inner product and is an isomorphism of inner product spaces. Indeed,
[TABLE]
In particular (where denotes a ball in with respect to the Euclidean metric). We can use this in the following lemma, which tells us more about .
Lemma 3.8 .
There exist and a function such that for tending to [math] and for all : on .
Proof.
Let be small enough such that the considerations above the lemma hold and let . For clarity of the proof, we first separately prove the following statement.
Claim: on .
Proof. The geodesics through are straight lines with respect to , so they are of the form with . For , the geodesic starting at with tangent vector at should satisfy and for all , so we see . For , we see , so . This also shows that for (since is invertible), which gives an identification
[TABLE]
which is the restriction of to . This situation is sketched in figure 3. ∎
Now we will first use the definition of integration to see what the measure is in coordinates (so it becomes a measure on a subset of ). Then we will use the claim above: we will pull the measure on back to using .
On the volume measure is given by . According to (Wang, 2016, Cor 2.3), can be expanded (in normal coordinates) as where is such that . Now the measure can be written in local coordinates on as , so the uniform measure is . This yields the measure on . We have on :
[TABLE]
According to the claim above, is a restriction of , so we can replace it by . Since this map is linear, it can be interchanged with , which yields (inserting what we found before and since ):
[TABLE]
In the last step we interpret as a measure on and this last step is then just a transformation of measures on . This yields the expression that we want. ∎
Remark 3.9 .
We used (Wang, 2016, Cor 2.3) in the proof above. In these notes the expansion of is calculated around a point in normal coordinates centered around :
[TABLE]
As can be seen, there are no linear terms in the expansion. The coefficients for the quadratic terms are coefficients of the Ricci curvature of in . This implies that the way that the uniform distribution on a ball around in is pulled back to the tangent space via the exponential map depends on the curvature of in . In particular, if there is no curvature, is locally isomorphic to a neighbourhood in so the same thing happens as in . This means that we get a uniform distribution on a ball around [math] in the tangent space.
Remark 3.10 .
We will need in proposition 3.12 that the statement of lemma 3.8 holds uniformly in all points of the manifold. This means that the difference between the uniform measure on a ball in the tangent space and the pulled back uniform measure on a geodesic ball in the manifold decays quadratically with uniformly in the manifold. Note that this uniform convergence is intuitively clear, since the difference between the two measures is caused by curvature and curvature is bounded in a compact manifold. As in the proof of lemma 3.8, one needs to write
[TABLE]
for some function that is independent of . Here is the metric matrix at expressed in (fixed) normal coordinates centered at . Since and are uniformly continuous in the right domains, it suffices to show that
[TABLE]
where the is independent of . In other words,
[TABLE]
where does not depend on . For all (and for any system of normal coordinates centered at ) we have the following Taylor expansion (note that for fixed is a map from a (subset of) to ):
[TABLE]
From this we get (17) directly for fixed , i.e. we have
[TABLE]
In order to obtain uniformity of in , we note that the functions of and appearing in the r.h.s. of (18) can be made smooth both in and . Smoothness in is obvious (within the injectivity radius) and smoothness in follows from a special choice of normal coordinates in such a way that they vary smoothly with . A choice of normal coordinates is equivalent to a choice of an orthonormal basis, so one can construct smoothly varying normal coordinates by taking a smooth section of the orthonormal frame bundle (this can only be done locally, but it is enough to have the uniformity result locally, since then by compactness one has it globally). By compactness, the injectivity radius is bounded from below by some . Now for all and , (18) holds and (locally) the quantities on the r.h.s. vary smoothly and therefore (again by compactness) one can show that is finite.
**A canonical part plus a rest term
**Now define
[TABLE]
on and [math] everywhere else. Then the lemma implies that (14) equals
[TABLE]
Recall that is just notation for following the geodesic from in the direction of for time . Now we define (so the measure which has density with respect to ) and analogously . Then we can write the integral above as
[TABLE]
In this way we transformed the integral to one that we worked with in section 2.1 since we wrote it as the generator of a geodesic random walk (see on page 2.1). To use the theory that we obtained in that section, we need the following lemma. It tells us that can be used as a stepping distribution for a geodesic random walk and it gives us the constant speed of the Brownian motion to which it converges (see section 2.2).
Lemma 3.11 .
is canonical. Moreover .
Proof.
First of all recall that is continuous and compactly supported, so the integral over above makes sense and is finite. Define on and [math] everywhere else. Then we can write . Since preserves the norm, we see that . This means that , where . Since preserves the inner product, the measure behaves the same with respect to orthogonal transformations in as with respect to orthogonal transformations in . Since is clearly preserved under such transformations, so is . This shows that is canonical.
Now we calculate the corresponding constant.
[TABLE]
The first step was just writing the integral with respect to the coordinates for which we defined . The second step holds because . The third uses the fact that preserves the norm. The penultimate step is a change of coordinates in using the fact that is constant on spheres around the origin. Here is the area of . In the last step we used that . ∎
**Conclusion
**We use everything above to obtain the statement that we aim for.
Proposition 3.12 .
Set
[TABLE]
Then as we have uniformly in :
[TABLE]
Proof.
Let . We can write
[TABLE]
From the results in section 2.1 and 2.2 (prop 2.14) and lemma 3.11, we see for the first term uniformly in
[TABLE]
Now it suffices to show that the second term goes to zero at a rate independent of . Let such that and for (where both and are from lemma 3.8). We need remark 3.10 to make sure that and do not depend on . Now note that for :
[TABLE]
Now we see:
[TABLE]
where we used that the integral is finite since is bounded and has support in . Combining everything above gives what we wanted. ∎
3.4 Example grid
So far, we have seen that a sequence of grids is suitable for the hydrodynamic limit problem if the empirical distributions converge to the uniform distribution in the Kantorovich topology. We conclude by giving examples of such grids. To be more precise, we show that if one constructs a grid by adding uniformly sampled points from the manifold, this grid is suitable with probability 1.
Remark 3.13 (Comparison with standard grids).
Recall the grids on the one-dimensional torus from remark 3.2. We can show that the empirical measures corresponding to these grids along the subsequence converge to the uniform measure on with respect to the Kantorovich distance. To this end let be fixed, call the corresponding empirical measure and call the uniform measure . Recall that the Kantorovich distance between these measures is alternatively given by
[TABLE]
where is the set of all couplings of and . Now let be a uniform random variable on and define
[TABLE]
Denote the joint distribution of by . Then it is easy to see that . This implies that
[TABLE]
This implies convergence with respect to the Kantorovich metric along the subsequence . Note, however, that the corresponding edge weights as described in this section are not the same as those in remark 3.2.
**Convergence of a random grid
**Now we move back to the general case of a compact and connected -dimensional Riemannian manifold . Let be a sequence of iid uniformly random points of . Define . We follow (van Handel, 2016, Example 5.15) to show that as . First we will show that the expectation goes to [math], then we will derive that it goes to [math] almost surely.
For now, let be fixed. Let be the set of Lipschitz function on with Lipschitz constant . Then we define for the random variable . Note that both and are probability distributions, so is Lipschitz in for each :
[TABLE]
Now note that since has Lipschitz constant :
[TABLE]
is compact, so . Since adding constants to does not change , it suffices to consider . It follows that for each by writing
[TABLE]
we see that it is a sum of iid random variables taking values in . By the Azuma-Hoeffding inequality, this implies that is -subgaussian for each . Now (van Handel, 2016, Lemma 5.7) shows that
[TABLE]
where is the minimal number of points in some space containing such that the balls of radius with respect to the uniform distance around those points cover .
**Estimating the covering number
**We now need to estimate this covering number. To do this we need an upper bound of the covering number of . Since is compact there exist such that for all : (see for instance (Loubes and Pelletier, 2008, Lemma 4.2)). Using this we can prove the following.
Lemma 3.14 .
There is a such that for all :
Proof.
Fix and call . By definition of this number, we can find points such that . Now define and for : . Now for , define by
[TABLE]
Since each is contained in exactly one (by construction), this map is well-defined. Note that if , then on . In particular clearly . Now denote .
Now fix and . Let be such that . Then we see:
[TABLE]
This shows that , which implies that is an -net for . Hence .
All we have to do now is estimate .
First of all let . Note that if , we see
[TABLE]
Since for some , we conclude , so
Now define a graph with vertices by putting an edge between and whenever . Any is uniquely specified by its values on the nodes of . Note further that whenever we know for some point of the graph, there are only 3 possible values left for each of its neighbours (since neighbours are at distance at most ). Now is dominated by the amount of ways in which we can assign values of the type to nodes of while keeping this restriction into account. Define, for , , where denotes the minimum amount of edges that need to be followed to walk from to in . Now we can start counting.
For , there are at most possible values (recall that any has ). Each node in is a distance at most from , so each node can take at most values. This brings the possible amount of value assignments to (less than) . Now each node in is at distance at most of a node in , so each of these can take at most 3 different values. This brings the number of options so far to at most . Continuing in this way, we obtain that the number of ways to assign values is at most
[TABLE]
Recall that is the total amount of balls as we defined at the beginning of the proof, which we chose equal to . Now we know that for
[TABLE]
This implies that there exists such that for all ∎
Now we see that for any
[TABLE]
Elementary methods show that this value takes a minimum at where is some constant (take large enough such that ). This shows that the optimal bound that we get is
[TABLE]
where is the product of some constants that don’t depend on . This shows that
[TABLE]
as .
**Convergence a.s.
**It remains to show that goes to zero almost surely. For a function define
[TABLE]
Further, define the function by
[TABLE]
Note that .
Lemma 3.15 .
Set (as before) . Then for each : .
Proof.
Let and fix . Denote for and
[TABLE]
Now let . Then for any :
[TABLE]
This shows that and are always at most apart from each other, which implies that
[TABLE]
Now
[TABLE]
Since were arbitrary, we conclude that . ∎
Now we are in position to prove the main result.
Proposition 3.16 .
* almost surely as .*
Proof.
Since are independent, (van Handel, 2016, Theorem 3.11) gives us that for any
[TABLE]
where the last inequality follows from lemma 3.15. For reasons of symmetry we obtain
[TABLE]
By a standard application of the Borel-Cantelli lemma, this implies that a.s. Since we have already seen that , we conclude that a.s. as
[TABLE]
∎
We conclude that sampling uniformly from the manifold yields a suitable grid with probability .
4 Hydrodynamic limit of the SEP
In section 3 we showed the existence of uniformly approximating grids. In this section we will apply such grids. We will use it to define an interacting particle system on the manifold. Then we will show that this interacting particle system has a hydrodynamic limit and that this limit satisfies the heat equation (the precise formulation is given in theorem 4.2). We follow a standard method that is used in (Seppäläinen, 2008, Chapter 8) for the Euclidean case.
Now let be a sequence of uniformly approximating grids with corresponding weights. Recall that this means the following. There is a sequence in such that . On each , there is a random walk which jumps from to with (symmetric) rate . We assume that there exists some function and some constant such that for each smooth
[TABLE]
where the convergence is in the sense that for all smooth
[TABLE]
By dividing by if necessary, we can assume that .
Remark 4.1 .
Note that for the result of this section it is not necessary to construct grids from a sequence. Any sequence of finite grids such that (19) holds would do. However, since the grid that we constructed in section 3 is of this form and this section partially serves as an example of the application of that grid, we formulate our results in this section in the same way.
4.1 Symmetric Exclusion Process
The Symmetric Exclusion Process (SEP) is an interacting particle system that was introduced in Spitzer (1970) and studied in detail in (Liggett, 2012, Chapter 8). The idea is that there is some (possibly countably infinite) amount of particles on a (possibly countably infinite) graph . The particles are considered identical. Each particle jumps after independent exponential times with parameter from to with probability , provided that the place that it wants to jump to is not already occupied. Otherwise, the jump is suppressed. We assume that . Let denote the configuration of the particles at time , i.e. if there is a particle at place at time and [math] else. We will sometimes write . For any configuration and points define by
[TABLE]
An equivalent description of this process is the following. All edges have independent exponential clocks with rate . Whenever a clock rings, the particles that are at either side of the corresponding edge jump along the edge. This means that if there are no particles, nothing happens. If there is one particle, it jumps. If there are two particle, they switch places. Since we are not interested in individual particles, the configuration stays the same in the latter case. Note that in this way there can never be more than two particles at the same place. Using the notation introduced above, we see that the generator of this process is defined on the core of local functions as
[TABLE]
The factor is there since we count every edge twice.
**The process
**We now define the SEP on through the generator
[TABLE]
Here . It follows from our considerations above that this process describes particles that perform independent random walks according to with the restriction that jumps to occupied sites are suppressed.
Let be some sequence of (possibly degenerate) random variables taking values in . Set as the initial configuration .
4.2 Hydrodynamic limit
We will use this subsection to give the basic definitions that describe the idea of a hydrodynamic limit. At a microscopic scale, the particles are just random walkers with some interaction, but at the macroscopic scale (where limits are taken in space and time), the behaviour is deterministic: it is described by a partial differential equation (in our case the heat equation).
**Path space
**Now write for the space of Radon measures on with the vague topology and let denote the space of all paths such that is right continuous and has left limits. On this space we can define the Skohorod metric (see for instance (Seppäläinen, 2008, Appendix A.2.2)). Since is a Polish space, it can be shown that with the Skohorod metric is a Polish space too.
**Initial conditions and trajectories of particle configurations
**Define
[TABLE]
where is the Dirac measure which places mass 1 at . It puts a point mass at each particle and rescales it by the amount of possible positions, which represents the particle configuration at time . In particular is a sub-probability measure and is in .
Instead of dealing with this problem pointwise for each , we will look at trajectories. As the particles move according to the SEP, defined by is a random trajectory and hence a random element of . It represents the positions of the particles over time. The initial configuration and the dynamics of the SEP determine a distribution on . In this way we obtain a sequence of measures on .
**Assumption on the initial configuration
**We assume that there exists a measurable function such that and converges vaguely to in probability, i.e. for any continuous as :
[TABLE]
If this is the case, we say that is the density profile corresponding to the configurations . Note that using measures here to represent the particles provides a bridge between separate particles (discrete measures) and density profiles (measures that are absolutely continuous with respect to ). We would like to show that if this initial condition is given, then at any time the configurations have a corresponding density profile . Moreover, we want to show that solves the heat equation with initial condition .
**Example of initial distribution
**Suppose for now that the ’s are such that for any continuous : 444Since Kantorovich convergence is stronger than convergence in distribution, this is in particular true for the grids that we consider in part 2.. Define the random variables to be independent Bernoulli random variables with for some continuous function with . Then we see as :
[TABLE]
since and are continuous. Further,
[TABLE]
Together this implies that (20) holds here for any continuous .
**Main result
**After all these definitions, we can state the main result of this section.
Theorem 4.2 .
Let be a complete, -dimensional, connected Riemannian manifold and let be a sequence of uniformly approximating grids with corresponding weights. Let be particle configurations that behave according to the SEP on and let be its measure valued representation. Suppose that has density profile for some measurable function . Then the trajectory converges in probability to the trajectory in the Skohorod topology, where satisfies the heat equation on with initial condition .
4.3 Convergence result
**Dynkin martingale
**The proof of the hydrodynamic result follows the line of (Seppäläinen, 2008, Chapter 8). Its core calculations are based on the following Dynkin martingale result. It is a standard result and it is also proved in Seppäläinen (2008). We will formulate it in terms of our situation on a compact Riemannian manifold.
Proposition 4.3 .
Let be a Feller process on a compact Riemannian manifold with generator and semigroup . For any function such that both and are in , define
[TABLE]
Then is a martingale with respect to the filtration . Moreover, its quadratic variation equals , where .
**Application of the proposition
**First of all fix a smooth function on . Define for : , where . Note that since is the generator of a random walk on a the finite space of configurations, its domain consists of all functions on those configurations, so in particular and are in it. Applying theorem 4.3 in this situation shows that defined by
[TABLE]
is a martingale with quadratic variation , where . Some basic manipulations show that
[TABLE]
Inserting definitions and leaving out some indexes (to keep everything clear) shows that the right hand side of (21) equals
[TABLE]
**Using convergence of the generators
**By (19), we can write for any :
[TABLE]
where
[TABLE]
This shows that
[TABLE]
Plugging this into (23) and (21), we obtain:
[TABLE]
so for any :
[TABLE]
We want to show that this expression converges to [math] in probability. We will deal with the terms on the right hand side separately.
**The error term
**First of all
[TABLE]
so
[TABLE]
**Convergence of the martingale to [math]
**Now for the other term. Since the trajectory is cadlag, so is . Hence by Doob’s inequality we see:
[TABLE]
To show that goes to [math], it suffices to show that goes to [math] (since then and hence ). This is what the following lemma tells us.
Lemma 4.4 .
For any :
[TABLE]
Proof.
Recall that . By writing out, one simply obtains
[TABLE]
Using (22), we see
[TABLE]
since for all . This shows that
[TABLE]
This implies that also
[TABLE]
We can estimate this term by using (25). Some basic manipulations show that
[TABLE]
where the ’s are as before. This implies that
[TABLE]
where in the last step we used (25). So we obtain
[TABLE]
Together with (29) this gives the result. ∎
We conclude from the lemma that the right hand side of (28) goes to zero as goes to infinity and goes to zero, so
[TABLE]
**Convergence of (27) to [math] in probability
**Combining everything above and using (27), we conclude that
[TABLE]
In particular, for any , define
[TABLE]
It can be shown, as in (Seppäläinen, 2008, Chapter 8), that is closed for any . Recall from page 4.2 that we write the distribution of as . Then the convergence result above implies that for any :
[TABLE]
**Tightness of
**We will need that the sequence of distributions is tight. This can be shown in exactly the same way as (Kipnis and Landim, 1999, p.55-56). In fact all the most crucial calculations have already been performed above.
Lemma 4.5 .
The sequence of distributions is tight.
Proof.
It needs to be shown that the two conditions of (Kipnis and Landim, 1999, Chapter 4 Thm 1.3) are satisfied. Note that for any continuous we can map a path to the path in given by . This induces a sequence of distributions on . By (Kipnis and Landim, 1999, Chapter 4 Prop 1.7) and the fact that the smooth functions are uniformly dense in the set of continuous functions on a manifold, it suffices to prove the conditions of (Kipnis and Landim, 1999, Chapter 4 Thm 1.3) for { for all smooth . Fix such . Since each path stays in the set of sub-probability measures, the first condition is easily satisfied. For the second condition, it suffices to prove Aldous’ tightness criterion, i.e. that
[TABLE]
where denotes the set of all stopping times bounded by . We know from equation (26) that there exists a martingale (depending on ) such that
[TABLE]
It therefore suffices to check the tightness criterion for the RHS of this equation and for the integral on the LHS (since the only other term is constant). Now we can make the following estimations.
(I). First of all, since is a sub-probability measure and is bounded:
[TABLE]
This implies that
[TABLE]
This implies that the limit in (30) is smaller than
[TABLE]
so (I) satisfies the tightness criterion.
(II). Further, the calculations above show that
[TABLE]
Here is some positive number which exists, because of (25). This part satisfies (30) in the same way as the previous part.
(III). Now for the last term, we first estimate (as is done in (Kipnis and Landim, 1999, p.56)). Naturally, the expectation is taken with respect to . Note that because of the martingale property:
[TABLE]
We see from the calculations in the proof of lemma 4.4 that
[TABLE]
Since the term after converges to [math], we see that it is bounded by some constant . By Chebyshev’s inequality we obtain:
[TABLE]
Since
[TABLE]
this part satisfies (30) too. ∎
**Limit distribution
**We have just shown that is a tight sequence of measures on . This implies that every one of its subsequences is also tight and therefore has a weakly convergent subsequence. If these all have the same limit, then it follows from a basic result in metric spaces that the sequence itself converges weakly to that limit. It therefore suffices for weak convergence of to show that every weakly convergent subsequence of has the same limit. Let be any weakly convergent subsequence and denote its limit by . Since is closed, we know for any that
[TABLE]
so . Since this holds for any , we see
[TABLE]
This means that
[TABLE]
By doing this for a countable set of functions that is dense in with respect to and arguing that this implies the same for any smooth function we see:
[TABLE]
Since this holds for any , we see that a.s. for every and for all smooth :
[TABLE]
Note that (31) is a weak, measure-valued formulation of the heat equation. We will argue and use shortly that this equation uniquely determines the trajectory given the initial conditions.
**Continuity
**To obtain uniqueness, we first need to know that the trajectory is continuous. For the case this is shown in (Seppäläinen, 2008, Lemma 8.6). The result can be shown in exactly the same way in our case, so we will not provide all the details. The topology on the space of measures is generated by the following metric:
[TABLE]
for some sequence . It suffices to control
[TABLE]
Doing that can be reduced to showing that for any and :
[TABLE]
This can be done by using the Dynkin martingale representation (26) and bounding all the differences as in the proof of tightness. The only term that needs some attention is , but it can be controlled using Doob’s maximal inequality:
[TABLE]
which goes to zero according to lemma 4.4.
**Uniqueness
**To obtain uniqueness of limits of subsequences of , we need to know that there is a unique continuous solution to (31) that has initial condition . We know that is a continuous solution to (31) with the right initial condition if satisfies the heat equation with initial condition . Therefore it suffices to show that this solution is unique. This result is proven with a boundedness condition in (Seppäläinen, 2008, Thm A.28). The main idea of the proof is that the measure valued path is smoothed by taking its convolution with some smooth kernel with bandwidth . Then it is shown that this trajectory of functions satisfies the heat equation with initial condition in the strong sense (by interchanging integral and derivatives and using that these identities are known for sufficiently many ), so it must equal . Then by letting go to zero, it is shown that the original trajectory must equal , where is the Lebesgue measure.
To obtain the analogous result in our setting, we cannot use convolution, since this is not well-defined on a manifold. However, we can smooth the measures by integrating the heat kernel at time with respect to the measures. Using this smoothing, we can follow exactly the same approach, i.e. showing that the smoothed trajectory satisfies the heat equation in a strong sense and then letting go to [math]. The boundedness condition is a bound on volumes, which is needed for some estimations in Seppäläinen (2008) and for the uniqueness of the strong solution to the heat equation. Since we work in a compact setting and with probability measures, such a bound is not necessary. The uniqueness of the strong solution to the heat equation is a standard result in our case (so for a compact and connected Riemannian manifold). See for instance (Grigoryan, 2009, Thm 8.18). Results on the heat kernel on a manifold can also be found in Grigoryan (2009).
**Conclusion
**Now let be the solution to the heat equation on with initial condition and call . Recall that (31) holds a.s. By the uniqueness result above, this implies that is a Dirac distribution with as its support. Since this does not depend on , it must be the same for any convergent subsequence, so with arguments given above, we conclude that weakly. Let denote the random trajectory . Since is degenerate, the weak convergence implies convergence in probability, so in probability. This is what we wanted to show.
Acknowledgement
The authors thank Rik Versendaal for helpful discussions. The support of the grant 613.009.112 of the Netherlands Organisation for Scientific Research (NWO) is gratefully acknowledged.
Appendix
Lemma 0 .
Let be a sequence for which the empirical measures converge to the volume measure in the Kantorovich sense. Define , and as in section 3.1. Additionally suppose that there exists some such that for all . Say that there is an edge between and whenever . Then the corresponding graphs are eventually connected (in other words: there is some such that for all with edges as just defined is connected).
Proof.
Define
[TABLE]
Since is not connected (for ), is connected and contains all edges of for it is clear that is a finite number strictly larger than [math]. Further note that is connected (so the infimum is actually a minimum).
Now note that there must be two points such that have an edge between them for and are not connected for (we call and connected if there is a path from to ). Indeed if any pair that has an edge between them for is still connected by some path for some , we see that for the graph is connected, which contradicts the definition of (note that the supremum ranges over a finite amount of numbers, since is finite). Fix such .
Now let be a point on such that Then does not contain any point of (since by the triangle inequality such point would have distance to both and so and would be connected to each other via this point in , which contradicts the choice of and ).
Now we define the following function
[TABLE]
It is easy to see that , so is Lipschitz with . This implies that
[TABLE]
Since is only non-zero on and this set does not contain points of , we see that
[TABLE]
Further, since is non-positive and on , we see that
[TABLE]
so we conclude that . Since goes to zero, it is easy to deduce from this inequality that . Hence there are constants (not depending on ), such that for large enough
[TABLE]
Now we see there is a such that for large enough
[TABLE]
This implies that there is some such that for all . By our choice of , all points at distance or less are joined by an edge, so this inequality combined with the definition of shows that for all with edges as defined in the lemma statement is connected. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Blum (1984) G. Blum. A note on the central limit theorem for geodesic random walks. Bull. Austral. Math. Soc , 30(2):169–173, 1984.
- 2Cipriani and van Ginkel (2018) A. Cipriani and B. van Ginkel. The discrete Gaussian free field on a compact manifold. Ar Xiv e-prints , Sept. 2018.
- 3De Masi and Presutti (2006) A. De Masi and E. Presutti. Mathematical methods for hydrodynamic limits . Springer, 2006.
- 4Gonçalves (2017) P. Gonçalves. Hydrodynamics for symmetric exclusion in contact with reservoirs. To appear in Springer Lecture Notes in Mathematics , 2017.
- 5Grigoryan (2009) A. Grigoryan. Heat kernel and analysis on manifolds , volume 47. American Mathematical Soc., 2009.
- 6Jørgensen (1975) E. Jørgensen. The central limit problem for geodesic random walks. Probability Theory and Related Fields , 32(1):1–64, 1975.
- 7Kipnis and Landim (1999) C. Kipnis and C. Landim. Scaling limits of interacting particle systems , volume 320. Springer, 1999.
- 8Kurtz (1969) T. G. Kurtz. Extensions of trotter’s operator semigroup approximation theorems. Journal of Functional Analysis , 3(3):354–375, 1969.
