Related papers: Sorting by Resetting
Biological systems perform complex multi-step processes in a reproducible way despite underlying stochasticity. The standard explanation is micromanagement by molecular machinery that recognizes and corrects specific errors. Here we study…
We consider a one-dimensional gas of $N$ independent Brownian particles subject to simultaneous stochastic resetting, with inter-reset times drawn from a general waiting-time distribution $\psi(\tau)$. This includes the well-known…
Restarting a stochastic search process can accelerate its completion by providing an opportunity to take a more favorable path with each reset. This strategy, known as stochastic resetting, is well studied in random processes. Here, we…
The transport of particles through channels holds immense significance in physics, chemistry, and biological sciences. For instance, the motion of solutes through biological channels is facilitated by specialized proteins that create…
The effects of a stochastic reset, to its initial configuration, is studied in the exactly solvable one-dimensional coagulation-diffusion process. A finite resetting rate leads to a modified non-equilibrium stationary state. If in addition…
In sorting literature, comparative statics for multidimensional assignment models with general output functions and input distributions is an important open question. We provide a complete theory of comparative statics for technological…
There has been a recent revolution in the ability to manipulate micrometer-sized objects on surfaces patterned by traps or obstacles of controllable configurations and shapes. One application of this technology is to separate particles…
Inspired by many examples in nature, stochastic resetting of random processes has been studied extensively in the past decade. In particular, various models of stochastic particle motion were considered where upon resetting the particle is…
We study the non-equilibrium steady states and first passage properties of a Brownian particle with position $X$ subject to an external confining potential of the form $V(X)=\mu|X|$, and that is switched on and off stochastically. Applying…
Positional reasoning is the process of ordering unsorted parts contained in a set into a consistent structure. We present Positional Diffusion, a plug-and-play graph formulation with Diffusion Probabilistic Models to address positional…
We present an algorithm determining where to relocate objects inside a cluttered and confined space while rearranging objects to retrieve a target object. Although methods that decide what to remove have been proposed, planning for the…
In this paper we consider the one-dimensional dynamical evolution of a particle traveling at constant speed and performing, at a given rate, random reversals of the velocity direction. The particle is subject to stochastic resetting,…
The equilibrium properties of a system of passive diffusing particles in an external magnetic field are unaffected by the Lorentz force. In contrast, active Brownian particles exhibit steady-state phenomena that depend on both the strength…
This article introduces an adaptive sorting algorithm that can relocate elements accurately by substituting their values into a function which we name it the guessing function. We focus on building this function which is the mapping…
The state of many physical, biological and socio-technical systems evolves by combining smooth local transitions and abrupt resetting events to a set of reference values. The inclusion of the resetting mechanism not only provides the…
For planning rearrangements of objects in a clutter, it is required to know the goal configuration of the objects. However, in real life scenarios, this information is not available most of the time. We introduce a novel method that…
We study a one-dimensional gas of $N$ Brownian particles that diffuse independently, but are {\it simultaneously} reset to the origin at a constant rate $r$. The system approaches a non-equilibrium stationary state (NESS) with long-range…
We formalize a new paradigm for optimality of algorithms, that generalizes worst-case optimality based only on input-size to problem-dependent parameters including implicit ones. We re-visit some existing sorting algorithms from this…
Stochastic resetting is a driving mechanism that is known to minimize the first passage time to reach a target, at the cost of energy expenditure. The choice of the physical implementation of each resetting event determines the tradeoff…
This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a…