Specific protein-protein binding in many-component mixtures of proteins

Proteins must bind to specific other proteins in vivo in order to function. The proteins must bind only to one or a few other proteins of the of order a thousand proteins typically present in vivo. Using a simple model of a protein, specific binding in many component mixtures is studied. It is found to be a demanding function in the sense that it demands that the binding sites of the proteins be encoded by long sequences of bits, and the requirement for specific binding then strongly constrains these sequences. This is quantified by the capacity of proteins of a given size (sequence length), which is the maximum number of specific-binding interactions possible in a mixture. This calculation of the maximum number possible is in the same spirit as the work of Shannon and others on the maximum rate of communication through noisy channels.Comment: 13 pages, 3 figures (changes for v2 mainly notational - to be more in line with notation in information theory literature

Thermodynamic time asymmetry in nonequilibrium fluctuations

We here present the complete analysis of experiments on driven Brownian motion and electric noise in a $RC$ circuit, showing that thermodynamic entropy production can be related to the breaking of time-reversal symmetry in the statistical description of these nonequilibrium systems. The symmetry breaking can be expressed in terms of dynamical entropies per unit time, one for the forward process and the other for the time-reversed process. These entropies per unit time characterize dynamical randomness, i.e., temporal disorder, in time series of the nonequilibrium fluctuations. Their difference gives the well-known thermodynamic entropy production, which thus finds its origin in the time asymmetry of dynamical randomness, alias temporal disorder, in systems driven out of equilibrium.Comment: to be published in : Journal of Statistical Mechanics: theory and experimen

Quantum Capacity Approaching Codes for the Detected-Jump Channel

The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit-flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel

The classical capacity of quantum thermal noise channels to within 1.45 bits

We find a tight upper bound for the classical capacity of quantum thermal noise channels that is within $1/\ln 2$ bits of Holevo's lower bound. This lower bound is achievable using unentangled, classical signal states, namely displaced coherent states. Thus, we find that while quantum tricks might offer benefits, when it comes to classical communication they can only help a bit.Comment: Two pages plus a bi

Information capacity of genetic regulatory elements

Changes in a cell's external or internal conditions are usually reflected in the concentrations of the relevant transcription factors. These proteins in turn modulate the expression levels of the genes under their control and sometimes need to perform non-trivial computations that integrate several inputs and affect multiple genes. At the same time, the activities of the regulated genes would fluctuate even if the inputs were held fixed, as a consequence of the intrinsic noise in the system, and such noise must fundamentally limit the reliability of any genetic computation. Here we use information theory to formalize the notion of information transmission in simple genetic regulatory elements in the presence of physically realistic noise sources. The dependence of this "channel capacity" on noise parameters, cooperativity and cost of making signaling molecules is explored systematically. We find that, at least in principle, capacities higher than one bit should be achievable and that consequently genetic regulation is not limited the use of binary, or "on-off", components.Comment: 17 pages, 9 figure

Using mutual information to measure order in model glass-formers

Whether or not there is growing static order accompanying the dynamical heterogeneity and increasing relaxation times seen in glassy systems is a matter of dispute. An obstacle to resolving this issue is that the order is expected to be amorphous and so not amenable to simple order parameters. We use mutual information to provide a general measurement of order that is sensitive to multi-particle correlations. We apply this to two glass-forming systems (2D binary mixtures of hard disks with different size ratios to give varying amounts of hexatic order) and show that there is little growth of amorphous order in the system without crystalline order. In both cases we measure the dynamical length with a four-point correlation function and find that it increases significantly faster than the static lengths in the system as density is increased. We further show that we can recover the known scaling of the dynamic correlation length in a kinetically constrained model, the 2-TLG.Comment: 10 pages, 12 Figure

D-brane width

Loop quantum gravity predicts that there are non-zero minimal area, and non-zero minimal volume in (3+1) dimensions. Given this, one can easily guess that one will have a non-zero minimal 9-volume in (9+1) dimensions. Therefore, in this paper, we argue that not only D9-brane but also Dp-brane for p less than 9 has a 9-volume. This idea is new, as the present view states that such a Dp-brane has p-volume but no 9 volume. To demonstrate this, first, we equate D8-brane action with D9-brane action and show that 9th direction which is perpendicular to D8-brane has non-zero width. We repeat this step for different ps; we equate Dp-brane action with Dp-1 brane action. By this iteration and induction we conclude that Dp-brane has non-zero widths for each of (9-p) directions perpendicular to the Dp-brane, and therefore, non-zero volume. When antisymmetric tensor and field strength are zero, this width is calculated to be 2 pi sqrt(alpha') for all (9-p) directions. For non-vanishing antisymmetric tensor and field strength, the width receives small corrections. In this paper, we only calculate up to the first order correction.Comment: 4 pages, no figures, argument based on loop quantum gravity adde

Robust Algorithm to Generate a Diverse Class of Dense Disordered and Ordered Sphere Packings via Linear Programming

We have formulated the problem of generating periodic dense paritcle packings as an optimization problem called the Adaptive Shrinking Cell (ASC) formulation [S. Torquato and Y. Jiao, Phys. Rev. E {\bf 80}, 041104 (2009)]. Because the objective function and impenetrability constraints can be exactly linearized for sphere packings with a size distribution in $d$-dimensional Euclidean space $\mathbb{R}^d$, it is most suitable and natural to solve the corresponding ASC optimization problem using sequential linear programming (SLP) techniques. We implement an SLP solution to produce robustly a wide spectrum of jammed sphere packings in $\mathbb{R}^d$ for $d=2,3,4,5$ and $6$ with a diversity of disorder and densities up to the maximally densities. This deterministic algorithm can produce a broad range of inherent structures besides the usual disordered ones with very small computational cost by tuning the radius of the {\it influence sphere}. In three dimensions, we show that it can produce with high probability a variety of strictly jammed packings with a packing density anywhere in the wide range $[0.6, 0.7408...]$. We also apply the algorithm to generate various disordered packings as well as the maximally dense packings for $d=2,3, 4,5$ and 6. Compared to the LS procedure, our SLP protocol is able to ensure that the final packings are truly jammed, produces disordered jammed packings with anomalously low densities, and is appreciably more robust and computationally faster at generating maximally dense packings, especially as the space dimension increases.Comment: 34 pages, 6 figure

Group entropies, correlation laws and zeta functions

The notion of group entropy is proposed. It enables to unify and generalize many different definitions of entropy known in the literature, as those of Boltzmann-Gibbs, Tsallis, Abe and Kaniadakis. Other new entropic functionals are presented, related to nontrivial correlation laws characterizing universality classes of systems out of equilibrium, when the dynamics is weakly chaotic. The associated thermostatistics are discussed. The mathematical structure underlying our construction is that of formal group theory, which provides the general structure of the correlations among particles and dictates the associated entropic functionals. As an example of application, the role of group entropies in information theory is illustrated and generalizations of the Kullback-Leibler divergence are proposed. A new connection between statistical mechanics and zeta functions is established. In particular, Tsallis entropy is related to the classical Riemann zeta function.Comment: to appear in Physical Review