Mutual information rate and bounds for it.

The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously define...

Full description

Bibliographic Details
Main Authors: Murilo S Baptista, Rero M Rubinger, Emilson R Viana, José C Sartorelli, Ulrich Parlitz, Celso Grebogi
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2012-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC3480398?pdf=render
_version_ 1828200333075021824
author Murilo S Baptista
Rero M Rubinger
Emilson R Viana
José C Sartorelli
Ulrich Parlitz
Celso Grebogi
author_facet Murilo S Baptista
Rero M Rubinger
Emilson R Viana
José C Sartorelli
Ulrich Parlitz
Celso Grebogi
author_sort Murilo S Baptista
collection DOAJ
description The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.
first_indexed 2024-04-12T11:12:28Z
format Article
id doaj.art-9a5b4d03748348d99300c2382af110b7
institution Directory Open Access Journal
issn 1932-6203
language English
last_indexed 2024-04-12T11:12:28Z
publishDate 2012-01-01
publisher Public Library of Science (PLoS)
record_format Article
series PLoS ONE
spelling doaj.art-9a5b4d03748348d99300c2382af110b72022-12-22T03:35:35ZengPublic Library of Science (PLoS)PLoS ONE1932-62032012-01-01710e4674510.1371/journal.pone.0046745Mutual information rate and bounds for it.Murilo S BaptistaRero M RubingerEmilson R VianaJosé C SartorelliUlrich ParlitzCelso GrebogiThe amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.http://europepmc.org/articles/PMC3480398?pdf=render
spellingShingle Murilo S Baptista
Rero M Rubinger
Emilson R Viana
José C Sartorelli
Ulrich Parlitz
Celso Grebogi
Mutual information rate and bounds for it.
PLoS ONE
title Mutual information rate and bounds for it.
title_full Mutual information rate and bounds for it.
title_fullStr Mutual information rate and bounds for it.
title_full_unstemmed Mutual information rate and bounds for it.
title_short Mutual information rate and bounds for it.
title_sort mutual information rate and bounds for it
url http://europepmc.org/articles/PMC3480398?pdf=render
work_keys_str_mv AT murilosbaptista mutualinformationrateandboundsforit
AT reromrubinger mutualinformationrateandboundsforit
AT emilsonrviana mutualinformationrateandboundsforit
AT josecsartorelli mutualinformationrateandboundsforit
AT ulrichparlitz mutualinformationrateandboundsforit
AT celsogrebogi mutualinformationrateandboundsforit