English
Related papers

Related papers: A note on dispersing particles on a line

200 papers

We establish a connection between tagged particles and size-biased empirical processes in interacting particle systems, in analogy to classical results on the propagation of chaos. In a mean-field scaling limit, the evolution of the…

Probability · Mathematics 2026-03-03 Angeliki Koutsimpela , Stefan Grosskinsky

We show uniqueness of the spine of a Fleming-Viot particle system under minimal assumptions on the driving process. If the driving process is a continuous time Markov process on a finite space, we show that asymptotically, when the number…

Probability · Mathematics 2015-07-27 Mariusz Bieniek , Krzysztof Burdzy

We consider a system of charged particles moving on the real line driven by electrostatic interactions. Since we consider charges of both signs, collisions might occur in finite time. Upon collision, some of the colliding particles are…

Analysis of PDEs · Mathematics 2022-07-01 Patrick van Meurs , Mark A. Peletier , Norbert Pozar

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…

Probability · Mathematics 2010-11-16 Leonid Petrov

A novel mechanism for the transport of microscale particles in viscous fluids is demonstrated. The mechanism exploits the trapping of such particles by rotational streaming cells established in the vicinity of an oscillating cylinder,…

Fluid Dynamics · Physics 2016-01-13 Kwitae Chong , Scott D. Kelly , Stuart T. Smith , Jeff D. Eldredge

We introduce a model of self-propelled particles carrying out a Brownian motion with a diffusion coefficient which depends on the local density of particles within a certain finite radius. Numerical simulations show that in a range of…

Statistical Mechanics · Physics 2009-11-11 Cristobal Lopez

We consider the non-overlapping irreversible random sequential adsorption (RSA) process on one-dimensional finite line, which is known also as the car parking process. The probability of each coverage in saturating states is analytically…

Statistical Mechanics · Physics 2008-12-03 Masatomo Iwasa , Kyohei Fukuda

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

In the recent trend of extending discrete-to-continuum limit passages for gradient flows of single-species particle systems with singular and nonlocal interactions to particles of opposite sign, any annihilation effect of particles with…

Analysis of PDEs · Mathematics 2019-01-01 Patrick van Meurs , Marco Morandotti

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

Metric Geometry · Mathematics 2007-05-23 Christopher J. Hillar , Darren L. Rhea

We consider a symmetric finite-range contact process on $\mathbb{Z}$ with two types of particles (or infections), which propagate according to the same supercritical rate and die (or heal) at rate $1$. Particles of type $1$ can enter any…

Probability · Mathematics 2022-02-22 Mariela Pentón Machado

We obtain general bounds on scattering processes involving charged particles in 1+1 spacetime dimensions. After a general analysis we derive mostly numerical bounds on couplings in theories with $O(N)$ and $U(N)$ global symmetries. The…

High Energy Physics - Theory · Physics 2020-02-25 Miguel F. Paulos , Zechuan Zheng

We consider a system of annihilating particles where particles start from the points of a Poisson process on either the full-line or positive half-line and move at constant i.i.d. speeds until collision. When two particles collide, they…

Probability · Mathematics 2017-02-14 Vladas Sidoravicius , Laurent Tournier

Let S(1) be the segment [-1,1], and define the segments S(n) recursively in the following manner: let S(n+1) be the intersection of S(n) and a(n+1) + S(1), where the point a(n+1) is chosen randomly on the segment S(n) with uniform…

Probability · Mathematics 2011-09-28 Gergely Ambrus , Péter Kevei , Viktor Vígh

We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…

Logic · Mathematics 2026-04-08 Lyra A. Gardiner

We study the behaviour of the rightmost occupied site in two models: the Spont process and the contact process with inherited sterility, in dimension 1. Both can be viewed as contact processes evolving in dynamic random environments, where…

Probability · Mathematics 2025-10-24 Isabella Alvarenga , Aurelia Deshayes

We introduce diffusions on a space of interval partitions of the unit interval that are stationary with the Poisson-Dirichlet laws with parameters $(\alpha,0)$ and $(\alpha,\alpha)$. The construction has two steps. The first is a general…

Probability · Mathematics 2019-10-18 Noah Forman , Soumik Pal , Douglas Rizzolo , Matthias Winkel

We study translation-invariant determinantal random point fields on the real line. We prove, under quite general conditions, that the smallest nearest spacings between the particles in a large interval have Poisson statistics as the length…

Probability · Mathematics 2007-05-23 Alexander Soshnikov

We construct a modified Arratia flow with mass and energy conservation. We suppose that particles have a mass obeying the conservation law, and their diffusion is inversely proportional to the mass. Our main result asserts that such a…

Probability · Mathematics 2017-09-28 Vitalii Konarovskyi

In this paper we consider the problem of locating $k$ obnoxious facilities (congruent disks of maximum radius) amidst $n$ demand points (existing repulsive facility sites) ordered from left to right in the plane so that none of the existing…

Computational Geometry · Computer Science 2022-05-13 Vishwanath R. Singireddy , Manjanna Basappa