Related papers: A note on dispersing particles on a line
Optical microscopy and multi-particle tracking are used to investigate the cross-correlated diffusion of quasi two-dimensional (2D) colloidal particles near an oil-water interface. It is shown that the effect of the interface on correlated…
Consider a sequence of masses $m_0,m_1,...$ arriving uniformly at random at some points $u_0,u_1,...$ on the unit circle $\mathbb{R}/\mathbb{Z}$ (or on $\mathbb{Z}/n\mathbb{Z}$, in the discrete version). Upon arrival, each mass undergoes a…
We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…
We study analytically and numerically a model of random sequential adsorption (RSA) of segments on a line, subject to some constraints suggested by two kinds of physical situations: - deposition of dimers on a lattice where the sites have a…
We present general existence and uniqueness results for marked models with pair interactions, exemplified through Gibbs point processes on path space. More precisely, we study a class of infinite-dimensional diffusions under Gibbsian…
We investigate a branching random walk where the displacements are independent from the branching mechanism and have a stretched exponential distribution. We describe the positions of the particles in the vicinity of the rightmost particle…
An unsupervised classification method for point events occurring on a network of lines is proposed. The idea relies on the distributional flexibility and practicality of random partition models to discover the clustering structure featuring…
We investigate the number $N_{d,r}(s)$ of $(s, s+r)$-core integer partitions with $d$-distinct parts. Our first main result is a proof of a recurrence relation conjectured by Sahin in 2018. We also derive generating functions, asymptotics,…
Synchronization is one of the emerging collective phenomena in interacting particle systems. Its ubiquitous presence in nature, science, and technology has fascinated the scientific community over the decades. Moreover, a great deal of…
We preprocess the input subdivision with $n$ points on the plane in $O(n\sqrt{\log n})$ time to facilitate point location in constant time. Previously the preprocessing time is $O(n\log n)$ and point location takes $O(\log n)$ time.
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
Consider a system of independent random walks in the discrete torus with creation-annihilation of particles and possible explosion of the total number of particles in finite time. Rescaling space and rates for…
This work studies queues in a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide…
We consider the classic infinite occupancy scheme, where balls are thrown in boxes independently, with probability $p_j$ of hitting box $j$. Each time a box receives its first ball we speak of a record and, more generally, call an…
Given a set $P$ of $n$ points in the plane, we consider the problem of computing the number of points of $P$ in a query unit disk (i.e., all query disks have the same radius). We show that the main techniques for simplex range searching in…
We consider a collection of weakly interacting diffusion processes moving in a two-scale locally periodic environment. We study the large deviations principle of the empirical distribution of the particles' positions in the combined limit…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
We investigate the growth of the total number of particles in a symmetric exclusion process driven by a localized source. The average total number of particles entering an initially empty system grows with time as t^{1/2} in one dimension,…
Finite-size impurities suspended in incompressible flows distribute inhomogeneously, leading to a drastic enhancement of collisions. A description of the dynamics in the full position-velocity phase space is essential to understand the…