Related papers: Synchronization via interacting reinforcement
Consider throwing $n$ balls at random into $m$ urns, each ball landing in urn $i$ with probability $p_i$. Let $S$ be the resulting number of singletons, i.e., urns containing just one ball. We give an error bound for the Kolmogorov distance…
In the classical Polya urn problem, one begins with $d$ bins, each containing one ball. Additional balls arrive one at a time, and the probability that an arriving ball is placed in a given bin is proportional to $m^\gamma$, where $m$ is…
Synchronization, the emergence of spontaneous order in coupled systems, is of fundamental importance in both physical and biological systems. We demonstrate the synchronization of two dissimilar silicon nitride micromechanical oscillators,…
We present a necessary and sufficient condition for a random product of maps on a compact metric space to be (strongly) synchronizing on average.
Consider a number, finite or not, of urns each with fixed capacity $r$ and balls randomly distributed among them. An overflow is the number of balls that are assigned to urns that already contain $r$ balls. When $r=1$, using analytic…
Carpets of actively bending cilia represent arrays of biological oscillators that can exhibit self-organized metachronal synchronization in the form of traveling waves of cilia phase. This metachronal coordination supposedly enhances fluid…
Features of synchronization picture in the system with the limit cycle embedded in a three-dimensional phase space are considered. By the example of Ressler system and Dmitriev - Kislov generator under the action of a periodic sequence of…
We construct a system of $N$ interacting particles on the unit sphere $S^{d-1}$ in $d$-dimensional space, which has $d$-body interactions only. The equations have a gradient formulation derived from a rotationally-invariant potential of a…
In a recent article by Chapuy and Perarnau, it was shown that a uniformly chosen automaton on $n$ states with a $2$-letter alphabet has a synchronizing word of length $O(\sqrt{n}\log n)$ with high probability. In this note, we improve this…
We study a new class of time inhomogeneous P\'olya-type urn schemes and give optimal rates of convergence for the distribution of the properly scaled number of balls of a given color to nearly the full class of generalized gamma…
An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitting the urns. In the simplest case, there is a finite number…
This paper studies a very general urn model stimulated by designs in clinical trials, where the number of balls of different types added to the urn at trial n depends on a random outcome directed by the composition at trials 1,2,...,n-1.…
Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may…
Synchronization is a widespread phenomenon observed in physical, biological, and social networks, which persists even under the influence of strong noise. Previous research on oscillators subject to common noise has shown that noise can…
While generic competitive systems exhibit mixtures of hierarchy and cycles, real-world systems are predominantly hierarchical. We demonstrate and extend a mechanism for hierarchy; systems with similar agents approach perfect hierarchy in…
We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…
P\'olya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule depends on the colour of the drawn ball and the value of…
In this paper we address two questions about the synchronization of coupled oscillators in the Kuramoto model with all-to-all coupling. In the first part we use some classical results in convex geometry to prove bounds on the size of the…
Random perturbations applied in tandem to an ensemble of oscillating objects can synchronize their motion. We study multiple copies of an arbitrary dynamical system in a stable limit cycle, described via a standard phase reduction picture.…
We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different…