gaussian network’s dynamics reflected into geometric entropy

Clicks: 137
ID: 223206
2015
We consider a geometric entropy as a measure of complexity for Gaussian networks, namely networks having Gaussian random variables sitting on vertices and their correlations as weighted links. We then show how the network dynamics described by the well-known Ornstein–Uhlenbeck process reflects into such a measure. We unveil a crossing of the entropy time behaviors between switching on and off links. Moreover, depending on the number of links switched on or off, the entropy time behavior can be non-monotonic.
Reference Key
felice2015entropygaussian Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Domenico Felice;Stefano Mancini
Journal European journal of medicinal chemistry
Year 2015
DOI 10.3390/e17085660
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.