arXiv subjects

Tsvi Tlusty

Publications and source records attributed to Tsvi Tlusty.

78 records · Page 5Linked to original sources

arXiv2010

A relation between the multiplicity of the second eigenvalue of a graph Laplacian, Courant's nodal line theorem and the substantial dimension of tight polyhedral surfaces

This note discusses a relation between the multiplicity m of the second eigenvalue λ2 of a Laplacian on a graph G, tight mappings of G and a discrete analogue of Courant's nodal line theorem. For a certain class of graphs, we show that the m-dimensional eigenspace of λ2 is tight and thus defines a tight mapping of G into an m-dimensional Euclidean space. The tightness of the mapping is shown to set Colin de Verdière's upper bound on the maximal λ2-multiplicity, where chr(γ(G)) is the chromatic number and γ(G) is the genus of G.

math-ph↗

arXiv2010

A model for the emergence of the genetic code as a transition in a noisy information channel

The genetic code maps the sixty-four nucleotide triplets (codons) to twenty amino-acids. Some argue that the specific form of the code with its twenty amino-acids might be a 'frozen accident' because of the overwhelming effects of any further change. Others see it as a consequence of primordial biochemical pathways and their evolution. Here we examine a scenario in which evolution drives the emergence of a genetic code by selecting for an amino-acid map that minimizes the impact of errors. We treat the stochastic mapping of codons to amino-acids as a noisy information channel with a natural fitness measure. Organisms compete by the fitness of their codes and, as a result, a genetic code emerges at a supercritical transition in the noisy channel, when the mapping of codons to amino-acids becomes nonrandom. At the phase transition, a small expansion is valid and the emergent code is governed by smooth modes of the Laplacian of errors. These modes are in turn governed by the topology of the error-graph, in which codons are connected if they are likely to be confused. This topology sets an upper bound - which is related to the classical map-coloring problem - on the number of possible amino-acids. The suggested scenario is generic and may describe a mechanism for the formation of other error-prone biological codes, such as the recognition of DNA sites by proteins in the transcription regulatory network.

q-bio.QM↗

arXiv2010

Casting Polymer Nets to Optimize Noisy Molecular Codes

Life relies on the efficient performance of molecular codes, which relate symbols and meanings via error-prone molecular recognition. We describe how optimizing a code to withstand the impact of molecular recognition noise may be approximated by the statistics of a two-dimensional network made of polymers. The noisy code is defined by partitioning the space of symbols into regions according to their meanings. The "polymers" are the boundaries between these regions and their statistics defines the cost and the quality of the noisy code. When the parameters that control the cost-quality balance are varied, the polymer network undergoes a first-order transition, where the number of encoded meanings rises discontinuously. Effects of population dynamics on the evolution of molecular codes are discussed.

q-bio.QM↗

arXiv2010

A simple model for the evolution of molecular codes driven by the interplay of accuracy, diversity and cost

Molecular codes translate information written in one type of molecules into another molecular language. We introduce a simple model that treats molecular codes as noisy information channels. An optimal code is a channel that conveys information accurately and efficiently while keeping down the impact of errors. The equipoise of the three conflicting needs, for minimal error-load, minimal cost of resources and maximal diversity of vocabulary, defines the fitness of the code. The model suggests a mechanism for the emergence of a code when evolution varies the parameters that control this equipoise and the mapping between the two molecular languages becomes non-random. This mechanism is demonstrated by a simple toy model that is formally equivalent to a mean-field Ising magnet.

q-bio.QM↗

arXiv2010

A rate-distortion scenario for the emergence and evolution of noisy molecular codes

We discuss, in terms of rate-distortion theory, the fitness of molecular codes as the problem of designing an optimal information channel. The fitness is governed by an interplay between the cost and quality of the channel, which induces smoothness in the code. By incorporating this code fitness into population dynamics models, we suggest that the emergence and evolution of molecular codes may be explained by simple channel design considerations.

q-bio.MN↗

arXiv2010

A colorful origin for the genetic code: Information theory, statistical mechanics and the emergence of molecular codes

The genetic code maps the sixty-four nucleotide triplets (codons) to twenty amino-acids. While the biochemical details of this code were unraveled long ago, its origin is still obscure. We review information-theoretic approaches to the problem of the code's origin and discuss the results of a recent work that treats the code in terms of an evolving, error-prone information channel. Our model - which utilizes the rate-distortion theory of noisy communication channels - suggests that the genetic code originated as a result of the interplay of the three conflicting evolutionary forces: the needs for diverse amino-acids, for error-tolerance and for minimal cost of resources. The description of the code as an information channel allows us to mathematically identify the fitness of the code and locate its emergence at a second-order phase transition when the mapping of codons to amino-acids becomes nonrandom. The noise in the channel brings about an error-graph, in which edges connect codons that are likely to be confused. The emergence of the code is governed by the topology of the error-graph, which determines the lowest modes of the graph-Laplacian and is related to the map coloring problem.

q-bio.GN↗