English
Related papers

Related papers: Entropy involved in fidelity of DNA replication

200 papers

We investigate how to measure and define the entropy of a simple chaotic system, three hard spheres on a ring. A novel approach is presented, which does not assume the ergodic hypothesis. It consists of transforming the particles collision…

Computational Physics · Physics 2023-05-08 Matej Vedak , Graeme J Ackland

This thesis consolidates, improves and extends the smooth entropy framework for non-asymptotic information theory and cryptography. We investigate the conditional min- and max-entropy for quantum states, generalizations of classical R\'enyi…

Quantum Physics · Physics 2015-03-20 Marco Tomamichel

We survey and introduce concepts and tools located at the intersection of information theory and network biology. We show that Shannon's information entropy, compressibility and algorithmic complexity quantify different local and global…

Molecular Networks · Quantitative Biology 2015-12-14 Hector Zenil , Narsis A. Kiani , Jesper Tegnér

The stretched exponential function, $\exp[-(t/\tau_{K})^{\beta}]$, describes various relaxation processes while it has been suggested that the power exponent, $\beta$ is derived from the non-uniformity of the process. In this paper, we…

Soft Condensed Matter · Physics 2018-09-12 Hirokazu Maruoka , Akio Nishimura , Makoto Yoshida , Keisuke Hatada

We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural…

Disordered Systems and Neural Networks · Physics 2013-05-30 James West , Lucas Lacasa , Simone Severini , Andrew Teschendorff

We calculate Shannon information entropy of trapped interacting bosons in both the position and momentum spaces, $S_r$ and $S_k$ respectively. The total entropy maintains the fuctional form $S=a + b \ln N$ for repulsive bosons. At the…

Quantum Gases · Physics 2013-01-25 Sudip Kumar Haldar , Barnali Chakrabarti

As an application of generalised statistical mechanics, it is studied a possible route toward a consistent generalised information theory in terms of a family of non-extensive, non-parametric entropies $H^\pm_D(P)$. Unlike other proposals…

Information Theory · Computer Science 2021-03-23 Jesús Fuentes , Octavio Obregón

The Shannon entropy of a random variable has much behaviour analogous to a signed measure. Previous work has explored this connection by defining a signed measure on abstract sets, which are taken to represent the information that different…

Information Theory · Computer Science 2025-05-28 Keenan J. A. Down , Pedro A. M. Mediano

We use the formalism of 'Maximum Principle of Shannon's Entropy' to derive the general power law distribution function, using what seems to be a reasonable physical assumption, namely, the demand of a constant mean "internal order"…

Statistical Mechanics · Physics 2007-05-23 Yaniv Dover

Shannon's metric of "Entropy" of information is a foundational concept of information theory. This article is a primer for novices that presents an intuitive way of understanding, remembering, and/or reconstructing Shannon's Entropy metric…

Information Theory · Computer Science 2014-05-09 Sriram Vajapeyam

According to E.T. Jaynes and E.P. Wigner, entropy is an anthropomorphic concept in the sense that in a physical system correspond many thermodynamic systems. The physical system can be examined from many points of view each time examining…

Information Theory · Computer Science 2015-12-03 Panteleimon Rodis

The deterministic notions of capacity and entropy are studied in the context of communication and storage of information using square-integrable, bandlimited signals subject to perturbation. The $(\epsilon,\delta)$-capacity, that extends…

Information Theory · Computer Science 2015-04-21 Massimo Franceschetti , Taehyung J. Lim

We present a study of the equilibration process of nonequilibrium systems by means of molecular dynamics simulation technique. The nonequilibrium conditions are achieved in systems by defining velocity components of the constituent atoms…

Statistical Mechanics · Physics 2015-10-30 A. Giri , Nilangshu K. Das , P. Barat

Information plays an important role in our understanding of the physical world. We hence propose an entropic measure of information for any physical theory that admits systems, states and measurements. In the quantum and classical world,…

Quantum Physics · Physics 2010-05-04 Anthony J. Short , Stephanie Wehner

The scientific method relies on the iterated processes of inference and inquiry. The inference phase consists of selecting the most probable models based on the available data; whereas the inquiry phase consists of using what is known about…

Machine Learning · Statistics 2015-05-19 N. K. Malakar , K. H. Knuth

DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We study the random access coverage depth problem and focus on…

Information Theory · Computer Science 2025-07-29 Şeyma Bodur , Stefano Lia , Hiram H. López , Rati Ludhani , Alberto Ravagnani , Lisa Seccia

The distribution functions of the codon usage probabilities, computed over all the available GenBank data, for 40 eukaryotic biological species and 5 chloroplasts, do not follow a Zipf law, but are best fitted by the sum of a constant, an…

Condensed Matter · Physics 2009-11-10 L. Frappat , A. Sciarrino , P. Sorba

We characterize information as risk reduction between knowledge states represented by partitions of the underlying probability space. Entropy corresponds to risk reduction from no (or partial) knowledge to full knowledge about a random…

Information Theory · Computer Science 2026-02-24 Sebastian Gottwald , Daniel A. Braun

It was recently shown that estimating the Shannon entropy $H({\rm p})$ of a discrete $k$-symbol distribution ${\rm p}$ requires $\Theta(k/\log k)$ samples, a number that grows near-linearly in the support size. In many applications $H({\rm…

Information Theory · Computer Science 2016-03-11 Jayadev Acharya , Alon Orlitsky , Ananda Theertha Suresh , Himanshu Tyagi

Shannon's fundamental bound for perfect secrecy says that the entropy of the secret message cannot be larger than the entropy of the secret key initially shared by the sender and the legitimate receiver. Massey gave an information theoretic…

Information Theory · Computer Science 2016-11-17 Siu-Wai Ho , Terence H. Chan , Alex Grant , Chinthani Uduwerelle
‹ Prev 1 3 4 5 6 7 10 Next ›