Related papers: N Bugs on a Circle
The goal of the present paper is to highlight the fundamental differences of so-called synchronization or consensus algorithms when the agents to synchronize evolve on a compact homogeneous manifold (like the circle, sphere or the group of…
The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…
We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…
We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…
We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…
We introduce conversion to the stochastic process known as chase-escape in an effort to model aspects of inflammatory damage from multiple sclerosis. We prove monotonicity results for aggregate damage for the model on the positive integers,…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
In this paper, we study temporal graphs arising from mobility models, where vertices correspond to agents moving in space and edges appear each time two agents meet. We propose a rather natural one-dimensional model. If each pair of agents…
Asymmetric obstacles can be exploited to direct the motion and induce sorting of run-and-tumbling particles. In this work, we show that flocking particles which follow the Vicsek model aligning rules experience a collective trapping in the…
The percolation threshold for flow or conduction through voids surrounding randomly placed spheres is rigorously calculated. With large scale Monte Carlo simulations, we give a rigorous continuum treatment to the geometry of the…
Pipe flow is a canonical example where turbulence first appears intermittently in space and time, taking the form of localized structures termed puffs. Turbulence spreads via puff self-replication, which must out-compete puff decays to…
Graph clustering is an important technique to understand the relationships between the vertices in a big graph. In this paper, we propose a novel random-walk-based graph clustering method. The proposed method restricts the reach of the…
Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…
We introduce \emph{Quantum Frog}, a two-player cooperative game built on a novel \emph{quantized-time} mechanic in which the environment advances only when a player acts. Inspired by the classic arcade game Frogger, Quantum Frog requires…
Clustering is one of the mayor collective phenomena observed in active matter. We study the overdamped motion of interacting active Brownian particles in two dimensions. An instability in the pair correlation function causes the onset of…
Bullets are fired, one per second, with independent speeds sampled uniformly from a discrete set. Collisions result in mutual annihilation. We show that the second fastest bullet survives with positive probability, while a slowest bullet…
We consider the problem of counting 4-cycles ($C_4$) in an undirected graph $G$ of $n$ vertices and $m$ edges (in bipartite graphs, 4-cycles are also often referred to as $\textit{butterflies}$). Most recently, Wang et al. (2019, 2022)…
We propose a one-way coupled model that tracks individual primary particles in a conceptually simple cellular flow setup to predict flocculation in turbulence. This computationally efficient model accounts for Stokes drag, lubrication,…
The problem of time-series clustering is considered in the case where each data-point is a sample generated by a piecewise stationary ergodic process. Stationary processes are perhaps the most general class of processes considered in…