Trend to equilibrium for run and tumble equations with non-uniform tumbling kernels

We study the long-time behaviour of a run and tumble model which is a kinetic-transport equation describing bacterial movement under the eﬀect of a chemical stimulus. The experiments suggest that the non-uniform tumbling kernels are physically relevant ones as opposed to the uniform tumbling kernel which is widely considered in the literature to reduce the complexity of the mathematical analysis. We consider two cases: (i) the tumbling kernel depends on the angle between pre-and post-tumbling velocities, (ii) the velocity space is unbounded and the post-tumbling velocities follow the Maxwellian velocity distribution. We prove that the probability density distribution of bacteria converges to an equilibrium distribution with explicit (exponential for (i) and algebraic for (ii)) convergence rates, for any probability measure initial data. To the best of our knowledge, our results are the ﬁrst results concerning the long-time behaviour of run and tumble equations with non-uniform tumbling kernels.


Introduction
We consider a kinetic-transport equation which describes the movement of biological microorganisms biased towards a chemoattractant.The model is called the run and tumble equation and introduced in [1,22] based on some experimental observations [3] on the bacterium called Escherichia coli (E.coli).The equation is given by where f := f (t, x, v) ≥ 0 is the density distribution of microorganisms at time t ≥ 0 at a position x ∈ R d , moving with a velocity v ∈ V ⊆ R d .
The term λ(v ′ •∇ x M (x))κ(v, v ′ ) is called the tumbling frequency where λ : R → [0, ∞) is the tumbling rate.The tumbling rate λ depends on the gradient of the external signal M along the direction of the velocity v, and it is defined by where m 0 ∈ R + 0 represents the external signal in the absence of a chemical stimulus and S(x) is a given function for the density of the chemoattractant.In Eq. ( 1), the tumbling or turning kernel κ(v, v ′ ) is a probability distribution on the space V and gives the probability of moving from velocity v to velocity v ′ , i.e. ´V κ(v, v ′ ) dv ′ = 1.
In the case of peritrichous bacteria such as E. coli and Salmonella typhimurium, experiments conducted in [3,17] suggest that κ depends only on the relative angle θ between the pre-and post-tumbling velocities v and v ′ respectively.Particularly, for bacterium E. coli, the tumbling kernel κ is given by where g(θ) is a sixth order polynomial satisfying g(0) = g(π) = 0 (see [4,21] for more details).The exact form of g is provided in [14] by polynomial fitting to the data of [3].Here we will work in a bounded velocity space.
In our previous paper [13] we studied this equation under the assumption that κ was uniformly bounded above and below.However, this assumption is not realistic as the bacteria are not able to turn a full half circle.We aim to extend our previous work to the case where the maximum turning angle of the bacteria may be bounded.
We are also interested in unbounded velocity spaces, i.e., v ∈ V = R d .In this setting, we consider that the tumbling kernel is given by the Maxwellian distribution on the post-tumbling velocities independently from the pre-tumbling velocities, i.e., .
To the best of our knowledge, we provide the first results concerning the long-time behaviour of the run and tumble equation with these non-uniform tumbling kernels which are more physically relevant in terms of modelling the chemotactic bacterial motion.We believe the main reason for this is the fact that the classical hypocoercivity techniques such as [9] cannot be used for the run and tumble equation even though it is a linear, conservative kinetic equation.On the other hand, Harris-type theorems (see e.g.[8,24]) proved very effective for obtaining quantitative hypocoercivity results, especially for kinetic equations arising from applied sciences where classical techniques provide limited results.We elaborated on this fact in our previous paper [13] in detail and a brief explanation can be found below in the paragraph Motivation and novelty.
Summary of previous results.Previous important works on the linear run and tumble equation include [5,6,19,20,21].In [20,21], the authors study the diffusion approximation to a linear run and tumble equation and the diffusion limit of this equation to obtain macroscopic chemotaxis equations, respectively.Using the L 2 hypocoercivity techniques developed in [9], the authors [6] show the existence of a unique equilibrium and exponential decay towards it in dimension d = 1.This paper works with the assumption that the tumbling rate λ can take two values depending if the bacteria is travelling up or down the gradient of the chemoattractant density.Though it is expressed differently in [6] the tumbling rate can be written as where χ is called the chemotactic sensitivity.In [19], the authors extended this results to higher The result in [19] works under the assumption that the concentration of the chemoattractant S(x) is radially symmetric and decreasing in x such that S(x) → 0 as |x| → ∞.In our previous paper, [13] we improve the result in [19] by proving the exponential convergence to unique equilibrium without requiring S(x) to be radially symmetric.Our result is valid in an arbitrary dimension d ≥ 1 where the tumbling kernel λ can take a much more general form.Most importantly, we show that existence and convergence to a steady state hold when λ is a Lipschitz function.Our techniques in [13] are based on Harris-type theorems coming from the ergodic theory of Markov processes.They differ from the techniques used in [19] that are based on the Krein-Rutman theorem.Moreover in [13], we also consider a non-linear run and tumble model where we can prove the exponential decay to a unique equilibrium.
In [5], the author studies a non-linear coupled run and tumble equation in one dimension d = 1.Even though [5] is mainly concerned with the travelling wave solutions of the non-linear equation, as an intermediate step, the author shows the existence of steady states for the linear equation.All these previous works deal with situations where the tumbling kernel, which tells us how the post-tumbling velocities depend on the pre-tumbling velocities, is essentially uniform, i.e., κ ≡ 1, and on a bounded velocity space.The main goal of this work is to look at physically more realistic cases where the tumbling kernel is not uniform and the bacteria are not able to turn to every angle in one tumbling event.
Motivation and novelty.In our previous paper [13] we studied Eq. (1) in the case where the velocity space was a ball and the post-tumbling velocities were uniformly distributed so that κ ≡ 1.We showed exponential convergence to equilibrium in suitable weighted total variation distances.The result was built around probabilistic techniques called Harris-type theorems coming from the theory of Markov processes.The goal of this paper is to extend the previous result to a wider class of tumbling kernels that are non-uniform and physically more relevant for modelling the motion of chemotactic bacteria.
The typical tools for showing convergence to equilibrium for kinetic equations come from hypocoercivity.It is important to note that "classical" hypocoercivity techniques such as [9,23] cannot be applied without strong a priori knowledge of the steady state which we do not have for the run and tumble equation.This is the main reason for scarce results on the long-time behaviour with arbitrary dimensions d ≥ 1 even though the run and tumble equation is widely studied.Harris-type theorems (see, e.g., [8,15,16] and references therein) provide the existence and uniqueness of the steady state as a by-product while simultaneously showing convergence to equilibrium.Using these tools, one can obtain quantitative hypocoercivity results in weighted total variation (or in weighted L 1 ) distances independently from the initial data (see, e.g., [7,24]).
Harris-type theorems are based on verifying two hypotheses: minorisation and geometric drift conditions.The minorisation condition requires providing a quantifiable positive lower bound on the process.Therefore, non-uniform tumbling kernels pose additional challenges compared to the case with a uniform tumbling kernel when using Harris-type theorems.This is because we need to prove lower bounds on the law uniform over a large set of initial conditions.This means that we need to find some possible paths a bacterium can take when moving from one point in phase space to another.The fact that the tumbling angle is bounded means that bacteria may only be able to travel between two points along paths involving many tumbling events.Tracking bounds on the probabilities of these complex paths (and paths close to them) is challenging and required us to generate new technical tools.

Assumptions and main results
The two main results of our paper concern angularly dependent tumbling kernels and unbounded velocity spaces.In both cases, we will make the following assumptions on the tumbling rate, λ, and the logarithm of the chemoattractant concentration, M .
(H2) There exists a contstant a strictly positive integer b > 0, such that for every B > 0, there exists c > 0 depending on B so that for |m| ≤ B. We note that this holds if ψ is the sign function or if it is odd and differentiable around zero with strictly positive k th derivative for some k ≥ 1.
The following assumptions concern the tumbling kernels we work with.
(H4) We assume that V = V 0 S d−1 and there exist α, β > 0 such that where and κ 1 is a decreasing function of |θ| (similar arguments work if κ 1 is even and bounded below by a decreasing function of |θ|).
(H5) We assume that V = R d and the tumbling kernel is given by the Maxwellian distribution on the post-tumbling velocities independently from the pre-tumbling velocities, After the assumptions, we state the main results of the paper below.
Theorem 1.1 (Angularly dependent tumbling kernel (κ 1 )).Suppose that t → f t is the solution of Equation (1) with initial data f 0 ∈ P(R 2 × S 1 ).We suppose that hypotheses (H1), (H2), (H3) and (H4) are satisfied.Then there exist positive constants C, σ (independent of f 0 ) such that where f ∞ is the unique steady state solution to Equation (1).The norm • * is the weighted total variation norm defined by where γ, A, C κ > 0 are positive constants that can be computed explicitly and will be chosen so that • * is indeed a norm, and µ is a finite measure.
Remark 1.2.We believe that Theorem 1.1 works in arbitrary dimension d ≥ 1.The reason for stating Theorem 1.1 in dimension d = 2 is that we provide the proof of Proposition 2.7 only in d = 2.We do not believe that there is a major mathematical obstacle in proving it in higher dimensions.However, even in d = 2, the computations become delicate, and the notations get intricate.Therefore, we decided to provide it in d = 2 to keep the exposition of our ideas clear.
Theorem 1.3 (Unbounded velocity space with tumbling kernel (κ 2 )).Suppose that t → f t is the solution of Equation (1) with initial data f 0 ∈ P(R d × R d ).We suppose that hypotheses (H1), (H2), (H3) and (H5) are satisfied and assume further that M Hess(M ) is bounded.Then there exists a positive constant C > 0 such that where with A > 0 is a constant that can be computed explicitly and it is sufficiently large so that M f 0 > 0.
Even though we study the long-time behaviour of the run and tumble equation ( 1) with the nonuniform tumbling kernels in this paper, we would like to briefly comment on the Cauchy theory for these equations.
Cauchy theory for Equation (1).As Eq. ( 1) is a linear integro-differential equation with bounded coefficients, showing the existence and uniqueness of global-in-time, measure-valued solutions is relatively standard.One could either use Picard iteration arguments to construct short-time solutions and then use the fact that λ is bounded to show these can be glued together globally in time or one can directly write down a Markov process whose law satisfies Eq. ( 1).We briefly explain how to do the latter.Let us generate a Poisson process with intensity (1 + χ) and call its jump times J 1 , J 2 , . . .and a series of thinning variables U 1 , U 2 , . . .independent and all having the uniform law on [0, 1 + χ] then we define initial points (X 0 , V 0 ) having law f 0 then set J 0 = 0 and for t ∈ (J i , J i+1 ) we write Plan of the paper.After listing our assumptions and stating our main results in Section 1.1, in the following section (Section 1.2), we describe our methodology, particularly we state Harris's theorem in geometric and subgeometric settings, Theorems 1.4 and 1.6 respectively.Then, Sections 2 and 3 are dedicated to proving Theorems 1.1 and 1.3 for the cases (i) angularly dependent tumbling kernels and (ii) unbounded velocity spaces respectively.

Methodology
This paper is an extension of the work in [13] and as such is built on Harris's theorem from Markov process theory.More precisely, Harris-type theorems are used in showing geometric (exponential) or sub-geometric (algebraic) rates of convergence to a unique equilibrium solution for equations that can be described as Markov processes.Harris-type theorems rely on verifying two hypotheses: a Foster-Lyapunov condition and a uniform minorisation condition.
We briefly introduce the functional setting and some notations below and then we provide the statements of the theorems both in geometric and sub-geometric settings in the spirit of [8,16,18] and the references therein.We skip the proofs of these theorems.
Notations.We consider a measurable space (Ω, Σ) where Ω is a Polish space endowed with a probability measure.We denote the space of probability measures on Ω by P(Ω).Note that in our setting We define the weighted total variation (or weighted L 1 ) distance by where µ is a finite measure or a measurable function and φ : Ω → [1, +∞) is a measurable weight function.
and there exists a constant C such that holds for every µ(φ) = ´φ(z)µ( dz) where the function H h is defined by .
The proofs of these theorems can be found in [8,10,15].In [10,15], the authors make a weaker assumption, namely h(u) ≤ u for any u ≥ 1, instead of the one which is stated above lim u→+∞ h ′ (u) = 0.
Their assumption allows for linear growth at infinity, whereas lim u→+∞ h ′ (u) = 0 essentially requires h to be flat at infinity.
For the case of angularly dependent jump kernels, we are able to recover exponential convergence using Harris's theorem (Theorem 1.4).The Foster-Lyapunov condition is proven in a similar way though more intricate than the work in our previous paper [13].The minorisation condition is considerably more challenging due to the fact that we need to track the dynamics over many more jumps to produce a lower bound.Therefore, we present the proof that the minorsiation condition holds in dimension d = 2 to simplify the computations of the lower bound.Thus, the convergence result is stated in d = 2 in Theorem 1.4.However, we believe that there is no serious obstacle to generalising it to higher dimensions.
For the case of unbounded velocity spaces, we are only able to show subgeometric rates of convergence.We do this via the subgeometric version of Harris's theorem (Theorem 1.6).Here, we are able to use exactly the same uniform minorisation condition as in our previous paper [13] in the linear case.
The Foster-Lyapunov condition is substantially different and this is reflected in the subgeometric rate of convergence.
Before verifying these hypotheses for Eq. ( 1) we would like to add some comments on the Foster-Lyapunov condition.In order to show that (FL1) holds true for Eq. ( 1) we would like to find some function φ(z) where φ(z) → ∞ as |z| → ∞ and the existence of some τ > 0, C > 0 and α ∈ (0, 1) such that for any initial data f 0 (x, v) ∈ P(R d × V).This is because for f satisfying where L * is the formal adjoint of L and ζ = log α τ and D = C log α τ (1+α) .In our case we have and therefore, 2 Angle-dependent tumbling kernel This section is dedicated to the long-time behaviour of the linear run and tumble equation, Eq. ( 1) with the angularly dependent tumbling kernel (κ 1 ).The following two sections are dedicated to verifying the two hypotheses of Harris's theorem (Theorem 1.4).At the end of this section, we provide a proof of Theorem 1.1.

Minorisation condition
In this section, we prove that Hypothesis 2, (M1), is satisfied for Eq. ( 1) with the angular-dependent tumbling kernel (κ 1 ).Our overall strategy is as follows: we show that the solution f ≡ f t fo Eq. ( 1) attains a lower bound using a Duhamel's formula and bounding below by the part of f t where there are a particular number of jumps.
To keep the exposition of our strategy clear, we provide the following computations for only d = 2.The very same approach can be used to extend the results to higher dimensions.
Denoting v θ := (cos θ, sin θ) and ∇ x,y g := (∂ x g, ∂ y g) for any differentiable function g, Eq. ( 1) becomes Next, we define the semigroup (T t ) t≥0 accounting for the transport part, and the operator L, ( Lf )(t, x, y, θ) Then we have the following lemma Lemma 2.1.Suppose that b(θ) ≥ β1 |θ|≤α (θ).Then for any n ≥ 1 we have Proof.We have that Therefore writing Λ(t, x, y, θ) Changing variables and using the fact that 1 − χ ≤ λ ≤ 1 + χ, we obtain Then using the assumption on b we have We note that the second term above is positive, so we have Then, we can plug this into the integral term to obtain We then continue substituting this into the integral term n times to obtain the result for any n ≥ 1.This finishes the proof.
Next, we want to show that we can find an n ≥ 1 and a range of admissible times for which we can provide a lower bound on the term Let us define P t g := LT t g for any probability measure g.Then we write P 3 t 1 ,t 2 ,t 3 := P t 1 P t 2 P t 3 and note that for any measure g, P 3 t 1 ,t 2 ,t 3 g has a density.In particular, P 3 t 1 ,t 2 ,t 3 δ x 0 δ y 0 δ θ 0 (x, y, θ) is bounded below by a uniform measure of a set with non-empty interior.Hence, we can bound it below by a constant times the indicator function of red a ball in the position variable x with a centre at a point which we can compute.We can then use this computation to show that P 3 t 1 ,t 2 ,t 3 acting on the indicator function of a ball is bounded below by a constant times the indicator function of another ball with a slightly larger radius and a different centre.By tracking how these centres move and how the radii of the balls grow, we can then get a bound below in (x, y)-space by the indicator function of a ball whose centre is at the origin (rather than depending on the initial point).
We then need to prove that we can subsequently reach all possible angles (i.e., velocities) while maintaining a uniform lower bound below in position.We show this by looking at repeated jumps in a small time period so that we reach all angles without moving too far.This then allows us to reach all possible angles but slightly shrinks the ball we found in the lower bound for the spatial variables.
Therefore, in the following lemma, we look at P 3 t 1 ,t 2 ,t 3 δ x 0 δ y 0 δ θ 0 (x, y, θ) and show that it is bounded below by a constant times the indicator function of a set which contains a ball whose radius and centre we can compute.Lemma 2.2.Let α < π 2 and r 1 , r 2 , r 3 > 0 are a set of times, ε > 0 and |s i − r i | < ε for each i ∈ {1, 2, 3}.Then if ε is sufficiently small we have where Proof.Since we have and applying T s 2 once more we obtain, Iterating this yields We perform a change of variables, then we have The Jacobian of this change of variables is dx dỹ = s 2 s 3 sin(θ 2 ) dθ 1 dθ 2 .Moreover, defining θ := θ 1 + θ 2 + θ 3 and then d θ = dθ, we obtain where S(x 0 , y 0 , θ 0 , s 1 , s 2 , s 3 ) is the set of possible values of x 0 + s 1 cos(θ 0 ) + x, y 0 + s 1 sin(θ 0 ) + ỹ, and θ 0 + θ, (see Figure 1 below).Then, as | sin(θ 2 )| ≤ 1 we have Next, we want to show that S(x 0 , y 0 , θ 0 , s 1 , s 2 , s 3 ) contains the ball mentioned in the statement of the lemma.We notice that We choose θ 2 = ± α 2 and θ 1 = ± arctan s 2 +s 3 cos(α/2) and this will give the centre of the ball.Now for a given θ 2 , we choose β = arctan s 3 sin(θ 2 ) s 2 +s 3 cos(θ 2 ) then we can write So we can set x = R cos(ω) and ỹ = R sin(ω) as long as we can choose .
We can see that for θ 1 and θ 2 small we have Thus, we expect to be able to choose |β| up to s 3 α s 2 +s 3 which is at least as large as it is needed to cover the ball given that α is small.Then since all the computations depend continuously on s 1 , s 2 , s 3 and the ball is strictly contained inside the set S, we can replace s 1 , s 2 , s 3 with r 1 , r 2 , r 3 provided that ε is small enough.This concludes the proof.Using Lemma 2.2 we then prove the following: Lemma 2.3.Let r 1 , r 2 , r 3 > 0 be a set of times, R, α are as in Lemma 2.2.Then we have , where x * * = x 0 − (r 1 + R) cos(θ 0 + δθ), y * * = y 0 − (r 1 + R) sin(θ 0 + δθ), θ * * = θ 0 + δθ and γ a constant that can be computed explicitly.Let us define the map F , which tracks how the centres of the balls move.
Proof.We have where ´represents the triple integral, ´R2 ×R 2 dx ′ dy ′ ´α −α dθ ′ .Now applying three times T t and L yields, In the last line above, we fixed θ ′ and considered the integral in x ′ and y ′ which will measure the size of the overlap between the balls B((x − (r 1 + R) cos θ ′ , y − (r 1 + R) sin θ ′ ); r) and B((x 0 , y 0 ); r).
Proof.We have and y k is defined similarly.The points (x k , y k ) are illustrated in Figure 2 below.
We can then compute the ball that all the points lie on, which is a circle whose radius R and centre C are given by This finishes the proof.
This image shows the iterates of the map F in (x, y)-space.We notice that each triangle formed by the points C, (x k , y k ), (x k+1 , y k+1 ) is an isosceles triangle and a rotation of the triangle formed by the points C, (x 0 , y 0 ), (x 1 , y 1 ).We can then compute the circle that they all lie on and the point at the centre C using standard tools in trigonometry.
In the next lemma, we prove that after 24 R r steps, the x, y marginal is bounded by a constant times the indicator function of a ball of radius R. , then there exists some constant γ > 0 such that Proof.By Lemma 2.4 we can choose a path such that (x k , y k ) ∈ B((x 0 , y 0 ); R) and writing k = ñ 3 Lemma 2.3 yields Since we also have that 1 + k−1 4 r ≥ 2 R, therefore we obtain (13) with γ = γ k .
Next, we look at the angles and prove the following lemma: Lemma 2.6.Let n * = 4π α and suppose that t 1 + t 2 + • • • + t n * ≤ l.Then we have , uniform in θ.
Proof.First, let us look at We can keep iterating this to obtain For some constant C that doesn't depend on θ 0 , θ.Therefore, ˆP n * δ x 0 δ y 0 δ θ 0 (x, y, θ) dx dy ≥ C.
We can also see that as the x and y variables can have travelled a distance of at most l.Then Then using the translation invariance of the transport map we can write so we have Above, we use the fact that if (x, y) ∈ B((0, 0); R − 2l) then we will be integrating over the full support of µ((−x ′ , −y ′ ) | θ, (−x, −y, θ ′ )).
Using the previous lemmas, we can prove that the minorisation condition (M1) for Eq. ( 1) with the angularly dependent tumbling kernel is satisfied.
Proof.Suppose that the first n * * inter-jump times are within ε of r 1 , r 2 , r 3 with ε small enough so that Lemma 2.2 applies and γ is chosen such that Lemma 2.5 holds for any interjump times in this range with constant γ.Suppose further that the sum of the last n * jump times is less than l.Then, using the previous result we have P n * * +n * δ x 0 δ y 0 δ θ 0 (x, y, θ) = P n * (P n * * δ x 0 δ y 0 δ θ 0 ) (x, y, θ) using Lemma 2. We then take m = R 8 and substitute this into Lemma 2.1 and integrate over the admissible possible jump times and obtain where γ is a constant we could, in principle, compute.This verifies (M1) for (11) with the angularly dependent kernel (κ 1 ).

Foster-Lyapunov condition
In this section, we verify the Foster-Lyapunov condition (FL1) for Eq.(1) for the case (κ 1 ).We remark that the minorisation condition in the previous section was given in dimension d = 2 to keep the exposition clear.The Foster-Lyapunov condition we prove in this section is valid for arbitrary dimensions d ≥ 1.We start by proving the following lemma.
Lemma 2.8.Suppose that κ is a collision kernel (κ 1 ) satisfying the hypothesis (H4) then where C κ ≤ 1 is a constant that only depends on the form of the collision kernel.
Proof.We perform a change of variables and write write v ′ = cos(θ)v + sin(θ)w where w ∈ S v ranges over the sphere of dimension d − 2 lying in the hyperplane perpendicular to v.This gives us Since κ 1 is an even function, integrating first in θ yields where |S v | is the size of S v , similarly for |S d−2 |.Therefore we obtain (14) with Lemma 2.9.Suppose that κ is a collision kernel (κ 1 ) and that hypotheses (H2) and (H4) are satisfied.
Then we have Proof.Let us first prove the lemma when d = 2 which is the application of Theorem 1.1.Performing the same change of variables as in Lemma 2.8, we have Then, using the assumption (m) we can bound this integral below by where α is the angle between v and ∇ x M .If we write then we can compute that Therefore, F (α) = 0 when α = 0, ± π 2 , ±π and in the case α = ± π 2 we have F ′′ (α) < 0 as which is negative when κ ′ 1 (θ) sin(θ) ≥ 0 for all θ which will be the case if κ 1 is a decreasing function of |θ|.Therefore, for all α we have In the case where we have d > 2, let us make the change of variables where u is the unit vector in the direction ∇ x M − (∇ x M • v) v and p is a variable vector that ranges over the sphere of vectors of norm 1 perpendicular to both v and u (which we call S v,u .The Jacobian of this change of variable is | sin(θ)| d−2 .Therefore, we want to find a lower bound for the integral The integral dp just gives us a constant factor.To evaluate the rest, we write φ v to be the angle between ∇ x M and v. Then we have In the last line above, we have used similar considerations to the case d = 2.
Now, we can move on to the proof of the Foster-Lyapunov condition (FL1).
Proof.First, we notice that if A is sufficiently small then Now, we differentiate the separate parts of the Lyapunov function, remembering (10) and using Lemmas 2.8 and 2.9, Now, we can put this all together in a Lyapunov functional for positive A sufficiently small Then, choosing A ≤ χ 1+χ we have Now, we know that we can choose R * such that if |x| > R * then, , then we will have

Unbounded velocity spaces
This section is dedicated to the long-time behaviour of the linear run and tumble equation, Eq. ( 1) posed in an unbounded velocity space V = R d with a tumbling kernel (κ 2 ).The following two sections are dedicated to verifying the two hypotheses of the subgeometric version of Harris's theorem (Theorem (1.6)).At the end of this section, we provide a proof of Theorem 1.3.

Minorisation condition
For unbounded velocities, our minorisation part is essentially identical to that in our previous paper [13].
For the sake of completeness, we include a proof here.Let us again write (T t f )(t, x, v) = f (t, x − vt, v) for the transport semigroup and define ( Lf )(t, x, v) := ˆRd f (t, x, u) du1 |v|≤V 0 (v).
Then we have the following lemmas.
Proof.The proof is exactly the same as in [13] after observing that there exists some C > 0 such that κ 2 (v) ≥ C1 |v|≤V 0 (v).
Applying L to this we obtain LT r f 0 ≥ δ x 0 +rv 0 (x)1 |v|≤V 0 (v).Then we have, for any c > 0 Summing these up and choosing c = 2χ 1+χ we have Now we also have Therefore choosing we have Lastly, choosing A sufficiently large ensures that φ > 0, and for A sufficiently large, φ is comparable to M 2 + v 2 .

Subgeometric convergence rates
We can now combine the results of the two previous sections to get a proof of Theorem 1.3.
Proof of Theorem 1.3.We have verified the hypotheses of the subgeometric Harris's theorem with the Foster-Laypunov function being and the function h(t) = √ t.We can, therefore, compute that the function H −1 (t) = t 2 + 1 2 and h • H −1 h (t) = t 2 + 1 .Hence, applying the conclusion of Theorem 1.6 gives the existence of a steady state f ∞ and that This proves the result.

Figure 1 .
Figure 1.This image is an illustration of the set S (dotted region) mentioned in the proof of Lemma 2.2 for fixed values of r 2 , r 3 , α.The ball found inside the set S is grey coloured.