English
Related papers

Related papers: Information without rolling dice

200 papers

In this paper, we present some results on information, complexity and entropy as defined below and we discuss their relations with the Kolmogorov-Sinai entropy which is the most important invariant of a dynamical system. These results have…

Dynamical Systems · Mathematics 2019-08-17 Vieri Benci , Claudio Bonanno , Stefano Galatolo , Giulia Menconi , Federico Ponchio

In this research article, we use the Shannon's formalism to investigate the quantum information entropy of a particle trapped by the Aharonov-Bohm-type effect. For quantum information study, it is necessary to investigate the eigenstates of…

Quantum Physics · Physics 2023-05-31 F. C. E. Lima , A. R. P. Moreira , C. A. S. Almeida , C. O. Edet , N. Ali

We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'. We discuss the extent to which Kolmogorov's and Shannon's…

Information Theory · Computer Science 2008-09-17 Peter D. Grunwald , Paul M. B. Vitanyi

We investigate the concept of entropy in probabilistic theories more general than quantum mechanics, with particular reference to the notion of information causality recently proposed by Pawlowski et. al. (arXiv:0905.2992). We consider two…

We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…

Logic in Computer Science · Computer Science 2010-10-20 Marie Ferbus-Zanda , Serge Grigorieff

We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be…

Information Theory · Computer Science 2013-10-30 Tarik Kaced , Andrei Romashchenko

The information processing capacity of a complex dynamical system is reflected in the partitioning of its state space into disjoint basins of attraction, with state trajectories in each basin flowing towards their corresponding attractor.…

Disordered Systems and Neural Networks · Physics 2007-05-23 Peter Krawitz , Ilya Shmulevich

We propose a compression-based version of the empirical entropy of a finite string over a finite alphabet. Whereas previously one considers the naked entropy of (possibly higher order) Markov processes, we consider the sum of the…

Information Theory · Computer Science 2011-04-05 Paul M. B. Vitányi

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

Information Theory · Computer Science 2013-02-28 Amir Ingber , Ram Zamir , Meir Feder

This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol…

Information Theory · Computer Science 2010-06-11 Georg Bocherer , Valdemar Cardoso da Rocha Junior , Cecilio Pimentel

This paper studies the Shannon regime for the random displacement of stationary point processes. Let each point of some initial stationary point process in $\R^n$ give rise to one daughter point, the location of which is obtained by adding…

Information Theory · Computer Science 2015-03-17 Venkat Anantharam , Francois Baccelli

We propose a new framework for reasoning about information in complex systems. Our foundation is based on a variational extension of Shannon's information theory that takes into account the modeling power and computational constraints of…

Machine Learning · Computer Science 2020-02-26 Yilun Xu , Shengjia Zhao , Jiaming Song , Russell Stewart , Stefano Ermon

In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-27 Seth Gilbert , Calvin Newport , Nitin Vaidya , Alex Weaver

We investigate the fundamental limits of reliable communication over multi-view channels, in which the channel output is comprised of a large number of independent noisy views of a transmitted symbol. We consider first the setting of…

Information Theory · Computer Science 2024-05-14 V. Arvind Rameshwar , Nir Weinberger

The logical basis for information theory is the newly developed logic of partitions that is dual to the usual Boolean logic of subsets. The key concept is a "distinction" of a partition, an ordered pair of elements in distinct blocks of the…

Information Theory · Computer Science 2013-01-29 David Ellerman

Consider a stochastic nonlinear system controlled over a possibly noisy communication channel. An important problem is to characterize the largest class of channels for which there exist coding and control policies so that the closed-loop…

Optimization and Control · Mathematics 2021-02-11 Nicolas Garcia , Christoph Kawan , Serdar Yuksel

We review with a tutorial scope the information theory foundations of quantum statistical physics. Only a small proportion of the variables that characterize a system at the microscopic scale can be controlled, for both practical and…

Statistical Mechanics · Physics 2007-05-23 R. Balian

In our previous paper [Phys. Rev. E 95, 062122 (2017)] we considered the optical channel modelled by the nonlinear Schr\"odinger equation with zero dispersion and additive Gaussian noise. We found per-sample channel capacity rof this model.…

Information Theory · Computer Science 2019-01-23 A. V. Reznichenko , A. I. Chernykh , S. V. Smirnov , I. S. Terekhov

Similar to the energy flowing process in traditional heat engines, information could be considered to flow in the communication systems with the form of energy and entropy. Combining the thermodynamic Carnot machine and the classical…

Information Theory · Computer Science 2022-03-21 Muyuo Ruan , Xiaohu Ge

In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization…

Probability · Mathematics 2018-03-30 C. Soizea , R. Ghanem , C. Safta , X. Huan , Z. P. Vane , J. Oefelein , G. Lacaz , H. N. Najm , Q. Tang , X. Chen