Related papers: Sorting by Resetting
In the first place, a novel, yet straightforward in-place integer value-sorting algorithm is presented. It sorts in linear time using constant amount of additional memory for storing counters and indices beside the input array. The…
Diffusion with stochastic resetting, instantaneous returns of a diffusing particle to a reference point, creates a stationary probability distribution. The paradigm is extended here to a doubly stochastic protocol in which the resetting…
The escape of the randomly accelerated undamped particle from the finite interval under action of stochastic resetting is studied. The motion of such a particle is described by the full Langevin equation and the particle is characterized by…
We study a Brownian particle diffusing under a time-modulated stochastic resetting mechanism to a fixed position. The rate of resetting r(t) is a function of the time t since the last reset event. We derive a sufficient condition on r(t)…
We analytically investigate the dynamic behavior of an an-isotropic active Brownian particle under various stochastic resetting protocols in two dimensions. The motion of shape-asymmetric active Brownian particles in two dimensions leads to…
We consider the motion of a randomly accelerated particle in one dimension under stochastic resetting mechanism. Denoting the position and velocity by $x$ and $v$ respectively, we consider two different resetting protocols - (i) complete…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
Stochastic resetting models diverse phenomena across numerous scientific disciplines. Current understanding stems from the renewal framework, which relates systems subject to global resetting to their non-resetting counterparts. Yet, in…
We consider a particle undergoing run and tumble dynamics, in which its velocity stochastically reverses, in one dimension. We study the addition of a Poissonian resetting process occurring with rate $r$. At a reset event the particle's…
Brownian diffusion subject to stochastic resetting to a fixed position has been widely studied for applications to random search processes. In an unbounded domain, the mean first-passage time at a target site can be minimized for a…
Proper management of resources whose arrival and consumption are subject to environmental randomness is an intrinsic process in both natural and artificial systems. This phenomenon can be modeled as a queuing process whose arrival…
We study two Brownian particles in dimension $d=1$, diffusing under an interacting resetting mechanism to a fixed position. The particles are subject to a constant drift, which biases the Brownian particles toward each other. We derive the…
We numerically demonstrate bidirectional sorting of flocking particles interacting with an array of asymmetric barriers. Each particle aligns with the average swimming direction of its neighbors according to the Vicsek model and experiences…
Packing of particles in confined environments is a common problem in multiple fields. Here, based on the two-dimensional Hertzian particle model, we study the packing of deformable spherical particles under compression, and reveal the…
We study stochastic resetting of a probe particle in a viscoelastic environment where only the probe is reset while the medium retains memory of its past dynamics. Using a minimal model with finite correlation time, we analyze the…
Stabilizing thermodynamically unstable phases in many-body systems, such as suppressing pathological neuronal synchronization in Parkinson's disease or maintaining magnetic order across broad temperature ranges, remains a persistent…
In sorting situations where the final destination of each item is known, it is natural to repeatedly choose items and place them where they belong, allowing the intervening items to shift by one to make room. (In fact, a special case of…
This paper considers the problem of rearrangement planning, i.e finding a sequence of manipulation actions that displace multiple objects from an initial configuration to a given goal configuration. Rearrangement is a critical skill for…
Ranking metrics are a family of metrics largely used to evaluate recommender systems. However they typically suffer from the fact the reward is affected by the order in which recommended items are displayed to the user. A classical way to…
Resetting, in which a system is regularly returned to a given state after a fixed or random duration, has become a useful strategy to optimize the search performance of a system. While earlier theoretical frameworks focused on instantaneous…