Related papers: Self-Stabilizing Repeated Balls-into-Bins
Bagging is an important technique for stabilizing machine learning models. In this paper, we derive a finite-sample guarantee on the stability of bagging for any model. Our result places no assumptions on the distribution of the data, on…
In the classical stochastic resetting problem, a particle, moving according to some stochastic dynamics, undergoes random interruptions that bring it to a selected domain, and then, the process recommences. Hitherto, the resetting mechanism…
Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled with colored units, balls or water, and some empty bins.…
Self-similarity of systems is very popular and intensively developing field during last decades. To this field belong so-called stable distributions and their generalization. In Klebanov and Sl\'amov\'a (2014) there was given an approach to…
We consider collective dynamics of self-propelling particles in two dimensions. They can align themselves according to the direction of propulsion of their neighbours, together with a random perturbation (i.e. rotational fluctuation). They…
In this article, we consider a configuration of weighted random balls in $\mathbb{R}^d$ generated according to a Poisson point process. The model investigated exhibits inhomogeneity, as well as dependence between the centers and the radii…
We describe an experiment dedicated to the study of the trajectories of a ball bouncing randomly on a vibrating plate. The system was originally used, considering a sinusoidal vibration, to illustrate period doubling and the route to chaos.…
Time-constrained decision processes have been ubiquitous in many fundamental applications in physics, biology and computer science. Recently, restart strategies have gained significant attention for boosting the efficiency of…
In this work we study the stochastic process of two-species coagulation. This process consists in the aggregation dynamics taking place in a ring. Particles and clusters of particles are set in this ring and they can move either clockwise…
In this paper, we introduce regularized stochastic team problems. Under mild assumptions, we prove that there exists an unique fixed point of the best response operator, where this unique fixed point is the optimal regularized team decision…
We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…
This paper studies a dynamic discrete-time queuing model where at every period players get a new job and must send all their jobs to a queue that has a limited capacity. Players have an incentive to send their jobs as late as possible;…
We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…
For many measure preserving dynamical systems $(\Omega,T,m)$ the successive hitting times to a small set is well approximated by a Poisson process on the real line. In this work we define a new process obtained from recording not only the…
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal processing, {\em etc.}, can be formulated as a problem of solving a…
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…
Replicability is essential in science as it allows us to validate and verify research findings. Impagliazzo, Lei, Pitassi and Sorrell (`22) recently initiated the study of replicability in machine learning. A learning algorithm is…
We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations,…
We consider the problem of self-stabilizing leader election in the population model by Angluin, Aspnes, Diamadi, Fischer, and Peralta (JDistComp '06). The population model is a well-established and powerful model for asynchronous,…
We investigate the reconfiguration of $n$ blocks, or "tokens", in the square grid using "line pushes". A line push is performed from one of the four cardinal directions and pushes all tokens that are maximum in that direction to the…