Transmission of Information between Complex Networks: 1/f-Resonance

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:1007.2917

Scientific paper

We study the transport of information between two complex networks with similar properties. Both networks generate non-Poisson renewal fluctuations with a power-law spectrum 1/f^(3-\mu), the case \mu= 2 corresponding to ideal 1/f-noise. We denote by \mu_S and \mu_P the power-law indexes of the network "system" of interest S and the perturbing network P respectively. By adopting a generalized fluctuation-dissipation theorem (FDT) we show that the ideal condition of 1/f-noise for both networks corresponds to maximal information transport. We prove that to make the network S respond when \mu_S < 2 we have to set the condition \mu_P < 2. In the latter case, if \mu_P < \mu_S, the system S inherits the relaxation properties of the perturbing network. In the case where \mu_P > 2, no response and no information transmission occurs in the long-time limit. We consider two possible generalizations of the fluctuation-dissipation theorem and show that both lead to maximal information transport in the condition of 1/f-noise.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Transmission of Information between Complex Networks: 1/f-Resonance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Transmission of Information between Complex Networks: 1/f-Resonance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transmission of Information between Complex Networks: 1/f-Resonance will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-192275

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.