Related papers: Local Stochastic Algorithms for Alignment in Self-…
A theory of structure is formulated for systems of many structureless classical particles with stable local interactions in Euclidean space. Such systems are shown to have their structure in thermodynamic equilibrium determined exactly by a…
Closed quantum systems with quenched randomness exhibit many-body localized regimes wherein they do not equilibrate even though prepared with macroscopic amounts of energy above their ground states. We show that such localized systems can…
Limited resources motivate decomposing large-scale problems into smaller,``local" subsystems and stitching together the so-found solutions. We explore the physics underlying this approach and discuss the concept of ``local hardness", i.e.,…
When fluids of anisotropic molecules are placed in temperature gradients, the molecules may align themselves along the gradient: this is called thermo-orientation. We discuss the theory of this effect in a fluid of particles that interact…
We numerically examine a system of monodisperse self-propelled particles interacting with each other via simple steric forces and aligning torques moving through a periodic array of obstacles. Without obstacles, this system shows a…
Leader election is a fundamental problem in distributed computing, particularly within programmable matter systems, where coordination among simple computational entities is crucial for solving complex tasks. In these systems, particles…
We investigate the steady-state organisation of active particles residing on an interface. Particle activity induces interface deformations, while the local shape of the interface guides particle movement. We consider multiple species of…
Self-assembly of particles with short-range attraction and long-range repulsion (SALR) interactions on a flat and on a spherical surface is compared. Molecular dynamics (MD) simulations are performed for the two systems having the same area…
We discuss a unified approach to stochastic optimization of pseudo-Boolean objective functions based on particle methods, including the cross-entropy method and simulated annealing as special cases. We point out the need for auxiliary…
We present a numerical study of charged particle motion in a time-independent magnetic field in cylindrical geometry. The magnetic field model consists of an unperturbed reversed-shear helical part and a perturbation consisting of a…
We present an alternative algorithm to global fitting procedures to construct Parton Distribution Functions (PDFs) parametrizations. The proposed algorithm uses Self-Organizing Maps (SOMs) which at variance with the standard Neural…
Numerical heating in particle-in-cell (PIC) codes currently precludes the accurate simulation of cold, relativistic plasma over long periods, severely limiting their applications in astrophysical environments. We present a spatially…
The problem of electing a unique leader is central to all distributed systems, including programmable matter systems where particles have constant size memory. In this paper, we present a silent self-stabilising, deterministic, stationary,…
Detecting and analyzing the local environment is crucial for investigating the dynamical processes of crystal nucleation and shape colloidal particle self-assembly. Recent developments in machine learning provide a promising avenue for…
It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classification of mixed states in terms of convex sets. We present a simple algorithmic procedure to…
We introduce and study a simple and natural class of solvable stochastic lattice gases. This is the class of \emph{Strong Particles}. The name is due to the fact that when they try to jump to an occupied site they succeed pushing away a…
In computer networks, participants may cooperate in processing tasks, so that loads are balanced among them. We present local distributed algorithms that (repeatedly) use local imbalance criteria to transfer loads concurrently across the…
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…
In a self-organizing particle system, an abstraction of programmable matter, simple computational elements called particles with limited memory and communication self-organize to solve system-wide problems of movement, coordination, and…
We consider the spectral and dynamical properties of quantum systems of $n$ particles on the lattice $\Z^d$, of arbitrary dimension, with a Hamiltonian which in addition to the kinetic term includes a random potential with iid values at the…