Kinetic Models for Topological Nearest-Neighbor Interactions

We consider systems of agents interacting through topological interactions. These have been shown to play an important part in animal and human behavior. Precisely, the system consists of a finite number of particles characterized by their positions and velocities. At random times a randomly chosen particle, the follower, adopts the velocity of its closest neighbor, the leader. We study the limit of a system size going to infinity and, under the assumption of propagation of chaos, show that the limit kinetic equation is a non-standard spatial diffusion equation for the particle distribution function. We also study the case wherein the particles interact with their K closest neighbors and show that the corresponding kinetic equation is the same. Finally, we prove that these models can be seen as a singular limit of the smooth rank-based model previously studied in Blanchet and Degond (J Stat Phys 163:41–60, 2016). The proofs are based on a combinatorial interpretation of the rank as well as some concentration of measure arguments.


Introduction
in [5] claim that each bird interacts with between six to eight of its closest neighbors. The authors coined the term of "topological interaction" to refer to such interaction mechanisms and "topological distance" to refer to how many other individuals were closer. Even though the reality of this topological interaction has been debated [26], it now seems to receive consensus following reports that self-propelled particle models based on topological interactions successfully reproduce the observed experimental features [11,14,30].
The understanding that birds interact through topological rather than metric distance has generated an intense literature. Topological interactions have been introduced to the modeling of many natural phenomena, from birds [35] to pedestrians [38]. Mixed metric-topologic interactions have also been proposed [43,46]. Proof of flocking under topological interaction has been given in [33,41,48], while speed to consensus has been shown to depend on the number of interacting neighbors in [47]. Similarly, interactions depending of the behavior of the closest neighbor are probably at play in human interactions such as portfolio theory [6,27,37], competition between coworkers within a firm, risk-taking among traders or aggressive behavior to reach a sexual partner, see for example [24,36]. Rank-based dynamics bears similarities with rearrangement (see e.g. [13] and references therein).
One of the striking features of topological compared to metric interactions is their scaleinvariance property. Indeed, irrespective of the bird concentration within the flock, [5] proved that the interaction features remain unchanged. In human cognition models, it is also more relevant to restrict interactions to the closest neighbors, as the attention of a subject is intrinsically directed to only a few people around him/her [44]. Interactions with close neighbors do not preclude interactions at a longer range, as interactions spread with the conscious or unconscious signals sent by the subjects in response to these interactions. However, issues such as quantify the propagation speed of information sent via topological interactions are poorly understood so far, in particular in the presence of a large number of subjects. This calls for a large-scale theory of topological interactions, or in other words, for the development of meso or macroscopic models of particle systems connected through topological interactions. The aim of this article is specifically to derive a macroscopic model for a large population of particles interacting through topological interactions, starting from a simple microscopic model. To the best of our knowledge, the present work and its predecessor [10] are the first to develop a rigorous coarse-graining of topological interactions, with the exception of [33] which tackled a similar question but for a different kind of interaction, closer to mean-field type interactions.
More precisely, we will consider a system with interacting mobile agents. At Poisson random times a given agent selects a partner to interact with according to a probability rule which depends on the proximity rank of the partner. The interaction rule is then very simple: the agent changes its velocity to align with that of its partner. The goal of the present work is, by letting the number of agents tend to infinity, to derive an equation for the probability distribution of the agents in phase space (positions, velocities). Thanks to the choice of this simple interaction rule, inspired from earlier work [15,16], we can concentrate on the mathematical aspects of this derivation. In previous work by the authors [10], the probability rule solely depended on the proximity rank normalized by the total number of interacting partners (or equivalently, on a proximity rank expressed as a percentage). This rule made the number of potential interacting partners tend to infinity as the number of agents also did so. We will refer to this rule as the "smooth rank-based dynamics". By contrast, in the present work, we will concentrate on the case where there is only one interaction partner (the nearest one) or a finite number of them (the K nearest ones), even in the limit of the number of agents tending to infinity. We will refer to these dynamics as the "nearest-neighbor" or "K -nearest-neighbor" dynamics.
In this paper, we show (under the Propagation of Chaos assumption) that the kinetic equation resulting from the nearest-neighbor or K -nearest neighbor dynamics is a nonlinear spatial diffusion equation for the particle distribution function in phase space (position, velocity). This equation has a non-classical feature as it involves a spatial anti-diffusion of the density (which is a velocity integral of the distribution function). We will show that this term results from the constraint that the density must satisfy the continuity equation, a constraint resulting from the preservation of the number of particles in the course of an interaction. By contrast, in the previous work [10] relative to the smooth rank-based dynamics, we showed (also under the Propagation of Chaos assumption), that the resulting kinetic equation involved a spatially non-local integral equation and that the continuity equation for the density was also satisfied. In the present paper, we also show that we can pass from the non-local integral equation issued from the smooth rank-based dynamics to the nonlinear spatial diffusion equation for the nearest-neighbor dynamics by a process involving a singular concentration of the kernel of the integral equation. This provides a vision of the nearest-neighbor dynamics as a singular limit of the previously studied smooth rank-based dynamics.
Rank-based dynamics (either smooth or nearest-neighbor) are natural from a mathematical point of view. The proximity rank includes information about the most immediate interaction partners of a given particle. Although the rank is a highly non-linear function of the particle positions and is subject to jumps when two particles cross, it has robust properties such as invariance by permutation of the particle numbers, and has combinatorial interpretation: the probability for an agent to have a rank k with respect to agent i is equal to the probability of having k − 1 agents between them. Our results strongly rely on this interpretation of the rank, together with some concentration of measure arguments. Rank-based dynamics also exhibit a certain universality, as their kinetic model does not depend on the (finite) number of interacting agents. The kinetic equation that we derive in this work leads to many questions. This equation is a non-standard diffusion equation with mainly unkonwn properties, from the perspective of well-posedness, large-time behavior, regularity, etc. We believe that these questions open fascinating new directions of research in kinetic theory.
Kinetic models of flocking or swarming behavior have been widely investigated in the context of metric interactions. The literature is vast and it is virtually impossible to be exhaustive. Below is a sample of major publications on this topic. Derivation of kinetic models from underlying particle models have been established in [12,23,32,45]. Flocking behavior and pattern formation has been investigated in [1,9,17,31,32,42]. Equilibria and phase transitions in kinetic flocking models have been studied in [7,21,22]. Passage from kinetic to hydrodynamic descriptions of flocking has been investigated in [8,[21][22][23]25,28,39]. Numerical simulation methods have been put forward in [2,29].
The organization of the paper is as follows. Section 2 is dedicated to the presentation of the models and our main results, as well as a detailed discussion of them. Section 3 covers the nearest-neighbor case and the derivation of the kinetic model in this case. Section 4 extends these results to the case where the particles interact with their K closest neighbors. Section 5 develops the proof that the kinetic model of the nearest-neighbor (or K -nearestneighbor) interaction is the limit of the kinetic smooth rank-based interaction model of [10]. A conclusion to this article is given in Sect. 6.

General Framework
Consider a set of N particles. The particle i is characterized by its position x i ∈ R d and its velocity v i ∈ R d where d ≥ 1 is both the spatial and velocity dimension. The particles {(x 1 (t), v 1 (t)), . . . , (x N (t), v N (t))} are subject to the following dynamics -The dynamics is a succession of free-flights and collisions.
-During free-flight, particles follow straight trajectories At Poisson random times with a rate equals to N λ(N ), particles undergo the following collisions process: pick a particle i in {1, . . . , N } with uniform probability 1/N ; then pick a collision partner j with probability π N i j and perform the collision: We will assume that π N i j is a function of the particle positions ( The function λ(N ) is an appropriate scaling factor which will be defined and discussed below. The choice to define the Poisson random times as N λ(N ) allows to avoid heavy notations during the computations. Specifically, λ(N ) represents the rate of jump per individual. To simplify the notation, when no confusion is possible, we will denote x := (x 1 , . . . , We will also use f ( dZ) instead of f (Z) dx.
The system will be described through the master equation which provides the dynamics of the N -particles distribution f (N ) (Z 1 , . . . , Z N ), i.e. the joint probability of particles 1 to N to be at location (in phase space) Z 1 to Z N . As shown in [10], thanks to (1) if f (N ) (t) is permutation invariant at time t = 0 then it is permutation invariant for all times. We study the limit of this dynamics when the number of particles goes to ∞. First define the k-th marginal We assume that "Propagation of Chaos" holds true i.e. ∀Z ∈ R 2nN , ∀t ∈ [0, ∞): This definition is formal as long as we do not specify in which topology the remainder becomes negligible. Making this definition rigorous would require a topology on spaces of functions of an arbitrary number of variables, which is a highly technical endeavor. Usual definitions of propagation of chaos assume that the k-th marginal factorizes in the limit N → ∞ for any arbitrary k and so, avoids this problem by considering functions of a fixed number k of variables. Unfortunately, this more tractable definition does not suffice here as the number of particles interacting with a given particle is not bounded. So, we will use the formal definition (2) without further discussion and leave the formulation of a rigorous theory for future work. Assuming that f (1) N → f in the limit N → ∞, we aim to derive the equation satisfied by f .
In this article we are interested in situations in which a population of agents interact not based on their metric distance but on their topological distance. To do so we introduce the following definition: Definition 1 (Rank). Consider N particles located at x 1 , . . . , x N . Consider the i-th particle and order the list |x j − x i | j=1,...,N , j =i by increasing order and denote by r N (i, j) ∈ {1, . . . , N − 1} the position of the j-th item in this list. If two indices j and j are such that |x j − x i | = |x j − x i |, then we choose arbitrarily an ordering between these two numbers. We define r N (i, i) = 0. Now, we define the rank of j with respect to i as:

Remark 1
The notation r and R have been interchanged compared with [10].
We assume that the interaction probabilities π N i j depend on the particle positions ( where the function will take different forms according to the chosen model. Since the rank of j with respect to i is an intrinsic property of the positions of the particles and does not depend on how they are numbered, we have the following properties of the rank: More precisely, we consider the rank r N (i, j) as a function of L ∞ (R nN ).
We will be considering three different type of collision dynamics which we will describe in the following three sections.

Nearest Neighbor Dynamics
In this article we first consider the case where the collision takes place with the closest neighbor i.e.
where δ x stands for the Dirac delta centered at x.
We will prove the following: Assume Propagation of Chaos (2) and assume a specific form for λ(N ) to be made precise in (22) below. Then, if f (1) N → f and ρ (1) where the collision operator Q[ f ] is defined by Note that we do not intend to give a fully rigorous derivation of this model but of course some assumptions have to be made to ensure that ρ for instance remains positive in the considered domain. In the same spirit the topology in which the convergence takes place will be omitted here and discussed in future works.

K -Nearest Neighbor Dynamics
Let K be a fixed integer in {1, . . . , N } and let (α k ) k∈{1,...,K } be a given sequence such that K k=1 α k = 1. We extend this sequence for k in {1, . . . , N } by taking α k = 0 for all k > K . We consider a collision rule by which particle i adopts the jth-particle velocity with probability α k if particle j is particle i's k-th nearest neighbor, i.e. the probability π i j is given by . Section 2.2 on nearest neighbor interaction was dedicated to the case α 1 = 1 and α k ≡ 0 for all k > 1, i.e. K = 1. The rule considered here is a generalization to the K nearest neighbors i.e. : Under the propagation of chaos (2) and upon choosing a convenient scaling function λ(N ) given in (33) and discussed in Remark 16, we will prove that f satisfies the same equation (3) as before, with the same collision operator (4).

Smooth Rank-Based Dynamics
This case has been studied in [10]. We recall it here for reference and further comparisons with the other models introduced below. We introduce a function K : We define in order to have for any i ∈ {1, . . . , N }: In this way, for any i ∈ {1, . . . , N }, the collection (π i j ) N j=1, j =i , where , defines a discrete probability measure on the set { j ∈ {1, . . . , N }, j = i}. The collision rule is then as follows Definition 2 (Smooth rank-based dynamics) Pick a particle i in {1, . . . , N } with uniform probability 1/N ; then pick a particle j = i with probability π N i j = K N R N (i, j) and perform the collision: .
as N → ∞, and assuming λ(N ) = 1, we prove in [10] that f is a solution of the kinetic equation: where M ρ is the partial mass of ρ and is defined by

Discussion
As mentioned in Sects. 2.2 and 2.3, the kinetic models derived from the nearest neighbor interaction or the K -nearest neighbor interactions are the same. On the other hand, these models differ quite significantly from that obtained from the smooth ranked-based dynamics of [10] as recalled in Sect. 2.4. However, we show in Sect. 5 that the former are limits of the latter when the interaction kernel K concentrates (with a convenient scaling) near zero. In this limit, since only the closest neighbors interact, and these closest neighbors are likely to be spatially close (especially when the density is large) the spatially non-local integral operator appearing in (6) converges to the diffusion operator (4). Note that this diffusion is multiplied by an inverse power of the density. This is easily understood as, when the density is small, the particles are very far apart, resulting in spatial communications between the particles over larger distances, and eventually, into a larger diffusion coefficient. This interpretation is reinforced by the fact that the inverse power of the density depends on the dimension, in the same way as the scaling between the inter-particle distance and the density depends on the dimension.
In [10], we noted that any solution of the smooth rank-based dynamic kinetic model (6) satisfies the mass conservation equation with ρ = f dv and ρu = f v dv. The nearest-neighbor kinetic model (3) also satisfies the mass conservation equation. To see this, it is enough to show that Q( f ) dv = 0. But we easily check that it is the case. Indeed: The collision operator (4) has the form of a spatial diffusion of f but with an anti-diffusion in ρ. In fact, this anti-diffusion is exactly the term that needs to be added to turn a pure spatial diffusion ρ − 2 d x f into an operator that conserves mass i.e. that satisfies Q( f ) dv = 0. At the microscopic level, the collision dynamics describes particles communicating their velocity to spatially distant (although close) neighbors. Therefore, information about the velocity distribution propagates to neighboring particles randomly leading to a spatial diffusion of this distribution. However, this spatial diffusion of the velocity distribution is constrained to obey local mass conservation, which is the reason of the anti-diffusion term acting on the density, as stressed above. If there is no spatial variation of the velocity distribution, particles communicating their velocity to their neighbors will not modify the velocity distribution in this neighborhood, which explains why the collision operator vanishes in this case. The well-posedness theory of (3) is still open but from this remark we can conjecture that the model is well-posed. Indeed, apart from a mass-carrying component, the equation is a spatial diffusion. And the mass carrying component satisfies a continuity equation. So, it seems that the model couples two components each of which solves a well-posed equation. Of course, the coupling is non-trivial and this may result into a lack of well-posedness. This issue will be dealt with in future work.

Master Equation
As recalled in [10], when the collisions occur at Poisson times with rate N λ(N ), the master equation for the N -particle distribution function f (N ) in weak form is, for all test function φ N : Z → φ N (Z), given by: where δ 1 denotes the Dirac Delta centered at 1.

Propagation of Chaos and First Marginal
The following proposition provides the equation for the first marginal f (1) N under the Propagation of Chaos Assumption (2). This equation is given in weak form by using a test function φ(Z 1 ) only depending on the first coordinate Z 1 in Eq. (8) and inserting (2) into (8). In all this section, we drop the drift term (the first term at the right-hand side of (8)) as its treatment is classical (see e.g. [19]). This leads to the following proposition  (2), for all test function φ(Z 1 ) and dropping the drift term as well as the negligible terms when N → ∞ in (2), we have: (9) with M ρ given by (7).
Proof As pointed out above, we drop the drift term for simplicity as this term can be handled with classical methods. Taking φ N (Z) = φ(Z 1 ) as a test function in the master equation (8) and using the permutation invariance as well as a straightforward combinatorial argument shows that 1 The last two terms obviously vanish. Using the propagation of chaos assumption (2) we obtain 1 As shown in [10], the integral can be interpreted as the expectation of δ 1 (r N (1, 2)(x)) for fixed (x 1 , x 2 ) when x 3 , …, x N are drawn randomly and independently with probability ρ (1) N . Using the combinatorial approach of [10] to evaluate this probability, we obtain which gives the stated result.

Proposition 4 For any test function φ(Z 1 ), we have
where for given smooth functions (x, v) → η(x, v) and ρ η ( and Proof Using polar coordinates We perform the change of variable m := M ρ η (x, r ), so that r := R ρ η (x, m). It is then straightforward to see that F N η is indeed defined by (11) as the jacobian of the diffeomorphism is

Preliminaries
The passage to the limit with different scaling assumptions on λ in the various considered models will use a fundamental lemma: Let a and b be two positive parameters. Define the Beta-distribution, β a,b , the probability density function given for all s ∈ [0, 1] by where the Beta-function B(a, b) is defined by converges to 0 when N goes to ∞.
Moreover, by assumption, there exists C such that for all u ∈ (0, 1) and N ∈ N, |h N (u)| < C. Therefore B(a, b N ) . (12) Note that the fraction is closely related to the incomplete regularized Beta-distribution. On one hand, the function u → u a−1 (1 − u) is the maximum on [0, 1]. As (b N ) N ∈N goes to ∞, for N large enough, u a,b N is less than δ. As a consequence, for N large enough On the other hand, by standard properties of the Beta-distribution, see [4], as N goes to ∞ and a is fixed where is the Gamma-function. Collecting (13) and (14) we obtain that there exists C such that This term converges to 0 for N large. Coming back to (12) gives the stated result.

Case λ(N ) = 1
In this section, we show that the kinetic model obtained with λ(N ) = 1 is trivial, i.e. it involves no contribution of the particle interactions to the final dynamics. (1) N ) N ∈N converge toward smooth functions f and ρ respectively. If the convergence of ( f (1)

) satisfies the assumptions of Lemma 5 then
we have In strong form and after restoring the drift term, the equation for f is the free transport equation: Proof By Lemma 5 applied to a = 1, b N = N − 1, we have If we exchange v 1 and v 2 , the term φ( remains unchanged, so that the integral vanishes.

Non-trivial Limit
Here, we determine what must be the expression of the scaling factor λ(N ) such that the contribution of the particle interactions in the limit N → ∞ is non-trivial and we determine the corresponding limit model. Before stating the main theorem, we need the following technical lemma.

Lemma 7 (Higher order expansion) Let (x, v) → η(x, v) be a smooth function and ρ η (x)
For m small enough, we have for all (x, v) ∈ R 2d : where recall that Proof We need to develop m → G η (x, v, m) for m small to higher order terms. To do so we first compute the next two orders of G η expanded in powers of R ρ η = R ρ η (x, m): Fortunately all the first order terms and the second and third terms in the expression of the second order terms are zero by anti-symmetry. Now, since S d−1 ω ⊗ω dω = Id/d, we obtain when R ρ η → 0: Let us now develop m → R ρ η (x, m) in powers of m. We have for r small enough Therefore for m small enough which concludes the proof by inserting this expression in (18).
Before stating the theorem, we introduce the following notations: define where and We note that from Lemma 7, h N (m) → 0 as m → 0 for all integer N . We assume in the theorem below that this convergence is uniform with respect to N . This assumption prevents the occurrence of particle concentrations in the limit N → ∞ which would lead to a non-smooth behavior of G f (x 1 , v 2 , m) at m = 0. Now we state the main theorem of this paper: N ) N ∈N converge toward smooth functions f and ρ respectively. Assume that the convergence of ( f (1) N ) N ∈N to f is such that the sequence h N defined by (19) satisfies the assumptions of Lemma 5. Set λ(N ) to the value Then for all test functions φ(Z 1 ) we have In strong form, introducing the collision operator and after restoring the drift term, the equation for f reads: Before proving this theorem, we first prove the following intermediate step:

Proposition 9
Under the assumptions of Theorem 8, for all test functions φ(Z 1 ), we have Proof of Proposition 9 Thanks to the assumptions on h N , we can apply Lemma 5 with a = 1 + 2 d and b N = N − 1, and obtain As β 2 d −1,N −1 is a probability this proves that where H (0) is defined from (21) by replacing f N by f , ρ respectively. Using (20), we have Inserting (28) and the expression of H (0) given by (21) into (27) leads to (26).

Proof of Theorem 8
We start from (10) where F N is defined by (11). Using (26) and owing to the fact that the term involving G f (1) N (x 1 , v 2 , 0) vanishes upon integration with respect to (Z 1 , v 2 ) (exactly like in the proof of Proposition 6), we deduce that, for N large, up to negligible terms when N → ∞, we have Using Definition (16) of D, we see that the second term of f ( is anti-symmetric under this exchange, this second term vanishes after integration. Therefore, the only non-zero term comes from the first term of D, which leads to (up to negligible terms when N → ∞) to and with the choice (22), this leads to (23). It readily seen, applying Green's formula, that the strong form of the equation is (25), upon inserting back the drift term.

Remark 10
We note that λ(N ) → ∞ as N → ∞. In particular, in the case d = 2, λ(N ) can be easily computed and has value λ(N ) = 2N . This means that the limit is non-trivial only if the number of collisions per unit time is larger than for the standard kinetic scale (which corresponds to λ(N ) = 1).

Master Equation
Let K be a fixed integer in {1, . . . , N } and a sequence (α k ) k∈{1,...,K such that K k=1 α k = 1 being given. We extend this sequence for k in {1, . . . , N } by taking α k = 0 for all k > K . The particle i will adopt the velocity of its jth-nearest neighbor with a probability π N i j given by (5). Section 3 was devoted to the case α 1 = 1 and α j ≡ 0 for all j > 1.
As shown in [10], when the collisions occur at Poisson times with rate λ(N )N , the master equation of the N -particle distribution function f (N ) in weak form is, for all test function

Propagation of Chaos
Proposition 11 (First marginal equation with propagation of chaos) Under the propagation of chaos assumption (2) we have for all test function φ Proof As before we have which leads, by the propagation of chaos assumption (2) to up to negligible terms as N → ∞. The computation of the integral is slightly different from before as here (see [10] for details) which gives the stated result.
The probability considered in Sect. 3 was the Bernoulli distribution. A similar result can be proved with a more general binomial distribution: For a given smooth function ρ and x ∈ R d , let m ∈ [0, 1) → R ρ (x, m) ∈ [0, ∞) be the inverse function of r → M ρ (x, r ). We also define the binomial distribution with parameters n ∈ N and p ∈ [0, 1], denoted M(n, p), as the probability on the discrete set {0, 1, . . . , N } given by the probability mass function: We note that, by integration by parts, we have Proposition 12 We have with The proof is identical and will not be repeated here. Also note that ν K (m), dm is a probability on [0,1]. Indeed, thanks to (31), we have

Limit Equation
In strong form and after restoring the drift term, the equation for f is the free transport equation (15).
Proof As ν K (m) is a convex linear combination of binomial distributions, we can apply Lemma 5 to μ(k − 1; N − 2, m) for any k and this leads to the result.

Non-trivial Case
Like in Sect. 3.2.3, we now determine the scaling factor λ(N ) for the particle interactions to have a non-trivial contribution in the limit N → ∞ and we determine the corresponding limit model.

Theorem 14
Assume that ( f (1) N ) N ∈N and (ρ (1) N ) N ∈N converge toward smooth functions f and ρ respectively. Assume that the convergence of ( f (1) N ) N ∈N to f is such that the sequence h N defined by (19) satisfies the assumptions of Lemma 5. Set λ(N ) to the value Then for all test functions φ(Z 1 ), f satisfies Eq. (23). In strong form and after restoring the drift term, the equation for f is given by (25) The result still relies on Lemma 7 and the following analog of Proposition 9: Proposition 15 Under the assumptions of Theorem 14, for all test functions φ(Z 1 ), we have The proof Proposition 15 is similar to that of Proposition 9 and is left to the reader. The deduction of Theorem 14 from Proposition 15 is exactly the same as that of Theorem 8 from Proposition 9.

Remark 16
We note the following property which can be proven by integration by parts: for all k ∈ Z, for all a ∈ [−k, ∞), for all b ∈ [k, ∞), we have: Thanks to this property, we have for k ∈ N, k ≥ 2: Thus, . Therefore, we find the same scaling of λ(N ) as in the nearest neighbor interaction case, up to the multiplication by the constant factor ( K

From Smooth to Nearest-Neighbor Interaction
In this section we investigate the connection between the smooth rank-based interaction developed in [10] and the nearest neighbor (or K nearest-neighbor) interaction considered here. We show that when the kernel K (m) concentrates near m = 0, we pass from (6) to (3). As the kernel K concentrates, it needs to be rescaled in the appropriate way. More precisely, we introduce a rescaling parameter ε which we will tend to zero and the following rescaled As the first term is anti-symmetric in the transform (v 1 , v 2 ) → (v 2 , v 1 ), we obtain at the limit ε → 0 and thanks again to Lemma 7: The passage to the strong form is identical to that of Sect. 3.2.3 and we obtain where Q is defined by (24). This concludes the proof assuming that K 0 is normalized according to (35).

Conclusion
In this paper, we have put forward a particle interaction model where particles interact with their nearest neighbor. We have shown that the large particle limit under the Propagation of Chaos assumption is a spatial diffusion for the particle distribution function corrected by an anti-diffusion term acting on the spatial density. We have shown that the appearance of this anti-diffusion term depending on the spatial density results from the fact that the interactions are mass-preserving. We have also considered a model in which particles interact with their K nearest neighbors, for a fixed value of K , showing that the corresponding kinetic model is the same as in the nearest neighbor interaction case. Finally, we have linked this work with the previous article [10] where smooth rank-based dynamics were considered and shown that the kinetic nearest-neighbor model can be recovered from the former through a singular limit involving a scaling of the interaction kernel. The kinetic models obtained here, as in [10], are novel. Their mathematical theory is entirely open: proving existence and uniqueness of solutions, investigating large-time behavior, equilibria and other qualitative properties of the solutions will require the establishment of an appropriate mathematical framework. In parallel, more elaborate physical interaction models (such as the Cucker-Smale [20] or Motsch-Tadmor [42] models) should also be considered. One important question is to investigate how the present results are robust to the introduction of noise in the interaction dynamics. Indeed, noise play an important part of many flocking models in nature. Finally, adequate numerical methods for the kinetic models must be developed and the assessment of the kinetic models against the particle ones in realistic situations should be carefully documented so that these models can be used in practice.

Data statement
No new data were collected in the course of this research.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.