SearcharxivSearch

arXiv · 1810.00166

Target Search of a Protein on DNA in the Presence of Position-dependent Bias

Abstract

We study the target searching on the DNA for proteins in the presence of non-constant drift and non-Gaussian $\alpha$-stable L\'evy fluctuations. The target searching is realized by the facilitated diffusion process. The existing works are about this problem in the case of constant drift. Starting from a non-local Fokker-Planck equation with a "sink" term, we obtain the possibility density function for the protein occurring at position $x$ on time $t$. Based on this, we further compute the survival probability and the first arrival density in order to quantify the searching mechanisms. The numerical results show that in the linear drift case, there is an optimal $\alpha$ index for the search to be most likely successful (searching reliability reaches its maximum). This optimal $\alpha$ index depends on initial position-target separation. It is also found that the diffusion intensity plays a positive role in improving the searching success. The nonlinear double-well drift could drive the protein to reach the target with a larger possibility than the linear drag at initial time period, but viewing at the long time evolution, the linear drift is more beneficial for target searching success. In contrast to the linear drift case, the search reliability and efficiency with nonlinear drift have a monotonic relationship with the $\alpha$ index, that is, the smaller the $\alpha$ index is, the more possibly a protein finds its target.

Explore related subjects

Keep this discovery

BibTeXRIS

Xi Chen, Xiujun Cheng, Yanmei Kang, Jinqiao Duan. 2018-09-29. Target Search of a Protein on DNA in the Presence of Position-dependent Bias. https://doi.org/10.1088/1742-5468/ab00e0

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