Abstract
We investigate a one-dimensional system of N particles, initially distributed with random positions and velocities, interacting through binary collisions. The collision rule is such that there is a time after which the N particles do not interact and become sorted according to their velocities. When the collisions are elastic, we derive asymptotic distributions for the final collision time of a single particle and the final collision time of the system as the number of particles approaches infinity, under different assumptions for the initial distributions of the particles’ positions and velocities. For comparison, a numerical investigation is carried out to determine how a non-elastic collision rule, which conserves neither momentum nor energy, affects the median collision time of a particle and the median final collision time of the system.
Similar content being viewed by others
References
Amir, G., Omer Angel, O., Valko, B.: The TASEP speed process. Ann. Probab. 39, 4 (2011)
Angel, O., Gorin, V., Holroyd, A.E.: A pattern theorem for random sorting networks. Electron. J. Probab. 17, 99 (2012)
Angel, O., Holroyd, A.E., Romik, D., Virág, B.: Random sorting networks. Adv. Math. 215, 839–868 (2007)
Angel, O., Holroyd, A.E., Romik, D.: The oriented swap process. Ann. Probab. 37, 5 (2009)
Barbour, A.D., Eagleson, G.K.: Poisson approximation for some statistics based on exchangeable trials. Adv. Appl. Probab. 15, 585–600 (1983)
Bardos, C., Gamba, I.M., Golse, F., Levermore, C.D.: Global solutions of the Boltzmann equation over \(\mathbb{R}^d\) near global maxwellians with small mass. Commun. Math. Phys. 346(2), 435–467 (2016)
Berman, S.M.: Limiting distributions of the maximum term in sequences of dependent random variables. Ann. Math. Stat. 33, 3 (1962)
Broutin, N., Marckert J.-F.: The combinatorics of the colliding bullets problem. arXiv (2017)
Chu, J.T.: On the distribution of the sample median. Ann. Math. Stat. 26(1), 112–116 (1955)
Czirók, A., Barabási, A.-L., Vicsek, T.: Collective motion of self-propelled particles: kinetic phase transition in one dimension. Phys. Rev. Lett. 82, 209–212 (1999)
Droz, M., Rey, P.-A., Frachebourg, L., Piasecki, J.: Ballistic-annihilation kinetics for a multivelocity one-dimensional ideal gas. Phys. Rev. E 51, 6 (1995)
Dygert, B., Junge, M., Kinzel, C., Raymond, A., Slivken, E., Zhu, J.: The bullet problem with discrete speeds. arXiv (2016)
Frachebourg, L., Martin, P.A., Piasecki, J.: Ballistic aggregation: a solvable model of irreversible many particles dynamics. Physica A 279, 1 (2000)
Helbing, D.: Gas-kinetic derivation of Navier–Stokes-like traffic equations. Phys. Rev. E 53, 2366–2381 (1996)
Krapivsky, P.L., Redner, S., Leyvraz, F.: Ballistic annihilation kinetics: the case of discrete velocity distributions. Phys. Rev. E 51, 5 (1995)
Lao, W., Mayer, M.: U-max-statistics. J. Multivar. Anal. 99, 2039–2052 (2008)
Ligget, T.: Interacting Particle Systems: The Exclusion Process. Springer, Berlin (1985)
Martin, P.A., Piasecki, J.: One-dimensional ballistic aggregation: rigorous long-time estimates. J. Stat. Phys. 76, 1–2 (1994)
Rödenbeck, C., Kärger, J., Hahn, K.: Calculating exact propagators in single-file systems via the reflection principle. Phys. Rev. E 57, 4382–4397 (1998)
Sidoravicius, V., Tournier, L.: Note on a one-dimensional system of annihilating particles. arXiv (2016)
Silverman, B., Brown, T.: Short distances, flat triangles, and poisson limits. J. Appl. Probab. 15, 4 (1978)
Acknowledgements
A large number of simulations were required in the numerical reconstruction of the distribution of \(T^{(N)}/\left( {\begin{array}{c}N\\ 2\end{array}}\right) \) under elastic collisions and the investigation of \(M_t\) and \(M_T\) under non-elastic collisions. An allocation of computer time from the UA Research Computing High Performance Computing (HPC) at the University of Arizona is gratefully acknowledged. This material is based upon work supported Army Research Office (ARO) Grant W911NF-14-1-0179.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix: 1 Proof of Proposition 1
Suppose at the time of a collision, in addition to the change in velocity, the labels of particles are also switched. Unlike the case of elastic collisions, the path of a particle in space-time is not a straight line. Instead, individual particles follow piecewise linear trajectories where the slope of each segment changes by a factor of \(1-\epsilon \) after each intersection with another path. Again, let \(\ell _i(t)\) denote the position of the ith particle and \(\tau _{i,\star _1}<\tau _{i,\star _2}<\dots \) denote the times when the path of particle i intercepts the path of another particle. Then
As was the case for elastic collisions, the collection of intersection times of the trajectories of particles (now piecewise linear) is in one-to-one correspondence with the collection of collision times. Therefore, for a system to have infinitely many collision times, there must be two paths which intersect infinitely many times. In the case \(\epsilon = 1\), two particles remain fixed together following their collision so that they cannot collide a second time and the existence of a final collision time is thus trivial. As such, we focus on the case where \(\epsilon < 1.\) Then, since the initial velocities are continuous random variables, it follows that for all \(1\le i < j \le N\) and \(k,m \in \{0,1,2,\dots \}\), \((1-\epsilon )^k V_i \ne (1-\epsilon )^m V_j\) almost surely which ensures that any two paths which intersect do so by crossing one another a.s.
We now assume the paths \(\ell _1\) and \(\ell _2\) intersect infinitely often and derive a contradiction. Since the paths cross, we may choose two successive intersection times, \(s_1^{(2)}<s_2^{(2)}\), such that \(\ell _1(t) > \ell _2(t)\) for \(t\in (s_1^{(2)},s_2^{(2)})=\mathbb {S}^{(2)}.\) It may be the case that a third path also intersects \(\ell _1\) and \(\ell _2\) at time \(s_1^{(2)}\) or \(s_2^{(2)}\). However, we may relabel the paths so that a ternary intersection does not alter the velocities of paths \(\ell _1\) and \(\ell _2\) on the open interval \(\mathbb {S}^{(2)}.\)
For example, suppose \(\ell _3\) also intersects with \(\ell _1\) and \(\ell _2\) at \(s_1^{(2)}\) or \(s_2^{(2)}\). There are two possibilities. Firstly, \(\ell _3\) does not intersect \(\ell _1\) or \(\ell _2\) on the interval \((s_1^{(2)},s_2^{(2)}).\) Thus, \(\ell _3\) will not alter the velocities of \(\ell _1,\ell _2\) on this interval and so will not influence the time, \(s_2^{(2)}\), when \(\ell _1\) and \(\ell _2\) intersect again.
Secondly, \(\ell _3\) could intersect either \(\ell _1\) or \(\ell _2\) at a second time \(s\in (s_1^{(2)},s_2^{(2)}).\) For instance, suppose \(\ell _3\) intersects with \(\ell _1\) at times s and \(s_2^{(2)}\), and that \(\ell _3\) does not intersect \(\ell _2\) on the interval \((s,s_2^{(2)}).\) We can then relabel the paths and times so that, \(\ell _1\) and \(\ell _2\) (formerly \(\ell _1\) and \(\ell _3\)), intersect at successive times \(s_1^{(2)}\) and \(s_2^{(2)}\) (formerly s and \(s_2^{(2)}\)). Then on the interval \((s_1^{(2)},s_2^{(2)})\), the path \(\ell _3\) (formerly \(\ell _2\)) intersects with neither \(\ell _1\) nor \(\ell _3\). Other possibilities are handled similarly. As a result of this choice, on the closed interval \(\overline{\mathbb {S}^{(2)}}\), any path which crosses both \(\ell _1\) and \(\ell _2\) does so an equal number of times.
Let us return to case where \(\ell _1\) and \(\ell _2\) intersect at successive times \(s_2^{(1)}\) and \(s_2^{(2)}\) and \(\ell _1(t)>\ell _2(t)\) for \(t\in \mathbb {S}^{(2)}\). Furthermore, assume these paths are chosen so that there is no other path which intersects both \(\ell _1\) or \(\ell _2\) at \(s_1^{(2)}\) or \(s_2^{(2)}\) and either \(\ell _1\) or \(\ell _2\) at another time in the interval \(\mathbb {S}^{(2)}.\) Let
be the velocities of particles 1 and 2 immediately after their collision at \(s_1^{(2)}.\) Let
be the velocities of particles 1 and 2 immediately before their collision at \(s_2^{(2)}.\) Since \(\ell _1(t) > \ell _2(t)\) for \(t\in \mathbb {S}^{(2)}\) and the paths cross a.s., it follows that
We note that the velocities of both paths 1 and 2 must be of the same sign since \(U_i^-\) is related to \(u_i^+\) by the equation \(U_i^-=(1-\epsilon )^{k_i}u_i^+\) where \((1-\epsilon )^{k_1}>0\) and \(k_i\) is the number of additional path intersections of i during \(\mathbb {S}^{(2)}\).
Consider the path intersections involving \(\ell _1\) on the interval \(\mathbb {S}^{(2)}\) (Fig. 10). There are two possibilities. (1) A path, (shown as a dotted, red line in Fig. 10), crosses both \(\ell _1\) and \(\ell _2\) (the dashed, blue lines in Fig. 10) k times, and alters the velocities of both particles by a multiplicative factor of \((1-\epsilon )^k.\) Alternatively, (2) a path may only intersect \(\ell _1\) leaving the velocity of particle 2 unchanged (the solid black line in Fig. 10).
If only \(k_1\) intersections of the first type occur, then
which contradicts the assumption that \(U_1^- < U_2^-.\) Indeed, \(\ell _1\) and \(\ell _2\) must experience a different number of intersections, \(k_1\) and \(k_2\) respectively, so that
The details of the ordering of \(k_1\) and \(k_2\) depend on both the sign of \(u_1^+,u_2^+\) and on the sign of \(\epsilon .\) However, we may assume without loss of generality that \(k_1 > k_2 \ge 0.\)
Thus, there must be a path which intersects \(\ell _1\) at least twice without intersecting \(\ell _2\). Call it \(\ell _3\). Again, we may choose successive intersection times, \(s_1^{(3)} < s_2^{(3)}\) in \(\mathbb {S}^{(2)},\) such that \(\ell _1(t)>\ell _3(t)\) and repeat the preceding argument (Fig. 10).
As such, the existence of a kth path with successive intersections of \(\ell _1\) at times \(s_1^{(k)}<s_2^{(k)}\) then implies the existence of a \((k+1)\)th path which has successive intersections with \(\ell _1\) on a subinterval \(\mathbb {S}^{(k+1)}=(s_1^{(k+1)},s_2^{(k+1)})\subset (s_1^{(k)},s_2^{(k)})=\mathbb {S}^{(k)}\). By construction, \(\ell _2,\dots ,\ell _k\) cannot collide with \(\ell _1\) on \(\mathbb {S}^{(k+1)}\). Through induction we reach a contradiction as this requires an \((N+1)\)th path in a system with only N paths.
Appendix 2: Proof of Theorem 3
In this case, let \(\mu _N =\mu N \log (N)\). We now proceed by splitting the integrals g(X, V, N), again with the aim of extracting the O(1 / N) components of the integrals within g(X, V, N) as \(N\rightarrow \infty \).
The first integral in Eq. (B.1) over the interval \((0,\frac{1}{N\sqrt{\log N}})\) is \(O(\frac{1}{N\sqrt{\log N}})\). In the remaining integral, we first make the change of variables \(w\mapsto N\log N w.\)
Since \(w > \sqrt{\log N}\), we can make use of the scalings from Eq. (4.14) for \(F_x(X-\mu w)\) and \(1-F_x(X+\mu w)\) valid for \(\alpha =1\) and continue the preceding calculation.
We now bound the integral over the interval \((N\sqrt{\log N}, \infty )\).
To review, at this point we have shown that as N tends to infinity
The remaining integrals over the interval \((\sqrt{\log N},N\sqrt{\log N})\) account for O(1 / N) terms which give rise to the exponential, \(e^{-\frac{2f_v(V)}{\pi \mu }}\) from the theorem. Note that the correction terms, \(C/(\mu w \pm X)^2\), from the scaling in Eq. (4.14) give rise to corrections of the order \(C/\log N\) in the following display.
The correction in Eq. (B.5) therefore will be of order \(O(1/\log N)\). Now focus on the integrals
and deduce a limit. We apply the change of variable \(w\mapsto \frac{1}{N\sqrt{\log N}} w\).
By the assumption that \(f_v\) is continuous, it is uniformly continuous on the interval \([V,V+1]\). Thus \(f_v\big (V\pm \frac{w}{\sqrt{\log N}}\big ) = f_v(V) +o(1)\) as \(N\rightarrow \infty .\) Then,
Thus, as \(N\rightarrow \infty \)
which concludes the proof.
Appendix 3: Proof of Theorem 6
In this case, we take \(z_N(t) = t N^2 \log N \). We need only show the following two requirements of the limit law are satisfied:
The previous statements follow naturally from the asymptotic results derived in the proof of Theorem 3. Again, from Eq. (4.21) with \(z_N(t) = t N^2 \log N.\)
In the proof of Theorem 3, it was shown that for large N,
Replacing \(N \log N\) with \({2} N^2\log N\) and t with t / 2 in the previous statement, we have the following relationship for large N.
For the second requirement, we make use of the same asymptotic expansion as in Eq. (C.2).
which completes the proof.
Appendix 4: Counterexample to the Proof of Theorem 4 when \(E|X|<\infty \), \(E|X|^{3/2}=\infty \)
In the proof of Theorem 4, we verified the two requirements
as \(N\rightarrow \infty \). Recall that Eq. (D.1) followed from the assumption that \(E|X_1|<\infty \) and the continuity and boundedness of \(f_v\). However, Eq. (D.2) required the additional assumption that \(E|X_1|^{3/2}< \infty .\)
Suppose the initial positions of particles are distributed with a density
for \(\alpha \in (1,3/2]\). In this case, \(E|X_1|<\infty \), but \(E|X_1|^{3/2}\) does not exist. We now proceed to show Eq. (D.2) is not satisfied for this choice of density for the initial position. From the proof of Theorem 4, recall
which is bounded below by
Furthermore, we can restrict the region of integration to \(w_1,w_2\in (1,2)\) and \(X< -N(N-1) t\). In this case, \(X+\left( {\begin{array}{c}N\\ 2\end{array}}\right) tw\le 0\). Thus, by the symmetry of \(f_x\), it follows that \(1-F_x(X+\left( {\begin{array}{c}N\\ 2\end{array}}\right) tw) \ge 1/2\). Then,
For \(z \ll -1\), \(\int _{-\infty }^{z}f_x(z) dz \approx \frac{1}{|z|^\alpha }.\) In this case, we have assumed \(\alpha \in (1,3/2]\) so that as \(N\rightarrow \infty \),
Thus, Eq. (D.2) is not satisfied. As such, the proof of Theorem 4 does not apply for this choice of density for the initial position of particles.
Rights and permissions
About this article
Cite this article
Lega, J., Sethuraman, S. & Young, A.L. On Collisions Times of ‘Self-Sorting’ Interacting Particles in One-Dimension with Random Initial Positions and Velocities. J Stat Phys 170, 1088–1122 (2018). https://doi.org/10.1007/s10955-018-1974-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-018-1974-4
Keywords
- Interacting particles
- Maximal order statistics
- Binary collisions
- Collision times
- Molecular dynamics
- Exchangeable arrays