Related papers: N Bugs on a Circle
We find using Monte Carlo simulation the phase structure of noncommutative U(1) gauge theory in two dimensions with the fuzzy sphere S^2_N as a non-perturbative regulator. There are three phases of the model. i) A matrix phase where the…
The classical multi-agent rendezvous problem asks for a deterministic algorithm by which $n$ points scattered in a plane can move about at constant speed and merge at a single point, assuming each point can use only the locations of the…
We study the robust maximum flow problem and the robust maximum flow over time problem where a given number of arcs $\Gamma$ may fail or may be delayed. Two prominent models have been introduced for these problems: either one assigns flow…
A simplified prisoner's game is studied on a square lattice when the players interacting with their neighbors can follow only two strategies: to cooperate (C) or to defect (D) unconditionally. The players updated in a random sequence have a…
Homoclinic snaking is a widespread phenomenon observed in many pattern-forming systems. Demonstrating its occurrence in non-perturbative regimes has proven difficult, although a forcing theory has been developed based on the identification…
We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…
Intransitivity is a property of connected, oriented graphs representing species interactions that may drive their coexistence even in the presence of competition, the standard example being the three species Rock-Paper-Scissors game. We…
We consider a one-dimensional system of particles, moving at constant velocities chosen independently according to a symmetric distribution on $\{-1,0,+1\}$, and annihilating upon collision -- with, in case of triple collision, a uniformly…
The persistence probability, $P_C(t)$, of a cluster to remain unaggregated is studied in cluster-cluster aggregation, when the diffusion coefficient of a cluster depends on its size $s$ as $D(s) \sim s^\gamma$. In the mean-field the problem…
The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled unit squares within a $4 \times 4$ board in which the goal is to slide the squares (without ever overlapping) into a target configuration. By generalizing the…
We bound the time it takes for a group of birds to reach steady state in a standard flocking model. We prove that (i) within single exponential time fragmentation ceases and each bird settles on a fixed flying direction; (ii) the flocking…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
We study the characterization of multipartite entanglement for the random states of an $n$-qbit system. Unable to solve the problem exactly we generalize it, changing complex numbers into real vectors with $N_c$ components (the original…
Some microbial organisms are known to randomly slip into and out of hibernation, irrespective of environmental conditions [1]. In a (genetically) uniform population a typically very small subpopulation becomes metabolically inactive whereas…
Let X be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the "forward" neighbours of the actual state, i.e., it does not go back along the…
Flocculation is the process whereby particles (i.e., flocs) in suspension reversibly combine and separate. The process is widespread in soft matter and aerosol physics as well as environmental science and engineering. We consider a general…
We study the motion of two non-interacting quantum particles performing a random walk on a line and analyze the probability that the two particles are detected at a particular position after a certain number of steps (meeting problem). The…
We consider a random walk among a Poisson cloud of moving traps on ${\mathbb Z}^d$, where the walk is killed at a rate proportional to the number of traps occupying the same position. In dimension $d=1$, we have previously shown that under…
A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction (chirality), they are activated by an adversarial…
We prove a shape theorem for a growing set of simple random walks on Z^d, known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent discrete time SRWs, and sleeping…