Related papers: Self-Stabilizing Repeated Balls-into-Bins
We study the motion of classical particles confined in a two-dimensional "nuclear" billiard whose walls undergo periodic shape oscillations according to a fixed multipolarity. The presence of a coupling term in the single particle…
We revisit finite-state communicating systems with round-based communication under mailbox semantics. Mailboxes correspond to one FIFO buffer per process (instead of one buffer per pair of processes in peer-to-peer systems). Round-based…
We consider an infinite balls-in-boxes occupancy scheme with boxes organised in nested hierarchy, and random probabilities of boxes defined in terms of iterated fragmentation of a unit mass. We obtain a multivariate functional limit theorem…
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine…
In the presented work we study, by means of numerical simulations, the behaviour of a suspension of active ring polymers in the bulk and under lateral confinement. When changing the separation between the confining planes and the polymers'…
We develop a rigorous analytical framework for a coupled stochastic fluid-rigid body system in $\mathbb{R}^3$. The model describes the motion of a rigid ball immersed in an incompressible Newtonian fluid subjected to both additive noise in…
We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to…
This paper presents a randomized self-stabilizing algorithm that elects a leader $r$ in a general $n$-node undirected graph and constructs a spanning tree $T$ rooted at $r$. The algorithm works under the synchronous message passing network…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
We explore a novel theoretical model for studying the performance of distributed storage management systems where the data-centers have limited capacities (as compared to storage space requested by the users). Prior schemes such as…
Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes of volume $\lambda$ is…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits…
Algorithms for computing equilibria, optima, and fixed points in nonconvex problems often depend sensitively on practitioner-chosen initial conditions. When uniqueness of a solution is of interest, a common heuristic is to run such…
Stochastic processes that are randomly reset to an initial condition serve as a showcase to investigate non-equilibrium steady states. However, all existing results have been restricted to the special case of memoryless resetting protocols.…
Q-balls -- whether in the single-field or multi-field context -- are usually studied in theories containing only one stabilising symmetry. However, this is not the most general scenario. In this paper, we study a class of theories with…
Consider a weighted branching process generated by a point process on $[0,1]$, whose atoms sum up to one. Then the weights of all individuals in any given generation sum up to one, as well. We define a nested occupancy scheme in random…
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon,…
We study the steady state of the abelian sandpile models with stochastic toppling rules. The particle addition operators commute with each other, but in general these operators need not be diagonalizable. We use their abelian algebra to…
We consider load scheduling on constrained continuous-time linear dynamical systems, such as automated irrigation and other distribution networks. The requested loads are rigid, i.e., the shapes cannot be changed. Hence, it is only possible…