Related papers: Self-Stabilizing Repeated Balls-into-Bins
Self-stabilizing protocols enable distributed systems to recover correct behavior starting from any arbitrary configuration. In particular, when processors communicate by message passing, fake messages may be placed in communication links…
Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…
A disordered solid, such as an athermal jammed packing of soft spheres, exists in a rugged potential-energy landscape in which there are a myriad of stable configurations that defy easy enumeration and characterization. Nevertheless, in…
In the balls-into-bins setting, $n$ balls are thrown uniformly at random into $n$ bins. The na\"{i}ve way to generate the final load vector takes $\Theta(n)$ time. However, it is well-known that this load vector has with high probability…
We consider finite configurations of particles and holes sampled according to Bernoulli product measure and with a second class particle added to a random position. The stabilization time is the number of steps needed to reach an ordered…
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this…
Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…
We study population protocols, a model of distributed computing appropriate for modeling well-mixed chemical reaction networks and other physical systems where agents exchange information in pairwise interactions, but have no control over…
We prove that the probability that a sum of independent random variables in $\mathbb{R}^d$ with bounded densities lies in a ball is maximized by taking uniform distributions on balls. This in turn generalizes a result by Rogozin on the…
This thesis develops exact analytical tools to study strongly correlated stochastic systems, with a focus on extreme value statistics, gap statistics, and full counting statistics in multi-particle processes. A central contribution is the…
A box-ball system (BBS) is a discrete dynamical system consisting of n balls in an infinite strip of boxes. During each BBS move, the balls take turns jumping to the first empty box, beginning with the smallest-numbered ball. The one-line…
A protocol is proposed to generate singlet states of three logical qubits constructed by pairs of spins. Single and multiple operations of logical qubits are studied for the construction of an effective Hamiltonian, with which robust…
Linear dynamical systems are canonical models for learning-based control of plants with uncertain dynamics. The setting consists of a stochastic differential equation that captures the state evolution of the plant understudy, while the true…
A self-stabilizing protocol has the capacity to recover a legitimate behavior whatever is its initial state. The majority of works in self-stabilization assume a shared memory model or a communication using reliable and FIFO channels. In…
The Bernoulli sieve is a version of the classical `balls-in-boxes' occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative renewal process, also known as the residual allocation model or…
The problem of total-order (uniform reliable) broadcast is fundamental in fault-tolerant distributed computing since it abstracts a broad set of problems requiring processes to uniformly deliver messages in the same order in which they were…
Self-organization creates new order and shifts sub-boundaries while reorganizing energy and entropy within a control volume. This article examines pathway selection and tests whether maximizing the entropy generation rate can forecast…
In the distributed backup-placement problem each node of a network has to select one neighbor, such that the maximum number of nodes that make the same selection is minimized. This is a natural relaxation of the perfect matching problem, in…
In the balanced allocations framework, there are $m$ jobs (balls) to be allocated to $n$ servers (bins). The goal is to minimize the gap, the difference between the maximum and the average load. Peres, Talwar and Wieder (RSA 2015) used the…
Speed-robust scheduling is the following two-stage problem of scheduling $n$ jobs on $m$ uniformly related machines. In the first stage, the algorithm receives the value of $m$ and the processing times of $n$ jobs; it has to partition the…