Special Issue "Shannon Information and Kolmogorov Complexity"

A special issue of Entropy (ISSN 1099-4300).

Deadline for manuscript submissions: 31 October 2019.

Special Issue Editor

Prof. Miguel A. Fuentes
E-Mail Website
Guest Editor
Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA
Interests: Kolmogorov complexity; Shannon information; complexity science; nonlinear phenomena; stochastic calculus

Special Issue Information

Dear Colleagues,

In 1948, C.E. Shannon introduced the Shannon Information concept in his foundational paper: “A Mathematical Theory of Communication”. It was in the 1960s when several researchers, Solomonoff, Kolmogorov, and Chaitin, gave rise to the concept of Kolmogorov complexity in their seminal papers: “A Preliminary Report on a General Theory of Inductive Inference”, “Three Approaches to the Quantitative Definition of Information”, and “On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers”, respectively.

While Shannon’s point of view was mainly interested in the minimum expected number of bits to transmit a message from a random source through an error-free channel, the Kolmogorov complexity of a sequence of data, by contrast, measured the length of the shortest computer program that reproduces the sequence and halts.

Even though these two measures look similar, and use similar functional properties, they arguably refer to different, complementary problems: the information of a given communication process and the complexity of an object.

In this Special Issue, we are interested in original research discussing the relationship between these two measures, and their applications to physical and related systems. We welcome cross-disciplinary contribution focusing on the understanding of complex systems.

Prof. Miguel A. Fuentes
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Kolmogorov complexity
  • Shannon information
  • Complexity science
  • Nonlinear phenomena
  • Information theory

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Open AccessArticle
Kolmogorov Complexity of Coronary Sinus Atrial Electrograms before Ablation Predicts Termination of Atrial Fibrillation after Pulmonary Vein Isolation
Entropy 2019, 21(10), 970; https://doi.org/10.3390/e21100970 - 04 Oct 2019
Abstract
Atrial fibrillation (AF) is related to a very complex local electrical activity reflected in the rich morphology of intracardiac electrograms. The link between electrogram complexity and efficacy of the catheter ablation is unclear. We test the hypothesis that the Kolmogorov complexity of a [...] Read more.
Atrial fibrillation (AF) is related to a very complex local electrical activity reflected in the rich morphology of intracardiac electrograms. The link between electrogram complexity and efficacy of the catheter ablation is unclear. We test the hypothesis that the Kolmogorov complexity of a single atrial bipolar electrogram recorded during AF within the coronary sinus (CS) at the beginning of the catheter ablation may predict AF termination directly after pulmonary vein isolation (PVI). The study population consisted of 26 patients for whom 30 s baseline electrograms were recorded. In all cases PVI was performed. If AF persisted after PVI, ablation was extended beyond PVs. Kolmogorov complexity estimated by Lempel–Ziv complexity and the block decomposition method was calculated and compared with other measures: Shannon entropy, AF cycle length, dominant frequency, regularity, organization index, electrogram fractionation, sample entropy and wave morphology similarity index. A 5 s window length was chosen as optimal in calculations. There was a significant difference in Kolmogorov complexity between patients with AF termination directly after PVI compared to patients undergoing additional ablation (p < 0.01). No such difference was seen for remaining complexity parameters. Kolmogorov complexity of CS electrograms measured at baseline before PVI can predict self-termination of AF directly after PVI. Full article
(This article belongs to the Special Issue Shannon Information and Kolmogorov Complexity)
Back to TopTop