More Like this

1. A local stochastic algorithm for separation in heterogeneous self-organizing particle systems

   Cannon, Sarah; Daymude, Joshua J.; Gokmen, Cem; Randall, Dana; Richa, Andrea W. (August 2019, pproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019))

   We present and rigorously analyze the behavior of a distributed, stochastic algorithm for separation and integration in self-organizing particle systems, an abstraction of programmable matter. Such systems are composed of individual computational particles with limited memory, strictly local communication abilities, and modest computational power. We consider heterogeneous particle systems of two different colors and prove that these systems can collectively separate into different color classes or integrate, indifferent to color. We accomplish both behaviors with the same fully distributed, local, stochastic algorithm. Achieving separation or integration depends only on a single global parameter determining whether particles prefer to be next to other particles of the same color or not; this parameter is meant to represent external, environmental influences on the particle system. The algorithm is a generalization of a previous distributed, stochastic algorithm for compression (PODC '16), which can be viewed as a special case of separation where all particles have the same color. It is significantly more challenging to prove that the desired behavior is achieved in the heterogeneous setting, however, even in the bichromatic case we focus on. This requires combining several new techniques, including the cluster expansion from statistical physics, a new variant of the bridging argument of Miracle, Pascoe and Randall (RANDOM '11), the high-temperature expansion of the Ising model, and careful probabilistic arguments. 

   more » « less
2. Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems

   Kedia, Hridesh; Oh, Shunhao; Randall, Dana (January 2022, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022))

   We present local distributed, stochastic algorithms for alignment in self-organizing particle systems (SOPS) on two-dimensional lattices, where particles occupy unique sites on the lattice, and particles can make spatial moves to neighboring sites if they are unoccupied. Such models are abstractions of programmable matter, composed of individual computational particles with limited memory, strictly local communication abilities, and modest computational capabilities. We consider oriented particle systems, where particles are assigned a vector pointing in one of q directions, and each particle can compute the angle between its direction and the direction of any neighboring particle, although without knowledge of global orientation with respect to a fixed underlying coordinate system. Particles move stochastically, with each particle able to either modify its direction or make a local spatial move along a lattice edge during a move. We consider two settings: (a) where particle configurations must remain simply connected at all times and (b) where spatial moves are unconstrained and configurations can disconnect. Our algorithms are inspired by the Potts model and its planar oriented variant known as the planar Potts model or clock model from statistical physics. We prove that for any q ≥ 2, by adjusting a single parameter, these self-organizing particle systems can be made to collectively align along a single dominant direction (analogous to a solid or ordered state) or remain non-aligned, in which case the fraction of particles oriented along any direction is nearly equal (analogous to a gaseous or disordered state). In the connected SOPS setting, we allow for two distinct parameters, one controlling the ferromagnetic attraction between neighboring particles (regardless of orientation) and the other controlling the preference of neighboring particles to align. We show that with appropriate settings of the input parameters, we can achieve compression and expansion, controlling how tightly gathered the particles are, as well as alignment or nonalignment, producing a single dominant orientation or not. While alignment is known for the Potts and clock models at sufficiently low temperatures, our proof in the SOPS setting are significantly more challenging because the particles make spatial moves, not all sites are occupied, and the total number of particles is fixed. 

   more » « less
3. A Heterogeneous Schelling Model for Wealth Disparity and its Effect on Segregation

   https://doi.org/10.1145/3551624.3555293  

   Zhao, Zhanzhan; Randall, Dana (October 2022, EAAMO '22: Equity and Access in Algorithms, Mechanisms, and Optimization)

   The Schelling model of segregation was introduced in economics to show how micro-motives can influence macro-behavior. Agents on a lattice have two colors and try to move to a different location if the number of their neighbors with a different color exceeds some threshold. Simulations reveal that even such mild local color preferences, or homophily, are sufficient to cause segregation. In this work, we propose a stochastic generalization of the Schelling model, based on both race and wealth, to understand how carefully architected placement of incentives, such as urban infrastructure, might affect segregation. In our model, each agent is assigned one of two colors along with a label, rich or poor. Further, we designate certain vertices on the lattice as “urban sites,” providing civic infrastructure that most benefits the poorer population, thus incentivizing the occupation of such vertices by poor agents of either color. We look at the stationary distribution of a Markov process reflecting these preferences to understand the long-term effects. We prove that when incentives are large enough, we will have ”urbanization of poverty,” an observed effect whereby poor people tend to congregate on urban sites. Moreover, even when homophily preferences are very small, if the incentives are large and there is income inequality in the two-color classes, we can get racial segregation on urban sites but integration on non-urban sites. In contrast, we find an overall mitigation of segregation when the urban sites are distributed throughout the lattice and the incentives for urban sites exceed the homophily biases. We prove that in this case, no matter how strong homophily preferences are, it will be exponentially unlikely that a configuration chosen from stationarity will have large, homogeneous clusters of agents of either color, suggesting we will have racial integration with high probability. 

   more » « less
4. Boundary homogenization for patchy surfaces trapping patchy particles

   https://doi.org/10.1063/5.0135048  

   Plunkett, Claire E.; Lawley, Sean D. (March 2023, The Journal of Chemical Physics)

   Trapping diffusive particles at surfaces is a key step in many systems in chemical and biological physics. Trapping often occurs via reactive patches on the surface and/or the particle. The theory of boundary homogenization has been used in many prior works to estimate the effective trapping rate for such a system in the case that either (i) the surface is patchy and the particle is uniformly reactive or (ii) the particle is patchy and the surface is uniformly reactive. In this paper, we estimate the trapping rate for the case that the surface and the particle are both patchy. In particular, the particle diffuses translationally and rotationally and reacts with the surface when a patch on the particle contacts a patch on the surface. We first formulate a stochastic model and derive a five-dimensional partial differential equation describing the reaction time. We then use matched asymptotic analysis to derive the effective trapping rate, assuming that the patches are roughly evenly distributed and occupy a small fraction of the surface and the particle. This trapping rate involves the electrostatic capacitance of a four-dimensional duocylinder, which we compute using a kinetic Monte Carlo algorithm. We further use Brownian local time theory to derive a simple heuristic estimate of the trapping rate and show that it is remarkably close to the asymptotic estimate. Finally, we develop a kinetic Monte Carlo algorithm to simulate the full stochastic system and then use these simulations to confirm the accuracy of our trapping rate estimates and homogenization theory. 

   more » « less
5. Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes

   https://doi.org/10.4230/LIPIcs.DISC.2022.51  

   Oh, Shunhao Oh; Randall, Dana; Richa, Andréa W (January 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)

   Scheideler, Christian (Ed.)

   The foraging problem asks how a collective of particles with limited computational, communication and movement capabilities can autonomously compress around a food source and disperse when the food is depleted or shifted, which may occur at arbitrary times. We would like the particles to iteratively self-organize, using only local interactions, to correctly gather whenever a food particle remains in a position long enough and search if no food particle has existed recently. Unlike previous approaches, these search and gather phases should be self-induced so as to be indefinitely repeatable as the food evolves, with microscopic changes to the food triggering macroscopic, system-wide phase transitions. We present a stochastic foraging algorithm based on a phase change in the fixed magnetization Ising model from statistical physics: Our algorithm is the first to leverage self-induced phase changes as an algorithmic tool. A key component of our algorithm is a careful token passing mechanism ensuring a dispersion broadcast wave will always outpace a compression wave. 

   more » « less