Mean field approximation of a heterogeneous population of plants in competition
Antonin Della Noce, Am\'elie Mathieu, Paul-Henry Courn\`ede

TL;DR
This paper develops a mean-field approximation for modeling large, heterogeneous plant populations in competition, simplifying complex interactions into a manageable mathematical framework with potential applications in ecological inference.
Contribution
It introduces a mean-field approach to analyze large heterogeneous populations with pairwise interactions, enabling simplified modeling and inference in ecological systems.
Findings
Mean-field approximation effectively models large plant populations.
Simulation using semi-Lagrangian scheme and Gaussian process regression.
Asymptotic independence of individuals in large populations.
Abstract
The processes of interplant competition within a field are still poorly understood. However, they explain a large part of the heterogeneity in a field and may have longer-term consequences, especially in mixed stands. Modeling can help to better understand these phenomena but requires simulating the interactions between different individuals. In the case of large populations, assessing the parameters of a heterogeneous population model from experimental data is intractable computationally. This paper investigates the mean-field approximation of large dynamical systems with random initial conditions and individual parameters, and with interaction being represented by pairwise potentials between individuals. Under this approximation, each individual is in interaction with an infinitely-crowded population, summarized by a probability measure, the mean-field limit distribution, being itself…
| 1 m | 1 m | ||
| 0.8 m | 1 day-1 | ||
| 0.1 day-1 | m | ||
| day-1 | 0.3 m | ||
| m | |||
| 0.1 day | |||
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
Topicsstochastic dynamics and bifurcation · Diffusion and Search Dynamics · Mathematical and Theoretical Epidemiology and Ecology Models
Mean field approximation of a heterogeneous population of plants in competition
Antonin Della Noce Corresponding author : [email protected] Laboratoire MICS, CentraleSupélec, Université Paris-Saclay, 91190, Gif sur Yvette, France
Amélie Mathieu
INRA AgroPariTech, Route de la Ferme, 78850, Thiverval-Grignon, France
Paul-Henry Cournède
Laboratoire MICS, CentraleSupélec, Université Paris-Saclay, 91190, Gif sur Yvette, France
Abstract
The processes of interplant competition within a field are still poorly understood. However, they explain a large part of the heterogeneity in a field and may have longer-term consequences, especially in mixed stands. Modeling can help to better understand these phenomena but requires simulating the interactions between different individuals. In the case of large populations, assessing the parameters of a heterogeneous population model from experimental data is intractable computationally. This paper investigates the mean-field approximation of large dynamical systems with random initial conditions and individual parameters, and with interaction being represented by pairwise potentials between individuals. Under this approximation, each individual is in interaction with an infinitely-crowded population, summarized by a probability measure, the mean-field limit distribution, being itself the weak solution of a non-linear hyperbolic partial differential equation. In particular, the phenomenon of chaos propagation implies that the individuals are independent asymptotically when the size of the population tends towards infinity. This result provides perspectives for a possible simplification of the inference problem. The simulation of the mean-field distribution, consisting in a semi-Lagrangian scheme with an interpolation step using Gaussian process regression, is illustrated for a heterogeneous population model representing plants in competition for light.
1 Introduction
The interest for modelling heterogeneous populations of plants is on the rise, especially due to the development of the practice of mixed cropping (Malézieux et al. [2009]). Mixing different varieties or different species (Tang et al. [2018]) may have various advantages, such as nitrogen transfer from one species to another, resistance of the population to disease and pests (Gurr et al. [2003]), or enhanced production quality (Gooding et al. [2007] for wheat). However, up to our knowledge, very few models are made to understand the emerging properties of such mixture and to design optimal crops (cf. Gaudio et al. [2019] for a review). A convenient framework for modelling heterogeneous populations is hierarchical modelling, also known as mixed-effects modelling (Schneider et al. [2006], Lv et al. [2008], Baey et al. [2016]). A classical formulation of hierarchical model of a population dynamics can be represented as a dynamical system, whose initial conditions and parameters are independent and identically distributed random variables.
[TABLE]
is the number of individuals in the population. Each individual is indexed by integer and is described by a state variable and individual parameter . The state variable represents time-varying features of the plant, e.g. the size of its aerial part, the total leaf area, etc. The individual parameter represents intrinsic characteristics of individual , that are assumed to be constant throughout the considered time period, and that have influence on the population dynamics. is a function modelling the influence of the whole population, consisting in the collection , on the individual development of each plant. A specific form of is going to be studied in the present article (see equation (2)). The heterogeneity of the population is represented by the probability measure , that distributes the initial state variable and individual parameter to each individual at the population level. If the marginal distribution of variable , , is not reduced to a Dirac distribution, or equivalently if is not constant over the population, then the population is said to be heterogeneous, as it gathers individuals with different characteristics. The case of homogeneous population has been investigated for example in Cournède et al. [2007], Sievänen et al. [2008] focusing on the competition between plants.
The problem of statistical inference on such population model consists in identifying distribution and function from collected observation data. In the case where the plants do not interact with each other, various forms of Expectation - Maximization (EM) algorithm, introduced by Dempster et al. [1977], can be applied to estimate the parameters (Baey et al. [2016]),Baey et al. [2018], or direct Bayesian inference (Viaud [2018], chapter 4). Most common forms of EM algorithm and of direct Bayesian inference require a random exploration of the unknown parameter space using Metropolis-Hasting (MH) algorithm, or Metropolis-Hasting within Gibbs (MHWG) algorithmn, which are not suited for the exploration of high-dimensional space in terms of convergence time (Katafygiotis and Zuev [2008]). Nevertheless, EM algorithm or MHWG algorithm remain efficient tools for parameter estimation in a population model without interaction.
The relative effectiveness of these algorithms is challenged when taking into account interactions within the population model. The correlations between individuals hinder the distribution of the computation and the search space where MH algorithm is applied is of too high dimension, proportional to the number of individuals (cf. the computational issue encountered in Schneider et al. [2006]). The aim of this research is to suggest other methods more suited to this problem.
A possible research direction is given by variational Bayesian approximation (cf. Bishop [2006], chapter 10, for an introduction). This method consists in projecting the joint distribution of the random variables , which is non-factorized due to individuals interaction, onto a tensor product of parametric distributions. For specific expression of the function , such as the interaction function used in the Cucker-Smale model (Cucker and Smale [2007], Carrillo et al. [2010]), any subset of the the population has a joint distribution asymptotically factorized as , a phenomenon referred as chaos propagation in the literature (Bolley et al. [2011]). Qualitatively, when the population is infinite, the states at time and parameters of the individuals behave as if they were independent random variables distributed according to a single probability measure , that is called the mean field limit (MFL) distribution.
The question on how to integrate the MFL distribution into the process of statistical inference is beyond the scope of this article. The first step is to check for which kind of heterogeneous population models we can obtain theoretical existence and uniqueness of MFL distribution, along with asymptotic factorization property. We have considered plant population models for which the interaction function can be decomposed as a sum of elementary interaction functions over the whole population.
[TABLE]
Such formulation is used in Schneider et al. [2006], Lv et al. [2008], Nakagawa et al. [2015]. These models focus on the competition for light within the plant population. Schneider et al. [2006] suggests various models coupling plant development and competition. Amongst the models being smooth enough, we have chosen the one with the most statistical relevance. This model is described in section 2. Equation (2) is quite close in its formulation to particle systems studied in kinetic equation theory (Carrillo et al. [2010]). The normalization by the size of the population is important for the study of the asymptotic behavior of the population as tends towards infinity. The derivative of an individual state remains of the same order of magnitude when the size of the population changes. In our case, this normalization is part of the model expression, but for other systems (such as the ones studied in statistical physics), this normalization can be interpreted as a change of time scale (Golse [2013a]). Other normalization can be considered in some flocking model, like Vicsek model (Vicsek et al. [1995], Degond [2018]) where the velocity is normalized by the sum of all the velocities in the population. We shall specify in the next section the assumptions to be made on and on to derive the MFL distribution. We give also an example of plant competition model from Schneider et al. [2006] to illustrate the theoretical development in section 3 to prove existence and uniqueness of MFL distribution, and finally chaos propagation. As our initial aim is to be able to use the MFL distribution for statistical inference, we present a preliminary work in section 4 to approximate this distribution.
2 Example and assumptions
2.1 Working assumptions and notations
In this subsection, we specify our assumptions on the systems (1). Let be a probability space. Let be an Euclidean space of dimension and be a compact subset of an Euclidean space, such that the dimension of is . The phase space is denoted by and the set of probability measures defined over is denoted by . The set of probability measures is associated to the space of random variables, i.e. the space of functions measurable for the measure . is often endowed with the Lebesgue measure, denoted by (). Unless otherwise stated, the metric used on is defined by
[TABLE]
where is a reference vector with components all non-zero, and is the absolute norm over . The norm is therefore a dimensionless quantity. Similarly, we use the notation and . We consider the population model of initial distribution a probability measure over and of interaction function .
[TABLE]
We shall use two notations for the interaction function : either , either . Here are some assumptions on the smoothness of function .
(A1) Assumption 1 :
There exists such that for all and all . This assumption makes possible the existence of global solution over .
(A2) Assumption 2 :
There exists such that for all and we have
[TABLE]
(A3) Assumption 3
: The transition function has a partial derivative with respect to the variable , , which is continuous and which is such that there exists
[TABLE]
(A4) Assumption 4
: There exists a constant such that for all and 111As is not a vector space, we can have not belonging to . The notation has therefore to be understood as the norm of the vector in the Euclidean space containing the compact subset .
[TABLE]
The next subsection gives an example of differential system, where the interaction function satisfies all four assumptions listed above.
2.2 Example of Schneider model
The article of Schneider et al. [2006] studies a population of plants (Arabidopsis thaliana) in competition for light resources. A dozen of models, more or less empirical, are suggested in this paper to represent the growth of the aerial part of plants subject to the shade of its surroundings, and all these models are compared statistically against experimental data. A similar approach is carried out in Nakagawa et al. [2015] at the scale of a whole forest, observed for several decades. The population was then assumed to be homogeneous, certainly because of the computational issues previously mentioned.
In this model, the soil and water resources are assumed to be in abundance, so that the competition concerned only the light resource. Therefore, only the aerial part222In the case of A. thaliana, can be the diameter of the rosette (see figure 1) of the plant is represented by the model. A plant is described by the size of its aerial part , its position in the plane, and by two intrinsic factors and , determining properties of the individual growth. Over the time, only plants’ sizes change. The assumptions of the model are the following :
If the plant grows in isolation, or if the influence of competitors can be neglected, the dynamics of its growth is given by a Gompertz function (Paine et al. [2012]).
[TABLE]
The size of the plant converges towards an equilibrium size with rate . In a more accurate modelling, this equilibrium size should be a function of the environmental conditions, but they are not taken into account here (the light environment is assumed to be controlled). The initial size of the plant can be thought as the size of the sprout just after emergence. 2. 2.
If the plant grows in presence of competitors, in a population consisting of individuals, the equilibrium size of the individual is perturbed by a factor representing the negative impact of the competition.
[TABLE]
where with being known positive constants and such that .
In presence of competition, the available light environment of plant , represented by the term , is reduced by a competition factor , which is dimensionless and takes values in . The competition exerted on plant is all the more important than other plants are
tall in absolute terms, with the factor 2. 2.
taller than plant , with the factor 3. 3.
close to plant , with the factor
There exist more realistic and complex models to represent competition for light in plants population. Beyer et al. [2015] describes tree crowns development by a transport equation on foliage density. In this model, light ressource is allocated to the different individuals proportionally to their foliage volume. More mechanistic models can be found in the literature, namely the ones making use of Functional Structural Plant Models (FSPM), where the light environment is directly computed by ray tracing through a 3D reconstruction of the canopy (Cieslak et al. [2008]). Such models of competition are still too complex for the method we describe in this article.
Before going any further, we need to prove that system (9) is well-posed for any initial condition.
Proposition 1**.**
Let us consider the initial conditions and the collection of parameters . Then the system (9) has an unique solution defined over taking positive values, i.e. verifying .
The existence of the solution of this system is a classical application of Cauchy-Lipschitz theorem to the system satisfied by the vector . Details of the proof can be found in appendix 6.1. We need also to check for which conditions the global solution given by proposition 1 is consistent with the biological assumptions of the model. A solution is consistent with the assumptions of the model if it meets the following constraints :
- •
The size of each individual must remain below its equilibrium size and above the minimal size , i.e. for all .
- •
The competition factor must remain in , i.e. for all , .
These conditions can be met if we set some conditions on the support of the initial distribution . The next proposition gives sufficient conditions on the support of for these constraints to be verified.
Proposition 2**.**
Let . Let be a probability over , i.e. , such that the support of is included in the interior of domain . Let be a random variable of distribution and the solution of system (9) with initial configuration . Then we have almost surely that for all time , , the interior of domain .
The proof of this proposition can be found in appendix 6.2. It is based on the fact that within domain , the evolution of each plant size is bounded between two growth rates, ensuring the size to remain within a biologically consistent interval.
[TABLE]
The trajectories associated respectively to the upper and the lower bound remain within the domain when the initial condition is generated by a satisfying the assumptions of proposition 2.
For the sake of clarity, we give also an example of initial distribution , that is the source of heterogeneity and randomness in the system represented by equation (9). Let be a random variable of distribution . We have chosen the distribution such that the positions of plants are mutually independent, but with a spatial pattern on parameters and . In what follows, is the notation for the uniform distribution over the segment .
[TABLE]
This initial distribution implies that the plants are evenly distributed over the square , that the plants with large values of are likely to be tall, and the ones with high values of are likely to grow fast. In this example, the initial distribution is not absolutely continuous with respect to the Lebesgue measure. However, the marginal distribution of the intrisic parameters is absolutely continous with respect to , the Lebesgue measure over . Let be the density of .
[TABLE]
We can therefore simulate the population model by first drawing samples from the distribution , and finally by solving the differential system (9) using standard numerical methods. In our case, we have used a simple Euler explicit method with a time step of day. The following table gives the configuration used for the simulation.
A visualization of the impact of competition on plant growth is presented in figure 2. Depending on its position and on its intrisic parameters and , the response of a plant to competition with the rest of the population can varie significantly. In the middle of the domain , a plant is more subject to competition than a plant at the boundary, since it is surrounded by more competitors. The evolution of the size over the time depends also on the number of individuals. We can notice that the responses are quite different from to , but there are very little changes from to . This convergence constitutes a first visualization of the MFL distribution : as increases, the finite sample of competitors behaves more and more as a deterministic continuum. The next section gives a formal proof of this statement.
We can consider the change of variable , so that the state variable lies in the vector space , and . This change of variable is also applied to the initial distribution , so that the marginal initial distribution of the state is for now on related to variable . The parameter space can be chosen as . The reference vector to define a norm over can be chosen as .
[TABLE]
The interaction function has the expression of function defined in equation (38). Over , all four assumptions are satisfied by function . Possible choices of constants are given below.
[TABLE]
3 Derivation of the mean-field limit
This section follows similar steps as in Golse [2013a] to establish the MFL distribution associated to system (4). We start by proving that system (4) implies a transport equation verified by the empirical measure of the population. From this transport equation, we derive the expression of the MFL transport equation monitoring the dynamics of the MFL distribution. Finally, the connection between the two transport equations is given by Dobrushin stability, which implies also chaos propagation.
3.1 Properties of the population empirical measure
The system (4) has an unique global solution if the interaction function satisfies assumptions (A1) and (A2). Let be an initial configuration of the system (4). We introduce the global solution of the system. The empirical measure of the population is defined as the map
[TABLE]
In the above equation, we use the notation is the Dirac distribution centered at , i.e. the distribution of the random variable which is almost surely constant equal to . The empirical measure of the population is a dynamical probability distribution. Sampling this distribution at a fixed time corresponds to choose an individual uniformly over the population (with probability ). Interestingly, the empirical measure describes exhaustively the dynamics of the whole population, while remaining in a space , which does not depend of the population size . However, there is a loss of information from vector , where all individuals are labelled by indices in , to the measure where all individuals are not distinguishable. In other words, a visualization of vector in the phase space would be a cloud of points with all different colors, whereas a visualization of would be the same cloud of points with a single color. This indistinction of the individuals is a first step towards the mean-field limit, where individuals are punctual parts of a continuum.
Let us characterize the dynamics of using the system (4). We observe the dynamics of a probability measure through its action on test functions, which in our case is the functional space .
[TABLE]
In particular, the test functions considered in this article are bounded over their domain, and have bounded derivatives. We call action of on a test function the dual pairing of and or the expectaction of random variable where is a random variable of distribution .
[TABLE]
The time evolution of can be studied by considering the differential equation satisfied by for any test function . So let us express the derivative as an action of on some function depending on and on the interaction function .
[TABLE]
[TABLE]
In the above equation, we can interpret the term
[TABLE]
as the velocity field associated to the system (4), i.e. the one assigning to each individual its velocity according to the current state of the whole population333Similar developments can be found in Carrillo et al. [2010]. is said to be a non-local velocity field, because it depends on the probability measure describing the state of the population, in this case. The velocity field can be associated to a conservative transport equation, having a formulation quite similar, in its principle at least, to Vlasov equations, where the velocity field depends on the unknown density (see Golse [2003], section 1.1.1).
[TABLE]
where is the divergence operator with respect to state variable , i.e. for any continuously differentiable map , , and is the probability measure of density . The equation (17) is a weak formulation of equation (19), which is formally defined in definition 2. As the weak formulation deals with trajectories taking values in the space of probability measures, we need to introduce the Wasserstein distance to quantify the regularity of these trajectories.
Definition 1**.**
Let . Let the set of couplings of and , i.e. the set of probability distributions having its first and second marginals equal to and respectively.
[TABLE]
The Wasserstein distance of first order between and is defined by
[TABLE]
or, equivalently, the Wasserstein distance of first order has a dual representation (Kantorovich and Rubinstein [1958])
[TABLE]
with being the space of Lipschitz-continuous functions over , taking values in , and being the Lipschitz constant of .
Definition 2**.**
Let a non-local velocity field and a probability measure having first order moment, i.e. . We say that the trajectory is a measure solution of the transport equation of velocity field and of initial condition if
the trajectory is continuous for the metric . 2. 2.
for all test function , for all time
[TABLE]
Proposition 3**.**
Let satisfying assumptions (A1) and (A2) and . Then the empirical measure , defined in equation (14) is a measure solution to the transport equation of velocity field , defined in equation (18), and of initial condition .
This proposition summarizes the equation (17). It is also necessary to check the continuity of the trajectory is continuous for the metric . This continuity is directly given by the continuity of the solution of the system (4) (see appendix section 7).
The transport equation (17) satisfied by the empirical measure leads to the transport equation describing the dynamics of the population with an infinite number of individuals by taking the limit . The resulting equation, obtained informally, is referred as the MFL transport equation, and its eventual solution is the MFL distribution. Subsection 3.2 solves the MFL transport equation and proves the existence and uniqueness of the MFL distribution for system (4). Subsection 3.3 studies different aspects of the convergence towards the MFL distribution.
3.2 Study of the mean-field equation
This subsection gives a characterization of the MFL distribution as the unique solution of a non-local transport equation obtained as the limite case of transport equation (17). Let us assume informally that, for some metric over the space of probability measures (namely the Wasserstein distance, see subsection 3.3), the empirical measure has a limit when . Then it is reasonable to think that, for some other metric, the velocity field converges towards a velocity field depending on and . The only expression this velocity field can reasonably have, when in equation (18), is
[TABLE]
So if the MFL distribution exists, it has to be a measure solution of the transport equation of velocity field and of initial condition , as it is reminded in subsection 3.3 that converges towards for the Wasserstein distance. The MFL distribution is therefore an eventual trajectory , continuous for the metric , such that for all test function and for all time
[TABLE]
Drawing largely on Golse [2013a], we would like to use the characteristic flow method to prove the existence and uniqueness of the solution to the equation (23). The characteristic flow method is a classical idea to study a transport equation : the transport PDE describes the dynamics, while the characteristic flow equation describes the motion of a single particle, subject to the same velocity field. Let be the trajectory of a particle immersed in velocity field , of initial configuration .
[TABLE]
As is unknown, we cannot evaluate the derivative , except at , when . However, there is a strong connection between the MFL distribution and the flow , as describes the state of a population which is composed of infinite number of particles , whose initial configuration is given by . In other words, we can look at the interaction with the rest of the population not as an average over all the possible states at time , as it is the case in equation (24), but as an average over all initial configurations.
[TABLE]
There is only a single unknown in the above functional equation, which is the flow . The next theorem shows that this characteristic flow is well defined.
Theorem 1**.**
Let a probability measure having second order moment, i.e. , and satisfying assumptions (A1) and (A2). Then there exists an unique flow such that
** 2. 2.
* is continuously differentiable.* 3. 3.
,
[TABLE]
The above functional equation can be seen as a continuous version of system (4). Formally, this equation is a differential equation with an initial condition being a probability measure and having trajectories in vector space . This theorem can therefore be proved by following exactly the same steps as for Cauchy-Lipschitz theorem with traditional differential equations. A common proof of Cauchy-Lipschitz theorem is based on fixed point theorem within a functional Banach space. The functional space where the flow solution lies must be complete, as the fixed point theorem recquires the convergence of any Cauchy sequence. The next lemma introduces the functional space used in the proof of theorem 1.
Lemma 1**.**
(Golse [2013a]) Let be the functional space defined by
[TABLE]
Then is a Banach space for the metric .
The proof of the above theorem is given in appendix 8.1, and it follows the same steps than the proof of Cauchy-Lipschitz theorem for ordinary differential equations: local existence and uniqueness, existence of a maximal solution, uniqueness of the maximal solution and finally definition over of the maximal solution. The assumption (A1) on is important to ensure that the flow solution is defined over and also the stability within the functional space . Besides, the control of the Lipschitz factor in assumption (A2) can be relaxed, as long as the Lipschitz factor is compensated by the initial distribution. For instance, if the Lipschitz factor in (A2) is for some instead of , then similar reasoning can be carried out to obtain the existence and uniqueness of , if is chosen in , i.e. such that .
In the case of Schneider model, the flow solution satisfies the following equation
[TABLE]
If is the distribution defined in equation (10), we have for all time and for all ,
[TABLE]
where . This relation holds because the marginal distribution of the initial state is a Dirac distribution centered at .
The characteristic flow (26) leads to the unique solution of the mean-field transport equation (23), which appears as the pushforward probability measure of the initial distribution by the map . This result is used qualitatively to derive equation (26) from equation (24).
Corollary 1**.**
Let , g satisfying assumptions (A1), (A2) and (A3), and a random variable of distribution . Then the unique measure-solution to the transport equation (23) is where for all , is the probability distribution of .
The proof of this corollary (appendix, section 8.2) is a generalization of the method of characteristic flows, classically used in the field of hyperbolic PDE. The proof that the pushforward measure is effectively a measure solution of the mean-field transport equation (23) is mainly based on the change-of-variable formula, stating that for every test function , we have . The continuity of the trajectory is therefore implied by the continuity of . Besides, the proof of uniqueness requires additional assumptions on the regularity of the interaction function , namely assumption (A3). It was added for the sake of brevity, but it seems that this assumption can be avoided by adding technical developments using an argument of density of the space of test functions. This regularity enables to prove that the flows associated to the velocity field , where is a fixed measure-trajectory, are continuously differentiable with respect to their arguments. This implies also the regularity of the solution to the following transport equation
[TABLE]
As is regular, it can be used as a test function itself. If is a measure-solution of (23), it can be shown that is constant. This implies in particular that is the pushforward measure of by the map . It follows that and satisfies the same equation (26) and we conclude by uniqueness of the characteristic flow provided by theorem 1.
Alternative proofs of existence and uniqueness of the MFL distribution can be found in Lagoutière and Vauchelet [2017] or in Bolley et al. [2011], with weaker assumptions made on the velocity field. Lagoutière and Vauchelet [2017] uses Filipov characteristics and compactness arguments to solve the transport equation associated to a bounded velocity field with a finite set of discontinuities. The velocity field considered in Bolley et al. [2011] is not globally Lipschitz continuous, as in our case. The resolution of an equation similar to (24) follows an iterative procedure : the measure trajectory is fixed at iteration , and is used to compute the characteristic flow , by solving a standard differential equation ; the distribution chosen at the next iteration is the pushforward measure of by the characteristic flow .
Let us now consider the case where the initial distribution is absolutely continuous with respect to the Lebesgue measure . We denote by its associated probability density. can be factorized in two terms using the chain rule.
[TABLE]
It follows from proposition 4 that, in this case, the MFL distribution is absolutely continuous for all time , and that the associated density is given by change-of-variable formula.
[TABLE]
In the above equation, for all and , is the inverse function of and is the Jacobian matrix of this function.
The fact that is a one-to-one map from to is a consequence of the flow property. This property considers a variation of the initial time in equation (26). There exists an unique map satisfying
[TABLE]
By unicity, we have that for all and , . It follows that . The differentiability of the map is a consequence of assumption (A3).
In the case of Schneider model, the MFL distribution is the law of the random variable with . Therefore is entirely determined by the map . This is due to the fact that the initial state is constant over the whole population, equal to . We can notice that this situation seems much simpler than the case where the marginal density of the initial state is absolutely continuous : here, we only need to compute the characteristic flow , and we do not need to compute its inverse function and its derivative. Section 4 describes a methodology to approximate the characterstic flow and therefore to sample the MFL distribution in the specific case of Schneider model.
3.3 Dobrushin stability and propagation of chaos
The relation between the microscopic level, represented by the empirical measure of the population, and the mean-field level, represented by solution of (23), is mainly based on a convergence of the initial empirical distribution towards the initial distribution as N and on the fact that this results can be extended at all time , i.e. the same type of convergence is verified by towards . The convergence discussed here is the one associated to the metric , whose expression is recalled in definition 1, and which metrizes the weak convergence in the space of probability distribution (see corollary 6.13 in Villani [2008]). According to Varadarajan [1958], if is a sequence of independent random variables of distribution , and if for all , we have that almost surely in . This means that there exists such that and for all , we have for all any Lipschitz continuous function that
[TABLE]
A concise proof of this result can also be found in Golse [2013a] (theorem 3.3.5). This result is a consequence of the strong law of large numbers and of the fact that the space of continuous functions with compact support over is separable. The rate of convergence of the random variable , along with Wasserstein distance of higher orders, is a well-documented topic in the literature. Dudley [1969] stated that in the case where is absolutely continuous with respect to the Lebesgue measure, i.e. can be associated to a probability density , and if , then there exists a constant such that for all , . In the example of the Schneider model, the chosen initial density described in equation (10) is not absolutely continuous with respect to the Lebesgue measure over , since the marginal distribution of the variable is reduced to a Dirac distribution , representing the fact hat all plants have the same size initially. However, the marginal of variable is associated to a density over , so the upper-bound of Dudley can be rewritten as . Faster convergence rates can be obtained in the case where probability measure is less regular. We can quote notably Weed and Bach [2017] in the case where is compactly-supported, and Lei [2018] for a generalization to unbounded metric spaces.
If the random variable has at least one of its component with a probability density, then the weak and almost sure convergence of towards means visually that the point cloud is more and more alike the continuous set represented by measure . In what follows, the argument of Dobrushin stability (see proposition 4 in Dobrushin [1979] or theorem 3.3.3 in Golse [2013a]) is used to prove that for all time almost surely.
Theorem 2**.**
Let be a probability measure having a compact support, such that the support is included in for some . Let be a sequence of independent random variables of distribution and . There exists such that and such that . We introduce the solution of problem (23) for an interaction function satisfying assumptions (A1), (A2), (A3) and (A4). Then we have
[TABLE]
The argument of Dobrushin consists in deriving an upper bound of depending on , which holds for all initial configuration . The derivation of the upper bound is exactly a generalization of Grönwall lemma to characteristic flows of the type of , i.e. solutions of differential equations taking values in space and having as initial condition a probability measure over . Indeed, we can prove that for all initial configuration , we have
[TABLE]
The functions and appearing in the previous inequality depend on the first and second moments and of the distribution . The other functions appearing in the inequality (32) are such that .
Historically, Dobrushin [1979] introduced this methodology to obtain uniqueness results on solutions of Vlasov equations. In this article, the studied interaction functions are globally Lipschitz continuous, and the author does not resort to Grönwall lemma. With the same assumptions, a proof of Dobrushin stability was suggested by Golse [2013a], theorem 1.4.3, making clear use of Grönwall lemma. In Lagoutière and Vauchelet [2017], the proposition 1 gives a quite similar contraction estimate, in the case where the transition function is expressed as a convolution product with the mean-field limit measure. In all aforementionned works, the transport functions at microscopic level have the same expression as the transport function at macroscopic level, and the physical models do not recquire to exclude the interaction of a particle with itself, notably thanks to a property of anti-symmetry of the underlying potential. In our case, the transition function is only assumed to be locally Lipschitz continuous, but this difficulty is bypassed by assuming that the i-nitial distribution has a compact support. The obtained upper-bound of in (32) is a much faster increasing function than in Golse [2013a]. The assumption on global Lipschitz continuity of the function leads to a factor of order for some constant , whereas the assumptions on quadratic variations of the functions, namely (A2) and (A4), leads to a factor of order for some constant , because of two subsequent applications of Grönwall lemma (see the proof in appendix 9.2). Needless to say that the upper bound in (32) seems far from being optimal.
The next corollary uses the argument of Dobrushin stability to show the relation between the solution of the microscopic system (4) and the MFL characteristic flow.
Corollary 2**.**
With the same assumptions as in theorem 31, we consider the sequence of random variables independent and of distribution . For all , we define the initial configuration of the system (4) and the solution of the system (4). Then we have
[TABLE]
The above results provides a more visual intuition of the asymptotic link between the microscopic level of system (4) and the mean-field limit. The trajectories obtained by solving system (4) are more and more alike the trajectories given by the MFL characteristic flow . A generalization to any sub-group of fixed size within the population can also be obtained. Indeed, for and for , any sub-group of size , with being distinct integers in , has the same distribution as by symmetry. According to the previous corollary, the almost sure convergence for a single individual can be generalized to any sub-group of size .
[TABLE]
The limit distribution of the sequence of random variables is factorized and is exactly , as . For finite and for , the random variables are strongly interdependent. At the limit , the individuals are independent. More accurately, if one focuses on a finite group of individuals, while the rest of the population is increasing towards infinity, then these observed individuals have independent trajectories in the probabilistic sense. Their distribution is said to be asymptotically factorized. An alternative proof of the phenomenon of chaos propagation is given in Golse [2013b], section 1.6. This proof is based on a characterization of asymptotically factorized sequence of probability measures (see theorem 1.6.2 in Golse [2013b]).
The phenomenon of chaos propagation may have applications for statistical inference, paving the way for methodologies based on variational Bayes approximation. Let us consider the following example : we aim at studying the dynamics of an heterogeneous crop from the observation of the growth of few dozens of plants. Their growth is assumed to be well represented by a model of the form of Schneider et al. [2006], but some parameters of the interaction function are unknown. In general, we do not know accurately the exact number of individuals in the population, but we know that is much larger than the number of observed individuals. In a Bayesian setting, i.e. when we want to compare prior knowledge and assumptions with field observations, the resulting inference problem is of great difficulty. Among other things, it requires to determine the posterior distribution of the number of individuals in the population444A possible prior for the random variable would be a Poisson distribution., but also the posterior distributions of all the unobserved individuals, i.e. of their positions and of their characteristics and . This is clearly intractable for a population having the dimension of a crop. Otherwise, if we make the approximation that the observed individuals are in interaction with an infinity of individuals, which is quite a relevant approximation after all, and that this continuum of individuals is represented by the MFL distribution , then the inference problem is significantly simplified : the observed individuals are then mutually independent, and there is no need to extract the information of all the unobserved individuals. Of course, the difficulty is elsewhere : how to simulate the MFL distribution efficiently, so that it can be used within a statistical inference process. The next section gives a first attempt to answer this issue.
4 Simulation of the MFL distribution using Gaussian process regression
In this section, we present a preliminary work on the numerical approximation of the MFL distribution , which is defined as the measure-solution of variational problem (23). So it boils down to solve numerically a hyperbolic PDE with non-local velocity. The simulation of solutions of kinetic equations is a well-documented in the literature. Amongst others, we can quote the upwind scheme introduced by Lagoutière and Vauchelet [2017], which consists in a reconstruction of the solution using finite volumes. The reconstruction is piecewise constant over a discretization of the phase space . In the case of Schneider heterogeneous population model, the space is of dimension higher than 3, and this makes the discretization of the space a too expensive task on the computational view point. This constraint of the dimension leads rather towards mesh-free methods.
The method suggested here consists in approximating by regression a consistent sequence of reconstructions of the exact characteristic flow. It is therefore a semi-Lagrangian method with an interpolation step. The family of functions used for the interpolation is defined from the interaction function , and takes the form of linear combinations of reproducing kernels. The proof of the consistency of the scheme is an on-going work. However, some numerical tests seems to confirm that this approach is relevant.
For the sake of simplicity, the method is presented through the simulation of the Schneider model. In this case, the MFL distribution is the law of the random variable , where is a constant, where is defined in equation (10), and is the characteristic flow defined by equation (29). By change of variable, we can consider the characteristic flow associated to the size variable , which is defined as the solution of the equation
[TABLE]
So our aim is to approximate the function .
A direct resolution of equation (33) using an explicit Euler method, with time discretization , chosen small enough, would lead to a sequence of functions defined an induction equation.
[TABLE]
This sequence of functions cannot be computed exactly, as the integral is not analytical. This integral is in fact an expectation with respect to the density . Let be sample of the distribution of density . We consider the sequence of functions defined as the empirical approximation of the sequence using the sample .
[TABLE]
It is quite straightforward to prove that for any fixed , the sequence is an almost sure approximation of the characteristic flow at time .
[TABLE]
Indeed, the sequence of functions is stochastic because of its dependency with respect to the sample . The above convergence is mainly based on the law of large numbers, enabling to prove a uniform almost sure convergence over the space . So constitutes a simple approximation of the characteristic flow, but it has some limitations. It can only give a local estimation of the function . Indeed, to compute at a given point , then it requires the computation of , and in turn the computation of , etc… We cannot know the values of the function outside of the set of points we have decided to observe a priori, from the very initial time , this set of observation points including also the sample . For a global approximation of the function , a grid covering the whole space has to be build, so this boils down exactly to the construction of a mesh, which is to be avoided in our case. An interpolation method is used at this point so that the local information given by some values of could be extended to the whole space .
The basis of functions used for interpolation has been chosen from a qualitative estimation of the correlation between the values of the function . According to central limit theorem, the asymptotic covariance matrix of the random variables and for and in when depends on the interaction .
[TABLE]
is the normal distribution of mean and of covariance matrix . In other words, the random vector behaves approximately like a Gaussian vector. From this result, we make the approximation that this property holds for all 555this approximation may not be justified theoretically..
[TABLE]
This reasonable expression of the covariance leads to a choice of interpolation functions being defined from the covariance function, which is by construction a positive kernel.
[TABLE]
This kernel cannot be used per se as the sequence is unknown. Another kernel is therefore chosen, but still largely inspired from the above expression. As the sequence , they are replaced in the above expression by parametric functions that reproduce roughly their variations over the space . More specifically, polynomial functions of degree 2 were chosen to approximate the sequence .
[TABLE]
where is the canonical bijection between the square matrices and the vector of 16 components. The coefficients are chosen so that the parametric function is close to function is the sense.
[TABLE]
Equivalently, is the solution of a linear system expressed with expectations with respect to the density .
[TABLE]
In this linear system, the functions can be replaced by their stochastic approximations , and the theoretical mean can be replaced by an empirical mean over the set .
The final expression for the kernel used for the interpolation depends on the sample .
[TABLE]
The theoretical covariance is replaced by an empirical covariance over the sample and the characteristic flows are replaced by either the polynomial functions either the stochastic approximation . If the parametric model is not too rough and if is large, then the above covariance function is consistent with the stochastic behaviour of , and is easy to evaluate over the whole space.
In addition to the values , the function is evaluated over another set of points , called training set, that can also be taken as a sample from the density . For all , we extend the values of by making the approximation that the values of is a Gaussian process of mean function and of covariance function (cf. Rasmussen [2004] for an introduction to Gaussian processes). In particular, under this approximation, for all
[TABLE]
The distribution of is given by conditioning with respect to the observed, or rather computed, values of .
[TABLE]
Therefore, under this approximation, the most probable value of knowing the values of is given by the mode of the above conditional distribution. This is the reconstruction of the characteristic flow we use to estimate it over the whole space .
[TABLE]
One can notice that more information could have been used to compute the conditional distribution, as we also know the values of . The reason why the sample is omitted is just that inverting a matrix of dimension is cheaper than inverting a matrix of dimension .
The relevancy of the reconstruction can be assessed using a test set , that can also be a sample drawn from density . A mean square error is used for this purpose.
[TABLE]
If remains relatively small during the iterations, then the reconstruction of is likely to be relevant.
The different steps of the simulation process are summarized in the following algorithm.
The algorithm was run with the parameters values given in table 1 and for iterations, with a sample size and size of training / reconstruction set of . Figure 3 displays the evolution of the test error of the reconstruction , along with the test error associated with the polynomial approximation .
Figure 3 shows that both the polynomial approximation and Gaussian process (GP) reconstruction seem to provide a good estimate of the function , with a relative remaining lower than for the polynomial approximation, and lower than for the GP reconstruction. The error made by the polynomial function increases almost linearly with the iterations, meaning that the shapes of the functions become more and more complex for large , and the approximation by parabolic functions become more and more rough. As a matter of fact, the GP reconstruction has also an increasing test error, but it still provides a significant improvement with respect to the polynomial approximation.
Once is computed, an approximate sample of the marginal distribution of random variable can be drawn. The sample is obtained by drawing independent samples from density and compute the values of the characteristic flow over this sample . For , the marginal distribution is absolutely continuous with respect to the Lebesgue measure , and the associated density can be estimated by non-parametric kernel regression. We define the associated density. Figure 4 illustrates the evolution of the marginal density of with the time.
In figure 4, we can observe the distribution of the sizes is in the beginning above the initial size : this is the first stage of the growth in the population, when all plants have their sizes increasing. This corresponds to the densities at times day and days. At some point, the competition becomes too important, mainly at the center of the domain and part of the plants decay, leading to the appearance of plant with sizes lower than at time days. Besides, the plants that keep on increasing are the ones that are located in close to the edge , which have faster growth rates and taller asymptotic sizes . These plants therefore their equilibrium size faster than in the rest domain, so that there are very little change between density at days and density at time days for the plants of size higher than . This result is consistent with the simulations of the differential system (9) displayed in figure 2.
A clearer visualization of the global behaviour of the MFL distribution can be made by computing the surface corresponding to the averaged size over the domain , i.e. the expectation , which is obtained by marginalizing growth parameters and .
[TABLE]
[TABLE]
where and are independent samples from the uniform distribution .
As expected, the surface has its maximal value at the point .The line does not change much from to , because plants along this line are already close to their equilibrium size (with competition) at , whereas the line has not converged yet for , due to its slower growth rate. As tends towards infinity, we can expect the surface to be more and more invariant by translation along axis.
5 Conclusion and perspectives
Heterogeneous population models can be approximated by the MFL distribution when the population is large enough and when the interaction function describing the dynamics satisfies a set of assumptions. The phenomenon of chaos propagation, implied by Dobrushin stability, seems to provide an interesting research direction to circumvent the problem of fully-correlated individuals, that arises when the inference of the model is carried out. The suggested methodology for the simulation of the MFL distribution gives promising results, although a theoretical analysis of its consistency still needs to be conducted (on-going work). Our next step is to apply the MFL approximation to real experimental data, to study the impact of competition on the development of plants in mixed stands.
The MFL distribution is appealing because of the property of chaos propagation. But it is clear that MFL approximation might not be relevant for populations having relatively small sizes, as it can be expected when looking at figure 2. A limit seems to be reached for , as there are very few changes in the dynamics above this threshold. For smaller however, the trajectory of a single individual is noisy, and the approximation of the population distribution by a factorized distribution might be too rough. In general terms, the critical size of the population is a function of the tolerance on some metric quantifying the discrepancy between the microscopic distribution and the MFL distribution, of the length of the time interval during which the system is observed and finally, of course, of the transition function 666An obvious example is given by a transition function having no dependency with respect to . In that case, the individuals defined by system 4 are in fact independent already, and the critical size is then for all . The metric, over which a tolerance is defined, has to be chosen according to the objectives of the inference. For instance, if our aim is to compute the posterior distribution of some parameter of the model given a set of observations, then we need to find an estimate of the discrepancy between the result that would be obtained by direct inference and the result obtained under MFL approximation. This task seems rather unfeasible, as both of these distributions are either too difficult to compute or simulated with a procedure having a yet uncontrolled error. The upper bound provided by Dobrushin stability in inequality (32) is far too rough to be used for the estimation of the critical size of the population .
For some systems however, MFL approximation is without doubt relevant. This is the case, for instance, for systems studied in statistical physics, systems that are constituted by a number of particles near or beyond the Avogadro constant (). Even in this favourable case, the use of MFL approximation within a process of Bayesian inference is not well set yet. It would require the coupling of a numerical scheme, similar to the one presented in the previous section, with a time-consuming MH or MHWG algorithms. In machine learning and signal processing literature (Marnissi et al. [2016]), the distribution of the variational Bayes approximation is mainly chosen for its conjugation property with the prior distribution. This often leads to analytical posterior distributions of the parameters, and it may spare a lot of computation time. In our case, our choice is motivated by the behaviour of the dynamical system when it becomes infinite. There is no chance that applying Bayes rule in this context might lead to known or tractable posterior distributions. The solution to this issue may consist in a trade-off between traditional variational Bayes techniques, that are efficient but biased by convenience-motivated choices, and the simulation of the MFL distribution associated to the system, which may require a significant amount of computation time but which is asymptotically unbiased.
This paper has focused on a quite specific class of interaction models, namely the ones that can be decomposed into a sum of pairwise potentials. In the case of more realistic plant models, such decomposition cannot be obtained. The competition is not considered as being additive, and does not even have a closed-form expression in some cases. The necessay complexity of these models leads to the question of the derivation of MFL distribution associated to more generic dynamical systems. In our case, the velocity field at the microscopic level has a linear dependency with respect to the population empirical measure . The convergence of towards a MFL velocity field may still be preserved when is only continuous with respect to for some Wasserstein metric. Such theoretical study, in a more general setting than the one presented in this paper, may enable to study the asymptotic behaviour of more realistic plant population models, incorporating not only competition but also beneficial interactions, which constitute the main interest of mixed cropping.
6 Proofs of the subsection 2.1
6.1 Proof of proposition 1
Proof.
Let us set . We use the notation . Let us consider the functions
[TABLE]
We set and the function
[TABLE]
For all and , we have
[TABLE]
We consider the following norm over , defined by , known as the norm 1. We have for all
[TABLE]
This inequality, along with the fact is a locally Lipschitz continuous map, proves that the differential system
[TABLE]
has an unique global solution defined over . Then the function is the unique solution of system (9). ∎
6.2 Proof of proposition 2
Proof.
We set . We consider the random intervall
[TABLE]
The intervall is almost surely an intervall not reduced to singleton , as is in almost surely and as is a continuous mapping. is therefore positive random variable almost surely. Let which is such that . Let . Then for all , we have for all
[TABLE]
According to Grönwall lemma, the latest inequalities lead to
[TABLE]
If , we can use inequalities (45) to obtain that . By continuity and by the fact that is a non-empty open set, we can find such that , which is in contradiction with the definition of . So . ∎
7 Proof of the subsection 3.1 : proposition 3
Proof.
We only have to check that the trajectory is continuous for the metric . Let a Lipschitz continuous function such that and let .
[TABLE]
It follows that is continuous for the metric , by continuity of the solution of the system (4). The other recquirement for to be a measure solution is given by equation (17). ∎
8 Proofs of the subsection 3.2
8.1 Proof of theorem 1
Proof.
(of theorem 1) Let us start by proving the local existence of functions satisfying the characteristic flow equation. Let . We introduce the following functional space endowed with the functional metric . is a Banach space for this metric. Over the functional space , we define the following map
[TABLE]
For all , . Let and . We have for all , for all and for all
[TABLE]
we set the first order moment, then
[TABLE]
So if we choose such that , i.e.
[TABLE]
we have that for all , .
Let . We have for all and for all
[TABLE]
[TABLE]
If is chosen such that , and such that it satisfies the inequality (47), i.e.
[TABLE]
then is a contractive map over . According to fixed-point theorem, there exists an unique such that , i.e. for all and , we have
[TABLE]
Let us prove now that any function satisfying the equation on a sub-interval of is the restriction of the previous function to this sub-interval. Without loss of generality, we work on sub-intervals of type with .
Let be such that
[TABLE]
We can then distinguish two cases :
Either . Then, by following the same reasoning as previously, is the unique fixed point of the map over the set . Since the restriction of to the interval is also a fixed point of , then we have that . 2. 2.
Either . Let us introduce the following time . Then necessarily, since . For all , we have, by deriving the same inequalities as in (46),
[TABLE]
By continuity, the previous inequality is also valid for . Since , we have that . By reinjecting this inequality in (48), we have in fact in that
[TABLE]
which is in contradiction with the definition of . So the current case 2 is absurd.
We can extend the following reasoning to any interval of containing 0. We define the following set of tuples
[TABLE]
This set is non-empty as it contains at least and all its restriction to sub-intervals. is partially ordered by the following relationship
[TABLE]
Let us consider the set of maximal elements of , i.e.
[TABLE]
We prove now that the set of maximal elements is reduced to a singleton.
Let be two maximal elements of . We consider and . Let us assume by contradiction that . If , we can exclude two cases :
If , then , so , leading to , which is a contradiction. So must be finite, . 2. 2.
If , i.e. the boundary of interval , then , and therefore , which is a contradiction. So under our assumptions, must be in the interior of the interval .
For all , we have , so by continuity . Let such that and such that , .
Let and
[TABLE]
The last inequality implies that for all , by Grönwall lemma, which is a contradiction with the definition of . So we have necessarily that . We can conduct the same reasoning to prove that is equal to . So the functions and coincide on . If , we could construct the following function
[TABLE]
Then we would have that and that and , which would be in contradiction with the maximality of . So and , and is reduced to a singleton.
Let us prove now that the unique maximal element is in fact defined over , i.e. . We consider . Let us assume by contradiction that . Then we have necessarily that . Otherwise, we could apply the same reasoning as for the local existence in the beginning of the proof, to the initial time and to the initial distribution the probability distribution of where is a random variable of distribution . So we would be able to extend the interval of definition , which would be in contradiction with the maximality of .
Let and , we have
[TABLE]
We use the last inequality to show that the derivative is bounded for all . Let ,
[TABLE]
So is finite, and exists. Then we can define the following function
[TABLE]
We have then that and that , which is in contradiction with the maximality of . So and the maximal element is defined over . ∎
8.2 proof of corollary 1
Lemma 2**.**
Let , satisfying assumptions (A1) and (A2), a random variable of distribution and the flow solution of equation (26). For all time , we denote by the distribution of the random variable . Then is a measure solution of the transport equation (23).
Proof.
Let be a Lipschitz continuous function such that , and .
[TABLE]
The continuity of for the metric is therefore implied by the continuity of for the metric . Let be a test function. For the initial time , is the distribution of , which is by definition. So we have
[TABLE]
is continuously differentiable and
[TABLE]
∎
Before proving that this measure-solution is in fact the unique one, we need to establish some auxiliary results.
Lemma 3**.**
Let and satisfying assumptions (A1) and (A2). Let be a trajectory in the space of probability measures continuous for the metric . Then there exists an unique flow to the (ordinary) differential equation
[TABLE]
where is non-local velocity field defined in equation (22).
Proof.
Let , ,
[TABLE]
It follows that for all , the map is globally Lipschitz continuous over the intervall , for any . The proof is concluded by Cauchy-Lipschitz theorem. ∎
The two following lemmas are classical results from dynamical systems theory and transport equations.
Lemma 4**.**
*(Golse [2013a], theorem 2.2.3)
Let such that and is defined and continuous over . We assume that there exists such that for all and for all , , and we consider the flow associated to the differential equation*
[TABLE]
Then the flow is continuously differentiable with respect to its three arguments, i.e. .
Lemma 5**.**
*(Golse [2013a], theorem 2.2.4)
Let and be such that and . We assume that for some there exists such that for all , . Then there exists an unique solution to the partial differential equation*
[TABLE]
The solution has the following expression
[TABLE]
where is the flow of equation (51).
Lemma 6**.**
Let , g satisfying assumptions (A1), (A2) and (A3), and a random variable of distribution . Then the unique measure-solution to the transport equation (23) is where for all , is the probability distribution of .
Proof.
Let be a measure solution to equation (23). Let us consider the flow associated to the differential equation (50). Thanks to assumption (A3), we have by Leibniz integral rule
[TABLE]
According to lemma 4, for all , the map is continuously differentiable with respect to and .
Let , i.e. continuously differentiable and such that . We consider the linear transport equation of unknown
[TABLE]
Then, using lemma 5, the unique solution of above equation is
[TABLE]
From previously, we have that . As is a measure solution, we can write for all time
[TABLE]
If we introduce for all time , a random variable of distribution , we can rewrite the above equation as . Let us introduce the random variable and its probability distribution. We have then
[TABLE]
Hence, as the last equality holds for any verifying , the distributions and are equal for all time . has the same distribution as the random variable and therefore for all and for all , we have
[TABLE]
By unicity of the characteristic flow, it follows that . ∎
9 Proofs of the subsection 3.3
9.1 Proof of lemma 7
Lemma 7**.**
Let and a transition function satisfying assumptions (A1), (A2). For any initial configuration of the population , with , there exists an unique function such that
[TABLE]
Let . We consider the velocity field , where is the non local velocity field defined in equation (18). Let and .
[TABLE]
So is locally Lipschitz continuous with respect to the variable . Besides, for any time and
[TABLE]
According to Cauchy-Lipschitz theorem, there exists an unique flow for the differential equation of velocity .
[TABLE]
Let be the trajectories solution of the system (4). For all , and . It follows by unicity that . We finally obtain that
[TABLE]
9.2 proof of theorem 31
For the simplicity of notations, we introduce the the map and the map . Let be a probability distribution in the set of couplings and let be a random variable of distribution . We consider for all time , the distribution of the random variable . Then it is straightforward that is in the set of couplings . We then have the following inequality.
[TABLE]
Let .
[TABLE]
Let us consider the term depending on .
[TABLE]
As satisfies assumptions (A2) and (A4), we have for all
[TABLE]
We use also the following notation for all time
[TABLE]
We now look for an upper-bound of the function .
[TABLE]
Now let us consider the empirical characteristic .
[TABLE]
We use the notation . Then we obtain that
[TABLE]
Now let us consider the term depending on .
[TABLE]
The same reasonning as previously can be applied here to the function to show that , which leads to
[TABLE]
We use the previous inequalities to find an upper-bound of the quantity .
[TABLE]
[TABLE]
By taking the infimum over , we obtain the inequality
[TABLE]
Let us study the convergence of the upper bound when the sequence of random variables is evaluated at such that . The last convergence implies in particular that . As the distribution have a compact support of diameter upper bounded by , we can write
[TABLE]
So , and therefore . It follows that
[TABLE]
Then we obtain by dominated convergence that .
9.3 Proof of corollary 2
Let us start by establishing an estimation of the quantity for any time and for any .
[TABLE]
where the functions and are defined in equation (53) with any coupling of . In the proof of theorem 31 (cf appendix section 9.2), we have proved the following inequalities
[TABLE]
We use also as in the previous proof the notation . The argument of Dobrushin leads to the following inequality
[TABLE]
By gathering the previous inequalities, we obtain finally
[TABLE]
As this inequality holds for any , we can take equal to the optimal plan, so that . By setting , we obtain by Grönwall lemma
[TABLE]
It is clear that for all time and for all , we have that and . By an argument of dominated convergence, we can obtain that
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Baey et al. [2016] Charlotte Baey, Samis Trevezas, and Paul-Henry Cournède. A non linear mixed effects model of plant growth and estimation via stochastic variants of the em algorithm. Communications in Statistics-Theory and Methods , 45(6):1643–1669, 2016.
- 2Baey et al. [2018] Charlotte Baey, Amélie Mathieu, Alexandra Jullien, Samis Trevezas, and Paul-Henry Cournède. Mixed-effects estimation in dynamic models of plant growth for the assessment of inter-individual variability. Journal of agricultural, biological and environmental statistics , pages 1–25, 2018.
- 3Beyer et al. [2015] Robert Beyer, Octave Etard, Paul-Henry Cournède, and Pascal Laurent-Gengoux. Modeling spatial competition for light in plant populations with the porous medium equation. Journal of Mathematical Biology , 70(3):533–547, 2015.
- 4Bishop [2006] Christopher M Bishop. Pattern recognition and machine learning . Springer, 2006.
- 5Bolley et al. [2011] François Bolley, José A Canizo, and José A Carrillo. Stochastic mean-field limit: non-lipschitz forces and swarming. Mathematical Models and Methods in Applied Sciences , 21(11):2179–2210, 2011.
- 6Carrillo et al. [2010] José A Carrillo, Massimo Fornasier, Giuseppe Toscani, and Francesco Vecil. Particle, kinetic, and hydrodynamic models of swarming. In Mathematical modeling of collective behavior in socio-economic and life sciences , pages 297–336. Springer, 2010.
- 7Cieslak et al. [2008] Mikolaj Cieslak, Christiane Lemieux, Jim Hanan, and Przemyslaw Prusinkiewicz. Quasi-monte carlo simulation of the light environment of plants. Functional Plant Biology , 35(10):837–849, 2008.
- 8Cournède et al. [2007] Paul-Henry Cournède, Amélie Mathieu, François Houllier, Daniel Barthélémy, and Philippe De Reffye. Computing competition for light in the greenlab model of plant growth: a contribution to the study of the effects of density on resource acquisition and architectural development. Annals of Botany , 101(8):1207–1219, 2007.
