Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.21883

Stochastic 1D search-and-capture as a G/M/c queueing model

José Giral-Barajas·Paul C Bressloff
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the accumulation of resources within a target due to the interplay between continual delivery, driven by 1D stochastic search processes, and sequential consumption. The assumption of sequential consumption is key because it changes the commonly used $G/M/\infty$ queue to a $G/M/c$ queue. Combining the theory of $G/M/c$ queues with the theory of first-passage times, we derive general conditions for the search process to ensure that the number of resources within the queue converges to a steady state and compute explicit expressions for the mean and variance of the number of resources within the queue at steady state. We then compare the performance of the $G/M/c$ queue with that of the $G/M/\infty$ queue for an increasing number of servers. We extend the model to consider two competing targets and show that, under specific scenarios, an additional target is beneficial to the original target. Finally, we study the effects of multiple searchers. Using renewal theory, we numerically compute the inter-arrival time density for $M$ searchers in the Laplace space, which allows us to exploit the explicit expressions for the steady-state statistics of the number of resources within $G/M/1$ and $G/M/\infty$ queues, and compare their behaviour with different numbers of searchers. Overall, the $G/M/c$ queue shows a tighter dependence on the configuration of the search process than the $G/M/\infty$ queue does.

Explore related subjects

cond-mat.stat-mech

Keep this discovery

BibTeXRIS

José Giral-Barajas, Paul C Bressloff. 2025-03-27. Stochastic 1D search-and-capture as a G/M/c queueing model. https://doi.org/10.1088/1751-8121%2Fadfbb3

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗