arXiv subjects

Arup Biswas

Publications and source records attributed to Arup Biswas.

10 recordsLinked to original sources

arXiv2026

When proofreading improves both speed and accuracy

Proofreading is generally thought to improve accuracy at the expense of speed. We show that this trade-off can be reversed in stochastic processes with long-lived stalled states. Using a non-Markovian renewal framework, we derive exact expressions for the error rate and completion time under proofreading for arbitrary stall-time distributions. Our analysis reveals that fluctuations in stall durations, rather than their mean alone, determine whether proofreading can simultaneously increase speed and accuracy. In the limit of strong stalling, this regime emerges when the coefficient of variation of the stall time exceeds a threshold set by the intrinsic error rate. These results provide a general criterion for proofreading in systems ranging from self-assembly and polymer replication to immune recognition and other nonequilibrium information-processing systems.

cond-mat.stat-mech↗

arXiv2026

Optimal threshold resetting in collective diffusive search

Stochastic resetting has attracted significant attention in recent years due to its wide-ranging applications across physics, biology, and search processes. In most existing studies, however, resetting events are governed by an external timer and remain decoupled from the system's intrinsic dynamics. In a recent Letter by Biswas et al, we introduced threshold resetting (TR) as an alternative, event-driven optimization strategy for target search problems. Under TR, the entire process is reset whenever any searcher reaches a prescribed threshold, thereby coupling the resetting mechanism directly to the internal dynamics. In this work, we study TR-enabled search by $N$ non-interacting diffusive searchers in a one-dimensional box $[0,L]$, with the target at the origin and the threshold at $L$. By optimally tuning the scaled threshold distance $u = x_0/L$, the mean first-passage time can be significantly reduced for $N \geq 2$. We identify a critical population size $N_c(u)$ below which TR outperforms reset-free dynamics. Furthermore, for fixed $u$, the mean first-passage time depends non-monotonically on $N$, attaining a minimum at $N_{\mathrm{opt}}(u)$. We also quantify the achievable speed-up and analyze the operational cost of TR, revealing a nontrivial optimization landscape. These findings highlight threshold resetting as an efficient and realistic optimization mechanism for complex stochastic search processes.

cond-mat.stat-mech↗

arXiv2025

Emulating microbial run-and-tumble and tactic motion by stochastically reorienting synthetic active Brownian particles

Replicating efficient and adaptable microbial navigation strategies, such as run and tumble (RnT) and tactic motions to synthetic active agents has been an enduring quest. To this end, we introduce a stochastic orientational reset (SOR) protocol, in which the propulsion direction of an active Brownian particle (ABP) is reassigned to a random orientation within a defined reset-cone. When the reset-cone is aligned with the instantaneous propulsion direction, ABPs reproduce the RnT dynamics of E. coli; when set along an attractant gradient, they exhibit taxis - with extensive adaptability in persistence through the angular width of the reset-cone and reset rate. We establish the robustness of this protocol across a broad range of swimming speeds using experiments, simulations, and analytical theory.

cond-mat.soft↗

arXiv2025

Target search optimization by threshold resetting

We introduce a new class of first passage time optimization driven by threshold resetting, inspired by many natural processes where crossing a critical limit triggers failure, degradation or transition. In here, search agents are collectively reset when a threshold is reached, creating event-driven, system-coupled simultaneous resets that induce long-range interactions. We develop a unified framework to compute search times for these correlated stochastic processes, with ballistic- and diffusive searchers as key examples uncovering diverse optimization behaviors. A cost function, akin to breakdown penalties, reveals that optimal resetting can forestall larger losses. This formalism generalizes to broader stochastic systems with multiple degrees of freedom.

cond-mat.stat-mech↗

arXiv2024

A resetting particle embedded in a viscoelastic bath

We examine the behavior of a colloidal particle immersed in a viscoelastic bath undergoing stochastic resetting at a rate $r$. Microscopic probes suspended in viscoelastic environment do not follow the classical theory of Brownian motion. This is primarily because the memory from successive collisions between the medium particles and the probes does not necessarily decay instantly as opposed to the classical Langevin equation. To treat such a system one needs to incorporate the memory effects to the Langevin equation. The resulting equation formulated by Kubo, known as the Generalized Langevin equation (GLE), has been instrumental to describe the transport of particles in inhomogeneous or viscoelastic environments. The purpose of this work, henceforth, is to study the behavior of such a colloidal particle governed by the GLE under resetting dynamics. To this end, we extend the renewal formalism to compute the general expression for the position variance and the correlation function of the resetting particle driven by the environmental memory. These generic results are then illustrated for the prototypical example of the Jeffreys viscoelastic fluid model. In particular, we identify various timescales and intermittent plateaus in the transient phase before the system relaxes to the steady state; and further discuss the effect of resetting pertaining to these behaviors. Our results are supported by numerical simulations showing an excellent agreement.

cond-mat.stat-mech↗

arXiv2024

Drift-diffusive resetting search process with stochastic returns: speed-up beyond optimal instantaneous return

Stochastic resetting has emerged as a useful strategy to reduce the completion time for a broad class of first passage processes. In the canonical setup, one intermittently resets a given system to its initial configuration only to start afresh and continue evolving in time until the target goal is met. This is, however, an instantaneous process and thus less feasible for any practical purposes. A crucial generalization in this regard is to consider a finite-time return process which has significant ramifications to the first passage properties. Intriguingly, it has recently been shown that for diffusive search processes, returning in finite but stochastic time can gain significant speed-up over the instantaneous resetting process. Unlike diffusion which has a diverging mean completion time, in this paper, we ask whether this phenomena can also be observed for a first passage process with finite mean completion time. To this end, we explore the set-up of a classical drift-diffusive search process in one dimension with stochastic resetting and further assume that the return phase is modulated by a potential $U(x)=\lambda |x|$ with $\lambda>0$. For this process, we compute the mean first passage time exactly and underpin its characteristics with respect to the resetting rate and potential strength. We find a unified phase space that allows us to explore and identify the system parameter regions where stochastic return supersedes over both the underlying process and the process under instantaneous resetting. Furthermore and quite interestingly, we find that for a range of parameters the mean completion time under stochastic return protocol can be reduced further than the \textit{optimally restarted} instantaneous processes. We thus believe that resetting with stochastic returns can serve as a better optimization strategy owing to its dominance over classical first passage under resetting.

cond-mat.stat-mech↗

arXiv2024

Current fluctuations in finite-sized one-dimensional non-interacting passive and active systems

We investigate the problem of effusion of particles initially confined in a finite one-dimensional box of size $L$. We study both passive as well active scenarios, involving non-interacting diffusive particles and run-and-tumble particles, respectively. We derive analytic results for the fluctuations in the number of particles exiting the boundaries of the finite confining box. The statistical properties of this quantity crucially depend on how the system is prepared initially. Two common types of averages employed to understand the impact of initial conditions in stochastic systems are annealed and quenched averages. It is well known that for an infinitely extended system, these different initial conditions produce quantitatively different fluctuations, even in the infinite time limit. We demonstrate explicitly that in finite systems, annealed and quenched fluctuations become equal beyond a system-size dependent timescale, $t \sim L^2$. For diffusing particles, the fluctuations exhibit a $\sqrt{t}$ growth at short times and decay as $1/\sqrt{t}$ for time scales, $t \gg L^2/D$, where $D$ is the diffusion constant. Meanwhile, for run-and-tumble particles, the fluctuations grow linearly at short times and then decay as $1/\sqrt{t}$ for time scales, $t \gg L^2/D_{\text{eff}}$, where $D_{\text{eff}}$ represents the effective diffusive constant for run-and-tumble particles. To study the effect of confinement in detail, we also analyze two different setups (i) with one reflecting boundary and (ii) with both boundaries open.

cond-mat.stat-mech↗

arXiv2024

Queues with resetting: a perspective

Performance modeling is a key issue in queuing theory and operation research. It is well-known that the length of a queue that awaits service or the time spent by a job in a queue depends not only on the service rate, but also crucially on the fluctuations in service time. The larger the fluctuations, the longer the delay becomes and hence, this is a major hindrance for the queue to operate efficiently. Various strategies have been adapted to prevent this drawback. In this perspective, we investigate the effects of one such novel strategy namely resetting or restart, an emerging concept in statistical physics and stochastic complex process, that was recently introduced to mitigate fluctuations-induced delays in queues. In particular, we show that a service resetting mechanism accompanied with an overhead time can remarkably shorten the average queue lengths and waiting times. We examine various resetting strategies and further shed light on the intricate role of the overhead times to the queuing performance. Our analysis opens up future avenues in operation research where resetting-based strategies can be universally promising.

cond-mat.stat-mech↗

arXiv2023

Rate enhancement of gated drift-diffusion process by optimal resetting

`Gating' is a widely observed phenomenon in biochemistry that describes the transition between the activated (or open) and deactivated (or closed) states of an ion-channel, which makes transport through that channel highly selective. In general, gating is a mechanism that imposes an additional restriction on a transport, as the process ends only when the `gate' is open and continues otherwise. When diffusion occurs in presence of a constant bias to a {\it gated} target, i.e., to a target that switches between an open and a closed state, the dynamics essentially slows down compared to {\it ungated} drift-diffusion, resulting in an increase in the mean completion time. In this work, we utilize stochastic resetting as an external protocol to counterbalance the delay due to gating. We consider a particle that undergoes drift-diffusion in the presence of a stochastically gated target and is moreover subjected to a rate-limiting resetting dynamics. Calculating the minimal mean completion time rendered by an optimal resetting for this exactly-solvable system, we construct a phase diagram that owns three distinct phases: (i) where resetting can make gated drift-diffusion faster even compared to the original ungated process, (ii) where resetting still expedites gated drift-diffusion, but not beyond the original ungated process, and (iii) where resetting fails to expedite gated drift-diffusion. Gated drift-diffusion aptly models various stochastic processes such as chemical reactions that exclusively take place for certain activated state of the reactants. Our work predicts the conditions where stochastic resetting can act as a useful strategy to enhance the rate of such processes without compromising on their selectivity.

cond-mat.stat-mech↗

arXiv2023

Search with stochastic home-returns can expedite classical first passage under resetting

Classical first passage under resetting is a paradigm in the search process. Despite its multitude of applications across interdisciplinary sciences, experimental realizations of such resetting processes posit practical challenges in calibrating these zero time irreversible transitions. Here, we consider a strategy in which resetting is performed using finite time return protocols in lieu of instantaneous returns. These controls could also be accompanied with random fluctuations or errors allowing target detection even during the return phase. To better understand the phenomena, we develop a unified renewal approach that can encapsulate arbitrary search processes centered around home in a fairly general topography containing targets, various resetting times and return mechanisms in arbitrary dimensions. While such finite-time protocols would apparently seem to prolong the overall search time in comparison to the instantaneous resetting process, we show \textit{on the contrary} that a significant speed-up can be gained by leveraging the stochasticity in home-returns. The formalism is then explored to reveal a universal criterion distilling the benefits of this strategy. We demonstrate how this general principle can be utilized to improve overall performance of a one-dimensional diffusive search process reinforced with experimentally feasible parameters. We believe that such strategies designed with inherent randomness can be made optimal with precise controllability in complex search processes.

cond-mat.stat-mech↗