SearcharxivSearch

arXiv · 2206.03887

Search efficiency in the Adam-Delbr\"uck reduction-of-dimensionality scenario versus direct diffusive search

Abstract

The time instant -- the first-passage time (FPT) -- when a diffusive particle (e.g., a ligand such as oxygen or a signalling protein) for the first time reaches an immobile target located on the surface of a bounded three-dimensional domain (e.g., a hemoglobin molecule or the cellular nucleus) is a decisive characteristic time-scale in diverse biophysical and biochemical processes, as well as in intermediate stages of various inter- and intra-cellular signal transduction pathways. Adam and Delbr\"uck put forth the reduction-of-dimensionality concept, according to which a ligand first binds non-specifically to any point of the surface on which the target is placed and then diffuses along this surface until it locates the target. In this work, we analyse the efficiency of such a scenario and confront it with the efficiency of a direct search process, in which the target is approached directly from the bulk and not aided by surface diffusion. We consider two situations: (i) a single ligand is launched from a fixed or a random position and searches for the target, and (ii) the case of "amplified" signals when $N$ ligands start either from the same point or from random positions, and the search terminates when the fastest of them arrives to the target. For such settings, we go beyond the conventional analyses, which compare only the mean values of the corresponding FPTs. Instead, we calculate the full probability density function of FPTs for both scenarios and study its integral characteristic -- the "survival" probability of a target up to time $t$. On this basis, we examine how the efficiencies of both scenarios are controlled by a variety of parameters and single out realistic conditions in which the reduction-of-dimensionality scenario outperforms the direct search.

Explore related subjects

Keep this discovery

BibTeXRIS

Denis S. Grebenkov, Ralf Metzler, Gleb Oshanin. 2022-06-08. Search efficiency in the Adam-Delbr\"uck reduction-of-dimensionality scenario versus direct diffusive search. https://doi.org/10.1088/1367-2630%2Fac8824

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

KEEP EXPLORING

Related papers

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

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

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