Gaussian Network’s Dynamics Reflected into Geometric Entropy

摘要: We consider a geometric entropy as measure of complexity for Gaussian networks, namely networks having random variables sitting on vertices and their correlations weighted links. then show how the network dynamics described by well-known Ornstein–Uhlenbeck process reflects into such measure. unveil crossing time behaviors between switching off Moreover, depending number links switched or off, behavior can be non-monotonic.