Quantitative evaluation of an active Chemotaxis model in Discrete time
Abhishek Pal Majumder

TL;DR
This paper develops a discrete-time, nonlinear model for active chemotaxis involving interacting particles and medium concentration, providing stability analysis and convergence results for large particle systems.
Contribution
It introduces a new discrete-time formulation of an active chemotaxis model with non-linear interactions, extending previous work by removing restrictive domain assumptions.
Findings
Established conditions for unique fixed points in the dynamical system.
Proved uniform convergence rates of particle empirical measures to the limit.
Extended stability analysis to unbounded domain settings.
Abstract
A system of particles in a chemical medium in is studied in a discrete time setting. Underlying interacting particle system in continuous time can be expressed as \begin{eqnarray} dX_{i}(t) &=&[-(I-A)X_{i}(t) + \bigtriangledown h(t,X_{i}(t))]dt + dW_{i}(t), \,\, X_{i}(0)=x_{i}\in \mathbb{R}^{d}\,\,\forall i=1,\ldots,N\nonumber\\ \frac{\partial}{\partial t} h(t,x)&=&-\alpha h(t,x) + D\bigtriangleup h(t,x) +\frac{\beta}{n} \sum_{i=1}^{N} g(X_{i}(t),x),\quad h(0,\cdot) = h(\cdot).\label{main} \end{eqnarray} where is the location of the th particle at time and is the function measuring the concentration of the medium at location with . In this article we describe a general discrete time non-linear formulation of the aforementioned model and a strongly coupled particle system approximating it. Similar models have been studiedβ¦
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.
Taxonomy
TopicsMicro and Nano Robotics Β· 3D Printing in Biomedical Research Β· Mathematical Biology Tumor Growth
Quantitative evaluation of an active Chemotaxis model in Discrete time.
Abhishek Pal Majumder University of Copenhagen
Abstract
A system of particles in a chemical medium in is studied in a discrete time setting. Underlying interacting particle system in continuous time can be expressed as
[TABLE]
where is the location of the th particle at time and is the function measuring the concentration of the medium at location with . In this article we describe a general discrete time non-linear formulation of the model (0.1) and a strongly coupled particle system approximating it. Similar models have been studied before (Budhiraja et al.(2010)) under a restrictive compactness assumption on the domain of particles. In current work the particles take values in and consequently the stability analysis is particularly challenging. We provide sufficient conditions for the existence of a unique fixed point for the dynamical system governing the large asymptotics of the particle empirical measure. We also provide uniform in time convergence rates for the particle empirical measure to the corresponding limit measure under suitable conditions on the model.
AMS 2010 subject classifications: Primary 60J05, 60K35, 60F10.
Keywords: Weakly interacting particle system, propagation of chaos, nonlinear Markov chains, Wasserstein distance, McKean-Vlasov equations, exponential concentration estimates, transportation inequalities, metric entropy, stochastic difference equations, long time behavior, uniform concentration estimates.
1 Introduction
There have been a surge of significant research activities aimed towards understanding the dynamics of collective behavior of a multi-agent system in the time limit. Motivations for such problems come from various examples of self organizing systems such as consensus formation in opinion dynamics [11], active chemotaxis [3], self organized networks [13], large communication systems [12], multi target tracking [6], swarm robotics [14] (additional applications can be found in [15]) etc. One of the basic challenges is to understand how a large group of autonomous agents with decentralized local interactions that gives rise to a coherent behavior.
In this paper we consider a reduced model motivated by both [3],[5] for a system of interacting agents in a stochastic diffusing environment, variations of which have been proposed (see [3],[14] and references therein). Consider for each
[TABLE]
Here are independent Brownian motions that drive the state process of the interacting particles. The interaction between the particles arises directly from the evolution equation (1.1) and indirectly through the underlying potential field which changes continuously according to a diffusion equation and through the aggregated input of the particles. One example of such an interaction is in Chemotaxis where cells preferentially move towards a higher chemical concentration and themselves release chemicals into the medium, in response to the local information on the environment, thus modifying the potential field dynamically over time. In this context, represents the concentration of a chemical at time and location . Diffusion of the chemical in the medium is captured by the Laplacian in (1.1) and the constant models the rate of decay or dissipation of the chemical. The first equation in (1.1) describes the motion of a particle in terms of diffusion process with a drift consisting of three terms. The first term models a restoring force towards the origin where origin represents the natural rest state of the particles. The second term is the gradient of the chemical concentration and captures the fact that particles tend to move particularly towards regions of higher chemical concentration. Finally the third term captures the interaction(e.g attraction or repulsion) between the particles. Contribution of the agents to the chemical concentration field is given through the last term in the second equation. The function captures the agent response rules and can be used to model a wide range of phenomenon [15].
In [3] the authors considered a discrete time model which captures some of the key features of the dynamics in (1.1) and studied several long time properties of the system. One aspect that greatly simplified the analysis of [3] is that the state space of the particles is taken to be a compact set in . However this requirement is restrictive and may be unnatural for the time scales at which the particle evolution is being modeled. In [14] authors had considered a number of variations of (1.1). The theoretical properties obtained in this work on the long time behavior of the particle system can be also applied for such systems with some minor modifications.
We now give a general description of the - particle system that gives a discrete time approximation of the mechanism outlined above. The space of real valued bounded measurable functions on is denoted as . Borel field on a metric space will be denoted as . denotes the space of all bounded and continuous functions . For a measurable space S, denotes the space of all probability measures on . For let be the space of such that
[TABLE]
Consider a system of interacting particles that evolve in governed by a random dynamic chemical field according to the following discrete time stochastic evolution equation given on some probability space . Suppose that the chemical field at time instant is given by a nonnegative (i.e continuously differentiable) real function on satisfying . Then, given that particle state at time instant is and the empirical measure of the particle states at time is the particle state at time is given as
[TABLE]
where is a matrix, is a small parameter, is a valued random variable with probability law and is a measurable function. Here we consider a somewhat more general form of dependence of the particle evolution on the concentration profile than the additive form that appears in (1.1). Additional assumptions on will be introduced shortly. Nonlinearity (modeled by and ) of the system can be very general and as described below. Denote by (a valued random variable) the state of the -th particle and by the chemical concentration field at time instant . Let be the empirical measure of the particle values at time instant . The stochastic evaluation equation for the -particle system is given as
[TABLE]
In (1.3) is an i.i.d array of valued random variables with common probability law . Here are assumed to be exchangeable with common distribution where . Note that in the notation we have suppressed the dependence of the sequence on .
We now describe the evolution of the chemical field approximating the second equation in (1.1) and its interaction with the particle system. A transition probability kernel on is a map such that and for each . Given the concentration profile at time is a probability density function on and the empirical measure of the state of -particles at time instant is , the concentration probability density at time is given by the relation
[TABLE]
where denotes the Lebesgue measure on and is the Radon-Nikodym derivative of the transition probability kernel with respect to the Lebesgue measure on The kernel is given as follows. We considered the same model as introduced in [3]. Let and betwo transition probability kernels on For and define the transition probability kernel on as
[TABLE]
Here represents the background diffusion of the chemical concentration while captures the contribution to the field by a particle with location . So the kernel gives a spike at origin which can be approximated by a smooth density function as with very small . The parameter gives a convenient way for combining the contribution from the background diffusion and the individual particles. For each both and are assumed to be absolutely continuous with respect to Lebesgue measure and throughout this article we will denote the corresponding Radon-Nikodym derivatives with the same notations and respectively. Additional properties of and will be specified shortly. The evolution equation for the chemical field is then given as
[TABLE]
In contrast to the model studied in [5], the situation here is somewhat more involved. Note that is not a Markov process and in order to get a Markovian state descriptor one needs to consider which is a discrete time Markov chain with values in .
We will show that as converges to a deterministic nonlinear dynamical system with methods followed in [3]. We established further sharp quantitative bounds (with techniques used in [10] and [5]) for weakly interacting particle system jointly with the stochastic field potential to the nonlinear system of interest. For both polynomial and exponential concentration bound it requires further constraints on the tail of the transition kernels used in modeling the diffusive environment. One major motivation of cthe current article is giving a sharp uniform in time quantitative estimate for the particle system to the non-linear system of interest so that any functional of the form \big{<}\phi_{1},\mu_{n}\big{>}+\big{<}\phi_{2},\eta_{n}\big{>} can be approximated by \frac{1}{N}\sum_{i=1}^{N}\phi_{1}(X^{i}_{n})+\big{<}\phi_{2},\eta_{n}^{N}\big{>} with desired precision. Previous work on concentration bounds for similar particle system in discrete time includes [8] but that involves a Dobrushin type stability condition which is not very effective if the particles are assumed to come from a non-compact domain. A very recent work [4] addresses several quantitative bounds for Chemotaxis model motivated by Patlak-keller-segel type non-linear equations.
The following notations will be used in this article. will denote the dimensional Euclidean space with the usual Euclidean norm . The set of natural numbers (resp. whole numbers) is denoted by (resp. ). Cardinality of a finite set is denoted by . For , is the Dirac delta measure on that puts a unit mass at location . The supremum norm of a function is . When is a metric space, the Lipschitz seminorm of is defined by where is the metric on the space . For a bounded Lipschitz function on we define . (resp. ) denotes the class of Lipschitz (resp. bounded Lipschitz) functions with (resp. ) bounded by 1. Occasionally we will suppress from the notation and write and when clear from the context. For a Polish space , is equipped with the topology of weak convergence. A convenient metric metrizing this topology on is given as for . For a signed measure on , we define whenever the integral makes sense. The space will be equipped with the Wasserstein-1 distance that is defined as follows:
[TABLE]
where the infimum is taken over all valued random variables defined on a common probability space and where the marginals of are and respectively. From Kantorovich-Rubenstein duality (cf. [17]) one sees the Wasserstein-1 distance has the following characterization
[TABLE]
For a signed measure on , the total variation norm of is defined as . Probability distribution of a valued random variable will be denoted as . Convergence in distribution of a valued sequence to a valued random variable will be written as .
A finite collection of valued random variables is called exchangeable if
[TABLE]
for every permutation on the symbols . Let be a collection of valued random variables, such that for every , is exchangeable. Let . The sequence is called -chaotic (cf. [16]) for a , if for any , one has
[TABLE]
Denoting the marginal distribution on first coordinates of by , equation (1.7) says that, for every . The gradient of a real differentiable function on denoted by is defined as the dimensional vector field . For a function
[TABLE]
The function is defined similarly. Absolute continuity of a measure with respect to a measure will be denoted by We will denote the Radon-Nikodym derivative of with respect to by . For and a transition probability kernel on , define as . For any closed subset , and define as . For a matrix the usual operator norm is denoted by .
2 Description of the nonlinear system:
We now describe the nonlinear dynamical system obtained on taking the limit of . Given a density function on and , define a transition probability kernel on as
[TABLE]
With an abuse of notation we will also denote by the map from to itself, defined as
[TABLE]
For , let be defined as
[TABLE]
Note that \mu Q^{\rho,\mu_{1}}=\mathcal{L}\big{(}AX+\delta f(\nabla\rho(X),\mu_{1},X,\epsilon)+B(\epsilon)\big{)} where .
Define is continuously differentiable and For notational simplicity we will identify an element in with its density and denote both by the same symbol. Define the map as
[TABLE]
Under suitable assumptions (which will be introduced in Section 3) it will follow that for every defined by (1.4) is in and defined by (2.1) is in . Thus (under those assumptions) is a map from to itself. Using the above notation we see that is a valued discrete time Markov chain defined recursively as follows. Let , and be the initial chemical field which is a random element of . Let Then, for
[TABLE]
We will call this particle system as . We next describe a nonlinear dynamical system which is the formal Vlasov-Mckean limit of the above system, as . Given define a sequence in as
[TABLE]
Using (2.2) the above evolution can be represented as
[TABLE]
As in [5], the starting point of our investigation on long time asymptotics of the above interacting particle system will be to study the stability properties of (2.4). We identify that are equal a.e under the Lebesgue measure on . From a computational point of view we are approximating by uniformly in time parameter , with explicit uniform concentration bounds. Such results are particularly important for developing sampling methods for approximating the steady state distribution of the mean field models such as in (2.4).
The third equation in (2.3) makes the simulation of numerically challenging. In section 3 we will mention another particle system (based on the second particle system in [3]) referred to as which also gives an asymptotically consistent approximation of (2.4) and is computationally more tractable. We show in THeorem 3.2 that under conditions that include a Lipschitz property of (Assumptions 1 and 2), smoothness assumptions on the transition kernels of the background diffusion of the chemical medium (Assumption 4) the Wasserstein-1() distance between the occupation measure of the particles along with the chemical medium and converges to [math], for every time instant Under an additional condition on the contractivity of and being sufficiently small we show that the nonlinear system (2.5) has a unique fixed point and starting from an arbitrary initial condition, convergence to the fixed point occurs at a geometric rate. Using these results we next argue in Theorem 1 that under some integrability conditions (Assumption 7-8), as , the empirical occupation measure of the -particles and density of the chemical medium at time instant , namely converges to in the distance, in , uniformly in . This result in particular shows that the distance between and the unique fixed point of (2.5) converges to zero as and in any order. We next show that for each , there is unique invariant measure of the -particle dynamics with integrable first moment and this sequence of measures is -chaotic, namely as , the projection of on the first -coordinates converges to for every . This propagation of chaos property all the way to crucially relies on the uniform in time convergence of to . Such a result is important since it says that the steady state of a -dimensional fully coupled Markovian system has a simple approximate description in terms of a product measure when is large. This result is key in developing particle based numerical schemes for approximating the fixed point of the evolution equation (2.5). Next we present some uniform in time concentration bounds of . Proof is very similar to that of Theorem 3.8 of [5] so we only provide a sketch after showing necessary conditions.
3 Main Results:
We now introduce our main assumptions on the problem data. Recall that is assumed to be exchangeable with common distribution We assume further For a matrix B we denote its norm by i.e. .
Assumption 1
The error distribution is such that where
[TABLE]
It follows that
[TABLE]
where .
Recall the function introduced in (1.2).
Assumption 2
The error distribution is such that
[TABLE]
Assumption 3
* (the density function) is a Lipschitz function on and .*
Assumptions 4 and 5 on the kernels and hold quite generally. In particular, they are satisfied for Gaussian kernels.
Assumption 4
There exist and such that for all
[TABLE]
Furthermore
[TABLE]
Using the Lipschitz property in (3.3) and the growth condition (3.6) one has the linear growth property for some
[TABLE]
A similar inequality holds for from (3.4) with .
Denote by .
Assumption 5
For every and are also Lipschitz and
[TABLE]
Also defined as above for is finite.
Assumption 6
Both and are such that for any compact set the families of probability measures and are both uniformly integrable.
Let .
Remark 3.1
Assumption 5 is satisfied if are given as follows. For any let
[TABLE]
where are valued random variables and and are maps with following properties:
[TABLE]
where
[TABLE]
Simulation of the system is numerically intractable due to the step that involves the updating of to This requires computing the integral in (1.4) which, since is a mixture of two transition kernels, over time leads to an explosion of terms in the mixture that need to be updated. An approach (proposed in [3]) that addresses this difficulty is, without directly updating , to use the empirical distribution of the observations drawn independently from
Denote by a sample of size from Let . The new particle scheme will be described as a family of valued random elements on some probability space defined recursively as follows. Set . For
[TABLE]
where is the random measure defined as where conditionally on are i.i.d distributed according to We will call this particle system as . We remark that our notation is not accurate since both the quantities depend on The superscripts only describe the number of particles/samples used in the procedure to combine them. Note that like here is not a Markov chain on anymore. Rather is a discrete time Markov chain on .
For any random variable we denote E\big{[}Z\big{|}\mathcal{F}_{k}^{M,N}\big{]} by E_{k}^{M,N}\big{[}Z\big{]}. The following result shows that the particle systems in (2.3) and (3.10) approximate the dynamical system in (2.4) as (respectively for ) becomes large for a fixed time instant.
Proposition 3.2
Suppose Assumptions 1,2,4 and 5 hold.
- (a)
Consider the particle system in (1.3,1.5). Suppose the sampling of the exchangeable datapoints is exchangeable and is - chaotic. Suppose as . Then, as
[TABLE]
for all where are as in (2.4). 2. (b)
Consider the second particle system Suppose that in addition Assumption 6 holds. Suppose the sampling of the exchangeable datapoints is exchangeable and is - chaotic. Then as
[TABLE]
for all .
As a consequence of Proposition 3.2, we have a finite time propagation of chaos result of the following form. Let
Corollary 3.3
Under Assumptions as in Proposition 3.2 the family is chaotic for every .
As noted in introduction, the primary goal is studying long time properties of (1.3) and the non-linear dynamical system (2.4). Following proposition identifies the range of values of the modeling parameters that leads to stability of the system.
Proposition 3.4
Suppose Assumptions (1)-(5) hold. Then there exist such that for all , and . The map defined in (2.2) has a unique fixed point in
Now we will give more stringrent conditions under which a non-asymptotic bound on convergence rates of the particle system to the deterministic nonlinear dynamics and their consequences for the steady state behavior can be established.
Assumption 7
For some
[TABLE]
We need to impose the following condition on for uniform in time convergence.
Assumption 8
For some There exist and in such that following holds for all
[TABLE]
Now we state a generalization of the Proposition 3.2, which gives the convergence rate of
[TABLE]
uniformly over all in a nonasymptotic manner.
Recall introduced in Assumption 3. For let . With the notations of Assumption 1 we define
[TABLE]
For define the following distance on
[TABLE]
Theorem 1
Consider the particle system . Suppose Assumptions (1)-(5) and Assumptions (7),(8) hold for some . Let Also assume and
[TABLE]
Then there exists and such that for each the upperbound of
[TABLE]
can be expressed as
[TABLE]
where the value of the constant will vary for each of the cases.
Remark 3.5
For the first particle system (1.3-1.5) similar results hold where the explicit bounds are given in terms of number of particles instead of For if the initial sampling scheme of is -chaotic then using the fact as it follows from the conclusion of the Theorem 1
[TABLE]
as For the first particle system in (1.3-1.5), if as and is -chaotic then following
[TABLE]
holds for .
One consequence of above theorem and Proposition 3.4 will be the following interchange of limit results which is analogous to Corollary 3.5 from [5].
Corollary 3.6
Under conditions of the Theorem 1
[TABLE]
Suppose Assumptions of Theorem 1 hold and let be the fixed point of the map of (2.5). We are interested in establishing a propagation of chaos result for Recall for is the random measure defined as where conditionally on are i.i.d distributed valued random variables according to Denote .
Theorem 2
Consider the second particle system . Suppose Assumptions 1,2,4,5 hold with conditions
[TABLE]
Then for every the Markov process \big{(}\bar{X}^{N}(n),\bar{\eta}_{n}^{M},S^{M}(\bar{\eta}_{n}^{M})\big{)}_{n\geq 0} on has a unique invariant measure if following holds
[TABLE]
Let be the marginal distribution on of the first co-ordinate of . Suppose additionally Assumption 4,3 and Assumption 7,8 hold with further condition for some
[TABLE]
Then is - chaotic, where is defined in Proposition 3.4.
Remark 3.7
For first particle system similar steady state result holds for the discrete time Markov chain \big{(}\bar{X}^{N}(n),\bar{\eta}_{n}^{N}\big{)}_{n\geq 0} on
3.1 Concentration Bounds:
In order to obtain uniform in time concentration bounds of \mathcal{W}_{1}\big{(}(\mu_{n}^{N},\eta_{n}^{N}),(\mu_{n},\eta_{n})\big{)} we proceed according to those in Theorem 3.7 and Theorem 3.8 of [5] respectively. Here we establish two different types of concentration bounds. The first one is with initial non iid (i.e initial samples are chaotic) assumption and the second one is without that.
Assumption 9
(i) For some , for a.e. .
(ii) There exists such that and there exists such that
[TABLE]
Assumption 10
Suppose there exists functions ,, , ( are nondecreasing with , ), and constants such that and are respectively and Lipschitz. There exists such that following hold for all
[TABLE]
Remark 3.8
- (a)
For Gaussian transtion kernel one has
[TABLE]
where is the cumulative distribution function of Normal distribution. So (3.15) holds with 2. (b)
For Bi-exponential kernel one has
[TABLE]
So (3.15) holds under condition with h_{1}(x)=x,\quad h_{3}(\cdot)=0,\quad h_{2}(\alpha_{1})=\log\Big{[}\frac{1}{1-\alpha_{1}^{2}\lambda^{2}}\Big{]}. Note that any kernel with tail lighter than exponential (like Gaussian) will satisfy (3.15) for all where for kernels with exponential like tail will have a specific restriction on 3. (c)
We worked here only for as the upper bound. It only influences in the choice of for which
[TABLE]
For one has a definite upper bound of More precisely denoting by if is linear in (happens only for ) then there exists such that (3.16) holds for . On the other hand if is bounded, then will remain finite for all . If is exponential in (when ) then the upper bound of will diverge.
With defined above in Assumption 7 let
[TABLE]
Theorem 3
- (a)
(Polynomial Concentration) Let Suppose Assumptions (1-5) and Assumptions (7),(8) hold for some . Suppose that and
[TABLE]
Then there exits , and such that for all and for all
[TABLE]
for all . 2. (b)
(Exponential Concentration)Let Suppose that Assumptions 9 and 10 hold with (3.18). Suppose \delta\in\Big{[}0,\frac{1-\|A\|}{(2+l^{\nabla,\alpha}_{PP^{\prime}})K}\Big{)} and where
[TABLE]
Then there exists and such that for all
[TABLE]
for all , , if ; and
[TABLE]
for all , , if .
Remark 3.9
- (a)
Similar concentration bounds hold for the first particle system 2. (b)
*Here the nonlinearity in the kernel of the nonlinear Markov process has a linear structure (linear combination of and ) which is handled through distance. It can be further generalized for any nonlinear Markov process where the nonlinearity in the kernel depends on the higher order moments (of *th order) of the law of the chain, then working with distance would yield similar results.
Note that the bounds in Theorems 3 are not dimensions independent while the initial sampling assumptions are not restrictive. It will be interesting to see if one can get sharper bounds under stronger conditions than above theorems. The following result shows that such bounds can be obtained in cases where initial locations of particles are i.i.d and under a more stringent condition on other parameters.
Theorem 4
Consider the first particle system with initial condition . Suppose that are i.i.d. with common distribution for each . Let
[TABLE]
Suppose that Assumptions 1,4,5 and 9 hold with conditions , \delta\in\Big{[}0,\frac{1-\|A\|}{(2+l^{\nabla,\frac{\alpha}{\delta}}_{PP^{\prime}})K}\Big{)} and . Then there exist and for all
[TABLE]
Remark 3.10
- (a)
If Assumption 9 is strengthened to for some then one can strengthen the conclusion of Theorem 4 as follows: For sufficiently small there exist and a nonincreasing function such that as and for all and
[TABLE] 2. (b)
Here stability condition (3.18) which is a crucial assumption for Lemma 5.4 is not used. Such is the power of the coupling that we used in Theorem 4.
4 Discussion and Conclusion
This article decribes a modified version of discrete time particle approximation scheme described in [3] which incorporates the evolution of particles in a non-compact domain. A similar form of stability condition is obtained under which the nonlinear system has a unique fixed point. Our contribution is computing the quantitative nonasymptotic bounds on these approximation schemes and how these relate to the conditions on the tail and smothness of the transition kernels that were used to model the diffussive environment. As an additional result we obtained the propagation of chaos result of the particle scheme at time There are few questions and remarks that should be addressed in future.
- (a)
Theorem 4 is developed exclusvely for . For we would have an extra term in the expression of . Now the problem will arise in computing sharper (than (5.109)) bound of
[TABLE]
Concentration bound of the conditional probability can be given in terms of random \big{<}e^{\alpha_{1}|x|},\bar{\eta}_{n-1}^{M}\big{>} but getting an explicit relationship of the bound with the conditional exponential moment is unavailable. After taking expectation it is impossible conclude whether the inequality of upper bound still holds or not. Illustratively if the conditional concentration bound of P\big{[}\mathcal{W}_{1}\left(S^{M}(\bar{\eta}^{M}_{n-1}),\bar{\eta}_{n-1}^{M}\right)>\varepsilon\big{|}\bar{\mathcal{F}}_{n-1}^{M,N}\big{]} is a concave function of \big{<}e^{\alpha_{1}|x|},\bar{\eta}_{n-1}^{M}\big{>} then by Jensenβs inequality reasonable conclusion would hold but to our knowledge such explicit relationship is not present in literature. 2. (b)
The concentration bounds established in [10] for distance of empirical distribution of i.i.d observations to the true distribution is sharp however their method can be applied here only for as done in Theorem 4 using the well known coupling construction that works for all Vlasov McKean type systems. Without using that coupling, we attempted to use the grid based methods of [10] in order to find sharper bounds for P[\mathcal{W}_{1}\big{(}(\bar{\mu}_{n}^{N},\bar{\eta}_{n}^{M}),\Psi(\bar{\mu}_{n-1}^{N},\bar{\eta}_{n-1}^{M})\big{)}>\varepsilon] along the line of Theorem 3. We faced similar problem as in the previous remark. Since one can derive a bound for P[\mathcal{W}_{1}\big{(}(\bar{\mu}_{n}^{N},\bar{\eta}_{n}^{M}),\Psi(\bar{\mu}_{n-1}^{N},\bar{\eta}_{n-1}^{M})\big{)}>\varepsilon\big{|}\bar{\mathcal{F}}_{n-1}^{M,N}] keeping \big{<}e^{\alpha_{1}|x|},\bar{\eta}_{n-1}^{M}\big{>},\big{<}e^{\alpha_{1}|x|},\bar{\mu}_{n-1}^{N}\big{>} as constants but we do not know explicit structure how these bounds are functionally depending on \big{<}e^{\alpha_{1}|x|},\bar{\eta}_{n-1}^{M}\big{>},\big{<}e^{\alpha_{1}|x|},\bar{\mu}_{n-1}^{N}\big{>}, so that unconditionally we can conclude something useful. These issues will be addressed in future.
5 Proofs
The following two elementary lemmas give a basic moment bound that will be used in the proofs. We denote the function by
Lemma 5.1
For an interacting particle system illustrated in (1.3) and (1.5),
- (a)
Suppose Assumptions 1, 2 and 4 hold. Then, for every Moreover if Assumption 1 holds, then under then 2. (b)
With the assumptions in part(a) suppose additionally Assumption 7 holds for some and suppose Then
[TABLE]
where in limit as .
Remark 5.1
Note that the same bound for and also hold for under same condition on .
5.0.1 Proof of Lemma 5.1
- (a)
We prove the second statement. Proof of the first statement is similar. For each and applying Assumption 1 on particle system in (1.3) with definitions of and
[TABLE]
Now by Assumption 4 using DCT one has
[TABLE]
for every since from Assumption 4 \sup_{x\in\mathbb{R}^{d}}|\nabla_{y}R^{\alpha}_{\mu_{n}}(x,y)|\leq l^{\nabla,\alpha}_{PP^{\prime}}\,|y|+\sup_{x\in\mathbb{R}^{d}}\big{(}(1-\alpha)|\nabla_{y}P(x,0)|+\alpha|\nabla_{y}P^{\prime}(x,0)|\big{)}. Applying the same condition followed by the inequality
one has
[TABLE]
Also note by exchangeability . Taking expectation in (5.1) and using (5.3) and independence between and one has
[TABLE]
The assumption on implies that A recursion on (5.4) will give from which the result follows. 2. (b)
By Holderβs inequality for any three nonnegative real numbers
[TABLE]
Starting with (5.1), applying (5.5), and Assumption 1, on (5.1) we have
[TABLE]
For any convex function applying Jensenβs inequality one gets Using after taking expectation one gets following recursive equation for ,
[TABLE]
Note that for our condition on \delta,\quad\quad\kappa_{1}:=4^{\tau}\bigg{[}\|A\|^{(1+\tau)}+\delta^{1+\tau}\sigma_{1}(\tau)\big{[}(1+l^{\nabla,\alpha}_{PP^{\prime}})^{1+\tau}+1\big{]}\bigg{]}<1. Thus
[TABLE]
Lemma 5.2
Suppose Assumptions 1,2,4 and 5 hold.
- (a)
Consider the interacting particle system described in (1.3) and (1.5). Then, for every
[TABLE]
Moreover if Assumption 1 holds, then under conditions
[TABLE]
one has
Additionally assuming one gets
[TABLE] 2. (b)
With the assumptions in part(a) suppose additionally Assumption 7,8 hold for some and suppose Then with condition one has Additionally assuming one gets where in limit as .
Remark 5.2
The second condition in (5.8) is very general. It doesnβt impose any condition on The condition holds for all transition kernels with finite first moment. Only thing one needs to check
[TABLE]
where is some polynomial in (For Gaussian itβs linear). If is an exponential function then it will impose a further lower bound condition on .
Corollary 5.3
For same conclusion about holds as in first particle system specified in Lemma 5.2 under same set of conditions on . Note that so we donβt need to assume anything about the initial sampling scheme like (or ) since they automatically hold for (or ) respectively.
5.0.2 Proof of Lemma 5.2
We will start with the second part of part (a) of the lemma. First part will follow similarly. We will show if then for all Note that
[TABLE]
From Assumption 5, it is obvious that is Lipschitz if is a -Lipschitz function. It implies for any Since is -Lipschitz, one has
[TABLE]
Using this inequality one has from (5.9)
[TABLE]
By Assumption 5, implies . From similar derivation done in Lemma 5.1, one has if The result follows using all the conditions
[TABLE]
For note that for any function
[TABLE]
From Lemma 5.1 for Putting then expanding similarly like (5.10) after taking expectation one gets a similar bound and finiteness of follows from that.
Proof of Lemma 5.2(b): From (5.9),
[TABLE]
From Assumption 8 we get the following recursion for for any measure
[TABLE]
since from Assumption 8. Using the fact we finally have
[TABLE]
Under condition and one gets Similarly the same bound can be derived for under the same set of conditions.
5.0.3 Proof of Corollary 5.3
To prove the Corollary about define the random operator acting on the probability measure on Note the following recursive form of :
[TABLE]
Note that for any function one has
[TABLE]
Now by expanding one gets,
[TABLE]
Taking expectation one has
[TABLE]
Continuing this calculation times one has which leads to the following expression
[TABLE]
The corollary is proved by observing (5.16). The same bound holds for both , because of the similarity of bounds of , and for which follows from Remark 5.1.
5.1 Proof of Proposition 3.2
We will prove part (b) of the theorem. Part (a) will follow similarly. We will start with the following lemma.
Lemma 5.3
- (a)
Under Assumptions 1,2,4, for every and , there exists a compact set such that
[TABLE] 2. (b)
Suppose Assumptions 1,2,4,5,6 hold. Then for every and , there exists a compact set such that
[TABLE]
This part of the lemma is exclusively for part (b) of the Proposition 3.2.
Proof: Note that for any non-negative ,
[TABLE]
To get the desired result from above equalities it suffices to show that
[TABLE]
We will prove (5.19) by induction on . Once more we suppress from the super-script. Clearly by our assumptions is uniformly integrable. Now suppose that the Statement (5.19) holds for some . Note that from (5.1) and (5.3)
[TABLE]
From Assumptions 1 and 2 the families , are uniformly integrable. Now by exchangeability, \frac{1}{N}\sum_{i=1}^{N}|X_{n}^{i}|=E\Big{[}|X_{n}^{i}|\Big{|}\sigma\Big{(}\frac{1}{N}\sum_{i=1}^{N}\delta_{X_{n}^{i}}\Big{)}\Big{]}. If is uniformly integrable, and is a collection of - fields where are arbitrary index sets, then is also a uniformly integrable family. It follows that is a uniformly integrable family from induction hypothesis. Using (5.19) again along with independence between and yield that the family is uniformly integrable. The result follows.
Proof of Lemma 5.3(b): Note that where \{Y^{i,M}_{k}\}_{i=1}^{M}\bigg{|}\mathcal{F}^{M,N}_{k} are i.i.d from So for any non-negative function we have
[TABLE]
We will prove the result if we can show the family
[TABLE]
We will prove (5.21) through induction on . For the result follows trivially since are i.i.d from Suppose it holds for We will show that both,
[TABLE]
Then from the structure it is evident that is uniform integrable which equivalently implies is UI too. On proving the first assertion in (5.1), note that due to the exchangeability of one has
[TABLE]
We know that if is a uniformly integrable family and is a collection of -fields where are arbitrary index sets, then is a uniformly integrable family. So from (5.23) it suffices to prove that is uniformly integrable. Define a function such that, , if and , if and linear in between range. Then by construction is Lipschitz with coefficient 2 and for all By Assumption 6 we have that is uniformly integrable. So taking the compact set assuming has unconditional law for all the quantity
[TABLE]
The display in (5.24) follows from Assumption 5 and using Lipschitz property of After taking supremum in the set in both sides of (5.25), second part of R.H.S goes to as by induction hypothesis. About the first part goes to [math] as by D.C.T since () and also converges to [math] (as goes to ) due to the tightness of which also follows from induction hypothesis. The second assertion that is uniformly integrable follows similarly through induction.
We will proceed to the main proof via induction on for the quantity . For , we will first show that as From [16] we have
[TABLE]
From Lemma 5.3 one can construct compact ball containing so that and hold. So using the fact for any with one has
[TABLE]
In last display we used the fact that . Note that is bounded by (so Uniformly Integrable) and implies as proving the assertion (3.12) for . Suppose it holds for We start with the following triangular inequality
[TABLE]
Consider the third term of (5.27). From the general calculations follwed by (5.45)-(5.47), we have the following estimate,
[TABLE]
Now we consider the first term of the right hand side of (5.27). We will use Lemma 5.3(a). Fix and let be a compact set in such that
[TABLE]
Let . Then,
[TABLE]
We will now apply Lemma A.1 in the Appendix. Note that for any ,
Thus with notation as in Lemma A.1
[TABLE]
where we have denoted the restrictions of and to by the same symbols. Using the above inequality in (5.29), we obtain
[TABLE]
Using Lemma A.2 we see that the first term on the right hand side can be bounded by .
Consider the second term of R.H.S of (5.27). From Assumption 4 applying DCT one has
[TABLE]
Suppose is a random variable conditioned on is distributed with law . Then almost surely is
[TABLE]
(5.34) follows by using Assumption 4. About the first term in (5.34) note that from triangular inequality,
[TABLE]
The first term in (5.35) can be written as
[TABLE]
By Lemma 5.3(b), for a specified one can construct a compact set containing [math] such that,
[TABLE]
Denote . Using Lemma A.1 we have the L.H.S of (5.36)
[TABLE]
where (5.36) follows from similar arguments used in (5.31). Note that the Lemma 5.3 also suggests the compact set is non-random, which only depends on and only. So from the display above we have
[TABLE]
Using Lemma A.2 we get the final bound of the first term in RHS of (5.37) as . Combining this estimate with (5.28),(5.31) and (5.34) we now have
[TABLE]
For the term we start with the following recursive form
[TABLE]
which leads to the following inequality
[TABLE]
Using earlier estimates one has the final estimate for
[TABLE]
Adding (5.38) and (5.41), using induction hypothesis and sending we have
[TABLE]
Since arbitrary, the result follows.
Part (a) can be proved similarly. The change will come from the structural difference of and because of the change in the updating kernel. So the term coming from the quantity wonβt appear here. Hence we get the following final estimate
[TABLE]
from which the result follows by induction.
5.2 Proof of Proposition 3.4
The techniques that we used is very similar with the contraction based method that was used in [3]. We will start with the following lemma and then prove the Proposition 3.4 using it. Define the following distance on for
[TABLE]
Note that it is a complete separable metric of the space
Lemma 5.4
Let and . Suppose Assumptions 1,2, 4 and 5 hold. Then the transformation is well defined if following hold
[TABLE]
Moreover if Assumptions 4,3 and 5 hold with the following condition:
[TABLE]
Then there exist a and a constant such that for any
[TABLE]
Remark 5.4
The condition (5.43) implies the first condition of (5.42) while the second one is very general.
5.2.1 Proof of Lemma 5.4
For fixed and define the following quantities for
[TABLE]
First we will show that under transformation the for so that the quantity is well defined. Note that , if then implying
[TABLE]
which follows similarly from the proof of Lemma 5.1(a). It means if and hold, then for all . Under conditions in (5.42) one also has for all One has by Assumption 4 using DCT. From that condition it follows that for any , showing for all if .
Now we will go back to the proof of the second part of the lemma regarding the contraction part. Assume . The first term of can be expressed as
[TABLE]
[TABLE]
The last inequality (5.45) follows from Assumption 1. As a consequence of Assumption 4 from (5.2) it follows that
[TABLE]
With that estimate, taking infimum at R.H.S of (5.45) with all possible couplings of with marginals respectively and , one gets
[TABLE]
Let be a valued random variable with law . Now about the term ,
[TABLE]
Note that
[TABLE]
Since from Assumption 4 is a Lipschitz function with coefficient , the first integrand in (5.49) will be bounded by which gives
[TABLE]
Now using Assumption 3 the second term gives similarly
[TABLE]
Using the Assumption 5 we have
[TABLE]
Combining (5.50),(5.51) and (5.52) we have the following recursion for
[TABLE]
Define a sequence for and and first two terms we set them to be
[TABLE]
which are well defined for and Then from (5.53) and denoting c_{1}:=\max\left\{\left(\big{(}\|A\|+\delta\sigma(2+l_{PP^{\prime}}^{\nabla,\alpha})\big{)}+\alpha l(P^{\prime})\right),(1-\alpha)l(P)\right\}, c_{2}:=\delta\sigma\max\big{\{}\alpha l_{P^{\prime}}^{\nabla},(1-\alpha)l_{P}^{\nabla}\big{\}} following holds
[TABLE]
for Given if there exists a for which the following inequality holds
[TABLE]
then denoting we have
[TABLE]
Existence of a solution satisfying (5.55) is valid under which is equivalent to the condition
[TABLE]
in (5.43) satisfied by . From (5.57) it follows
[TABLE]
for . Since
[TABLE]
where Final estimate for is
[TABLE]
Since and have linear growth (since ), the second term inside the bracket is finite. A general formula can be observed for
[TABLE]
where
[TABLE]
Observe that the quantity inside the bracket of RHS of (5.58) is finite for and . Hence proved the lemma.
We now complete the proof of the theorem. Given from Assumption (5), one can always find for which (5.57) holds under
[TABLE]
For existence we need to show that under distance is complete. From Lemma 5.4 one can choose such that (5.43) holds. It follows that using the from that lemma the sequence is a cauchy sequence in which is a complete metric space under So there exists a such that as . Our assertion for existence will be proved if we prove Given the initial conditon we will always have from (5.2) Note that for , one has for all This implies So
[TABLE]
Observe further for in (5.58) of Lemma 5.4
[TABLE]
Uniqueness of fixed points follows immediately from (5.59).
5.3 Proof of Theorem 1
We will prove part (b) of the theorem. Part (a) will follow similarly. We need to prove the following Lemma first.
Lemma 5.5
Consider the second particle system Suppose that Assumptions 7,8 hold. Denote Then there exist a constant such that the upper-bound of the quantity \sup_{k\geq 1}E\mathcal{W}_{1}\big{(}(\bar{\mu}_{k}^{N},\bar{\eta}_{k}^{M}),\Psi(\bar{\mu}_{k-1}^{N},\bar{\eta}_{k-1}^{M})\big{)} can be given as as defined in Theorem 1. The constant will vary for dfferent cases.
5.3.1 Proof of Lemma 5.5
We start with the fact that
[TABLE]
In order to bound both terms in (5.60) we borrow the following formulation from [10] about the convergence rate of empirical distribution of iid random variables to its common distribution, where the key idea of bounding Wasserstein distance came from the constructive quantization context [9]. A similar idea was also developed in [1]. We will maintain the same notation used in [10]. Let be the natural partition of into translations of Define a sequence of sets such that and, for , For a set denote the set as For any two probability measures and , combining Lemma and of [10] one has the following inequality for the Wasserstein- distance,
[TABLE]
where is a constant depends only on We denote It follows that Note that on conditioned upon the family of signed measures is an independent class of measures while unconditionally they are just identical. Using the fact that for any set A\in\mathcal{B}(\mathbb{R}^{d}),\quad\delta_{\bar{X}_{k}^{i}}(A)\bigg{|}\mathcal{F}_{k-1}^{M,N}\sim\text{Bernoulli}(\delta_{\bar{X}_{k-1}^{i}}Q^{\bar{\eta}_{k-1}^{M},\bar{\mu}_{k-1}^{N}}(A)), we have
[TABLE]
which implies the unconditional expectation E\big{[}\big{(}a_{k}^{i,M,N}(A)\big{)}^{2}\big{]}\leq P\big{[}\bar{X}^{i}_{k-1}+\delta f_{\delta}(\nabla\bar{\eta}^{M}_{k-1},\bar{\mu}_{k-1}^{N},\bar{X}^{i}_{k-1},\epsilon^{N}_{k})\in A\big{]}. Using all these we have
[TABLE]
Using these with Cauchy-Schwarz inequality one gets following bound
[TABLE]
where second term inside the bracket of RHS of (5.63) follows trivially. Denoting the whole constant in R.H.S of (5.61) as we have
[TABLE]
Note that . Using Cauchy-Schwarz inequality with (5.63) and Jensenβs inequality for non-negative random variable , the last sum E\sum_{F\in\mathcal{P}_{l}}\big{[}\bar{\mu}_{k}^{N}(2^{n}F\cap B_{n})-\bar{\mu}_{k-1}^{N}Q^{\bar{\eta}_{k-1}^{M},\bar{\mu}_{k-1}^{N}}(2^{n}F\cap B_{n})\big{]} in the R.H.S of (5.64) can be bounded by
[TABLE]
Now using Remark 5.1 along with Lemma 5.1, if the quantity one has by Chebyshev inequality for
[TABLE]
Note that as and we can find such that So the bound in (5.64) can be restated as
[TABLE]
where is just a constant and the last display is obtained by accumulating upper bounds of all the constants to . Now proceeding exactly like step 1 to step 4 of the proof of Theorem 1 (for ) in [10] one gets the following bounds
[TABLE]
Now we will fill the gaps for each of the three special cases and of three regimes respectively and . We note that one can generalize the choice of done in step 1 of Theorem 1 of [10] where could be taken as instead of though it doesnβt change the conclusion of the main theorem. After step with one will get
[TABLE]
where the constant will vary from case to cases. Suppose From (5.66) for general one has
[TABLE]
Note that for one has So for
[TABLE]
For from (5.66) for general one has
[TABLE]
For Note that if then one has
[TABLE]
[TABLE]
By proceeding similarly, for all non regular cases we will end up getting the following results (the constant will vary from case to cases):
[TABLE]
Now about the second term of (5.60) using (5.61), the upperbound of is
[TABLE]
By Cauchy Schwarz inequality and using Jensen inequality for a nonnegative random variable one gets the upperbound of
[TABLE]
Using similar argument used in (5.62) the R.H.S of (5.71) will be less than
[TABLE]
Finally using Jensen inequality and from Corollary 5.3 followed by Lemma 5.2(b) denoting one gets
[TABLE]
Hence the conclusion about the upper bound of will be similar to the first term of (5.60). It will be a function of the sample size of the concentration gradient in place of in the bound of . Combining this with the conclusion about the first term of (5.60) we can state the bound in terms of and the result of Lemma 5.5 will follow.
Now we will complete the theorem. Observe the following identity
[TABLE]
Using Triangular inequality and Lemma 5.4 following holds
[TABLE]
where (5.74) follows from (5.58) with specified constants and and . Let be a random variable, conditioned on sampled from We have
[TABLE]
Last display follows from Assumption 4. Since one has
[TABLE]
Combining the results (5.75),(5.76), with (5.74) we get for each
[TABLE]
Using Lemma 5.5 the result follows.
5.4 Proof of Corollary 3.6:
Using triangular inequality and from (5.58) one gets
[TABLE]
Combining this with (5.77) we get
[TABLE]
The result is obvious after using Lemma 5.5.
5.5 Proof of Theorem 2:
Fix and . Define as
[TABLE]
for and where are as defined in the context of . Note that is a complete separable metric space with metric d((x,\mu_{1},\mu_{3}),(y,\mu_{2},\mu_{4})):=\|x-y\|+\frac{1}{2}\mathcal{W}_{1}(\mu_{1},\mu_{2})+\frac{1}{2}\mathcal{W}_{1}\big{(}\mu_{3},\mu_{4}\big{)} where for . From Lemma 5.1 and 5.2 it follows that, for each the sequence is relatively compact (By Prohorovβs Theorem) and using Assumption 1 it is easy to see that any limit point of (as ) is an invariant measure of the Markov chain and from Lemma 5.1 it satisfies (Taking the norm of the product space as where ). Uniqueness of invariant measure can be proved by the following simple coupling argument (see for example [5]): Suppose , are two invariant measures that satisfy , .
Let \big{(}X_{0}(N),\eta_{0}^{M},S^{M}(\eta_{0}^{M})\big{)} and \big{(}\tilde{X}_{0}(N),\tilde{\eta}_{0}^{M},S^{M}(\tilde{\eta}_{0}^{M})\big{)} with probability laws and respectively be given on a common probability space under same noise sequence (i.e in which an i.i.d. array of valued random variables are defined that is independent of with common probability law ) and the evolution equations are following.
[TABLE]
where recall Note that
[TABLE]
for any two arrays and . Using the independence of the noise sequence along with (5.80) and Assumption 1 we have
[TABLE]
Now applying Assumption 4 (doing similar calculations as in (5.48),(5.50),(5.51)) following inequality holds
[TABLE]
Note that (5.80) implies
[TABLE]
from which following holds from (5.82)
[TABLE]
We also have
[TABLE]
and after taking expectation
[TABLE]
Letting A^{(M,N)}_{n+1}:=\frac{1}{N}\sum_{i=1}^{N}|X_{n+1}^{i}-\tilde{X}_{n+1}^{i}|+\mathcal{W}_{1}\big{(}\eta^{M}_{n+1},\tilde{\eta}^{M}_{n+1}\big{)}, we have the following recursion relation combining (5.81),(5.84) and (5.86)
[TABLE]
which is the same recursion as in (5.54). Now for the chosen satisfying (5.57) there exists a such that
[TABLE]
Also, since and are invariant distributions, for every , \big{(}X_{n+1}(N),\eta_{n+1}^{M},S^{M}(\eta_{n+1}^{M})\big{)} is distributed as and \big{(}\tilde{X}_{n+1}(N),\tilde{\eta}_{n+1}^{M},S^{M}(\tilde{\eta}_{n+1}^{M})\big{)} is distributed as . Thus
and \big{(}\tilde{X}_{n+1}(N),\tilde{\eta}_{n+1}^{M},S^{M}(\tilde{\eta}_{n+1}^{M})\big{)} define a coupling of random variables with laws and respectively. From (5.88) we then have
[TABLE]
as So there exists a unique invariant measure \Theta_{\infty}^{N,M}\in\mathcal{P}_{1}\big{(}(\mathbb{R}^{d})^{N}\times\mathcal{P}_{1}^{*}(\mathbb{R}^{d})\times\mathcal{P}(\mathbb{R}^{d})\big{)} for this Markov chain and, as ,
[TABLE]
This proves the first part of the theorem. Denote by and
by .
Define as
[TABLE]
Let and . In order to prove that is -chaotic, it suffices to argue that (cf. [16])
[TABLE]
We first argue that as
[TABLE]
It suffices to show that for any continuous and bounded function . But this is immediate on observing that
[TABLE]
the continuity of the map and the weak convergence of to . Next, for any
[TABLE]
Fix . For every there exists such that for all
[TABLE]
Thus for all
[TABLE]
Finally
[TABLE]
where the first equality is from (5.91), the second uses (5.92) and the third is a consequence of Corollary 3.6. Since is arbitrary, we have (5.90) and the result follows.
5.6 Proof of Concentration bounds:
5.6.1 Proof of Theorem 3 (a):
We start with the following lemma where we establish a concentration bound for \mathcal{W}_{1}\big{(}(\bar{\mu}_{n}^{N},\bar{\eta}_{n}^{M}),\Psi(\bar{\mu}_{n-1}^{N},\bar{\eta}_{n-1}^{M})\big{)} for each fixed time and then combine it with the estimate in (5.74) in order to get the desired result.
Lemma 5.6
*Let Assumptions (1-4) and Assumptions (7),(8) hold for some . Suppose that , and Then there exist
such that for all , and *
[TABLE]
5.6.2 Proof of Lemma 5.6
Second concentration bound will follow by proceeding as Lemma 4.5 of [5]. The proof relies on an idea of restricting measures to a compact set and estimates on metric entropy [2] (see also [17]). The basic idea is to first obtain a concentration bound for the distance between the truncated law and its corresponding empirical law in a compact ball of radius and getting a tail estimate from Lemma 5.2 and Corollary 5.3 after conditioning by . With the notations (for example is the truncated measure of restricted on a ball of radius) introduced in Lemma 4.5 of [5] we sketch the proof of the second bound. With that notation the truncated version of is denoted by . Suppoe are iid from conditioned on where are iid from conditioned under Define
[TABLE]
Note that Denote Now denoting , from (5.80) we have
[TABLE]
Now using Azuma Hoeffding inequality as done in display (4.35) of Lemma 4.5 in [5] one has
[TABLE]
From the definition of
[TABLE]
Using triangular inequality
[TABLE]
combining (5.95),(5.96) and (5.97) the result (5.109) will follow.
The first one (5.108) follows by noting that
[TABLE]
Proceeding like Lemma 4.5 of [5] the bound for the first term in RHS of (5.98) can be established.
5.6.3 Proof of Theorem 3(a)
Combining (5.74),(5.75) and (5.76) it follows that
[TABLE]
Denoting c_{1}:=\max\left\{\left(\big{(}\|A\|+\delta\sigma(2+l_{PP^{\prime}}^{\nabla,\alpha})\big{)}+\alpha l(P^{\prime})\right),(1-\alpha)l(P)\right\}, c_{2}:=\delta\sigma\max\big{\{}\alpha l_{P^{\prime}}^{\nabla},(1-\alpha)l_{P}^{\nabla}\big{\}} define the function as
[TABLE]
Since (from the assumption), and is continuous. So there exists a such that or equivalently
[TABLE]
So there exists a such that statement of Lemma 5.4 holds. Now using that from (5.99) one has
[TABLE]
Let Note that \nu:=\big{(}\frac{1-\gamma}{\theta}\big{)}>1, from our choice of . Therefore denoting N_{1}\geq a_{1}\Big{(}\frac{R}{\beta}\Big{)}^{d+2}\vee 1 implies N_{1}\geq a_{1}\Big{(}\frac{R}{\beta\nu^{n}}\Big{)}^{d+2}\vee 1 for all and a consequence of Lemma 5.6 gives
[TABLE]
Now proceeding similarly like the proof of Theorem 3.7 of [5] through optimizing the value of the conclusion will follow.
5.6.4 Proof of Theorem 3(b)
Second part regarding the exponential concentration bound will follow similarly (like Theorem 3.8 of [5]) under the following lemmas on uniform exponential integrability.
Lemma 5.7
Suppose Assumptions 9 and 10 hold. Suppose there exists such that
[TABLE]
Then for all \alpha_{1}\in[0,\min\big{\{}\alpha^{*},\frac{\alpha(\delta)}{\delta}\big{\}}) and \delta\in\Big{[}0,\frac{1-\|A\|}{(2+l^{\nabla,\alpha}_{PP^{\prime}})K}\Big{)},
[TABLE]
Proof. We will start by proving the second inequality. Note that from Corollary 5.3 the conditions for β are same as the conditions for in and from Lemma 5.2 they are again same as the conditions for finiteness of Note that
[TABLE]
Now from Assumption 10, using lipshitz property one has So we have an upperbound of \big{<}\mu P^{\prime}P^{i},e^{\alpha_{1}|x|}\big{>} that is
[TABLE]
Last inequality follows since are non-decreasing and Using (5.102) under the condition (which we prove shortly) we conclude that or equivalently \sum_{i=0}^{\infty}(1-\alpha)^{i}e^{i\big{[}h_{2}(\alpha)+\alpha_{1}|h_{1}(0)|\big{]}}<\infty if there exists an such that Since is an increasing function of and . From the definition of we can always find such that
Now we prove or equivalently the first term in (5.101). Note that from (5.1) for
[TABLE]
Now from the choice taking expectation after having exponential
[TABLE]
where \mathcal{E}_{1}(\alpha_{1})=e^{\alpha_{1}\delta Kc_{PP^{\prime}}^{\alpha}}\int e^{\alpha_{1}\delta\big{(}A_{2}(z)+\frac{|B(z)|}{\delta}\big{)}}\theta(dz). We note that from Assumption 10 there always exist such that for all
[TABLE]
Using conditioning argument we have
[TABLE]
where (5.105) follows from exchangeability of . Observing and using Jensenβs inequality applied to the function we have after taking expectation
[TABLE]
Since and f_{2}(x):=e^{\alpha_{1}x\big{[}\|A\|+\delta K\big{(}1+l^{\nabla,\alpha}_{PP^{\prime}}\big{)}\big{]}} are both non-decreasing, so putting almost surely in the following inequality and taking expectation we have
[TABLE]
From our choice of \kappa:=\|A\|+\delta K\big{(}2+l^{\nabla,\alpha}_{PP^{\prime}}\big{)}\in(0,1). Denoting from (5.103) we have the following recursive inequality:
[TABLE]
Iterating the above inequality we have for all
[TABLE]
where the second inequality is a consequence of (5.104).
Note further for the system in (2.4) let be defined as the random variables with laws for Then starting similarly from
[TABLE]
using the inequality (similar to Lemma 4.11 of [5]) one can prove
[TABLE]
under same conditions on This is needed for proving The result follows.
Lemma 5.8
Then there exist such that for all and , and
[TABLE]
5.6.5 Proof of Lemma 5.8:
Follows from similar decompositions given in Lemma 5.6 and Lemma 4.7 of [5].
5.6.6 Proof of Theorem 3(b):
Starting from (5.99), the conclusion will follow by applying Lemma 5.8 in (5.6.3).
5.7 Proof of Theorem 4
We will start by introducing a coupling. Consider a system of valued auxiliary random variables defined as follows.
[TABLE]
Now for each is a set of valued iid random variables under initial assumption Suppose . The following Lemma will make a connection between and .
Lemma 5.9
(Coupling with the auxiliary system) Suppose Assumptions 1,4,5 and 9 hold. Then for every and with the and defined in (3.19),(3.20)
[TABLE]
Proof. Since by Assumption 1 and , we have for each
[TABLE]
Using the calculations in (5.46),(5.48),(5.49) and (5.51)
[TABLE]
Thus
[TABLE]
Using (5.112) as the recursion on with we get
[TABLE]
Denote by . Observe that
[TABLE]
Denote the quantity in the third bracket of RHS of (5.113) by Using (5.114) and we have
[TABLE]
where and Thus from (5.113) we have
[TABLE]
Now applying Lemma A.3 we have
[TABLE]
where and Note that from (5.80) we have for all
[TABLE]
Combining the result above and using triangle inequality in (5.117)
[TABLE]
Applying Lemma A.3 with
[TABLE]
We have
[TABLE]
Simplifying (5.118) one gets
[TABLE]
Note that and as defined in (3.19) (3.20) respectively. Thus we have
[TABLE]
The result now follows by an application of triangle inequality.
5.7.1 Proof of Theorem 4
Since So we can find such that Taking that we have . For any , From Lemma 4
[TABLE]
where Note that for \delta\in\Big{[}0,\frac{1-\|A\|}{(2+l^{\nabla,\alpha}_{PP^{\prime}})K}\Big{)}, and from (5.107) we have That implies from the statement of Theorem 2 of [10] that for all
[TABLE]
where a(N,\varepsilon)=e^{-cN\varepsilon^{2}}1_{\{d=1\}}+e^{-cN\big{(}\frac{\varepsilon}{\log(2+\frac{1}{\varepsilon})}\big{)}^{2}}1_{\{d=2\}}+e^{-cN\varepsilon^{d}}1_{\{d>2\}} and In order to prove (3.21) we will prove only for one case Rest will follow similarly. There exists
[TABLE]
Suppose such that for all Combining (5.120),(5.121),(5.122) we have for all and
[TABLE]
Now there exists such that we have
[TABLE]
6 Acknowledgements
A part this article was part of authorβs Phd thesis. The author is thankful to Prof. Amarjit Budhiraja for his comments on an earlier version of the manuscript.
Appendix
The first part of the following lemma is an immediate consequence of Ascoli-Arzela theorem where as the second follows from Lemma 5 in [7].
Lemma A.1
(a) For a compact set in let be the space of functions such that and for all . Then for any there is a finite subset of such that for any signed measure
[TABLE]
The next lemma is straightforward.
Lemma A.2
Let be a transition probability kernel. Fix and let . Let be independent random variables such that Let and let , . Then
[TABLE]
The following is a discrete version of Gronwallβs lemma.
Lemma A.3
- (a)
Let be non-negative sequences. Suppose that
[TABLE]
Then
[TABLE] 2. (b)
For any and be a nonnegative sequence of elements, then for all
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Emmanuel Boissard, Thibaut Le Gouic, et al. On the mean speed of convergence of empirical and occupation measures in wasserstein distance. Annales de lβInstitut Henri PoincarΓ©, ProbabilitΓ©s et Statistiques , 50(2):539β563, 2014.
- 2[2] FranΓ§ois Bolley, Arnaud Guillin, and CΓ©dric Villani. Quantitative concentration inequalities for empirical measures on non-compact spaces. Probability Theory and Related Fields , 137(3-4):541β593, 2007.
- 3[3] Amarjit Budhiraja, Pierre Del Moral, Sylvain Rubenthaler, et al. Discrete time markovian agents interacting through a potential. ESAIM: Probability and Statistics , 2011.
- 4[4] Amarjit Budhiraja and Wai-Tong Louis Fan. Uniform in time interacting particle approximations for nonlinear equations of patlak-keller-segel type. ar Xiv preprint ar Xiv:1604.08668 , 2016.
- 5[5] Amarjit Budhiraja and Abhishek Pal Majumder. Long time results for a weakly interacting particle system in discrete time. Stochastic Analysis and Applications , 33(3):429β463, 2015.
- 6[6] FranΓ§ois Caron, Pierre Del Moral, Arnaud Doucet, Michele Pace, et al. Particle approximations of a class of branching distribution flows arising in multi-target tracking. SIAM Journal on Control and Optimization , 49(4):1766β1792, 2011.
- 7[7] Giacomo Como and Fabio Fagnani. Scaling limits for continuous opinion dynamics systems. volume 21, pages 1537 β 1567. Institute of Mathematical Statistics, 2011.
- 8[8] Pierre Del Moral and Emmanuel Rio. Concentration inequalities for mean field particle models. The Annals of Applied Probability , 21(3):1017β1052, 2011.
